@movk/core 0.0.3 → 0.0.4

package/README.md

@@ -1,6 +1,7 @@
 # @movk/core
 
 [![TypeScript](https://img.shields.io/badge/TypeScript-Ready-blue.svg)](https://www.typescriptlang.org/)
+[![code style](https://antfu.me/badge-code-style.svg)](https://github.com/antfu/eslint-config)
 [![npm version][npm-version-src]][npm-version-href]
 [![npm downloads][npm-downloads-src]][npm-downloads-href]
 [![bundle][bundle-src]][bundle-href]

package/dist/index.d.mts

@@ -58,35 +58,6 @@ interface AppStorageReturn<T> {
     removeItem: () => void;
 }
 
-declare const _TreeNodeBaseSchema: z.ZodRecord<z.ZodString, z.ZodAny>;
-type TreeNodeBase = z.infer<typeof _TreeNodeBaseSchema>;
-type TreeNode<T extends TreeNodeBase = TreeNodeBase> = T & {
-    [K in TreeConfig['children']]: TreeNode<T>[];
-};
-declare const TreeConfigSchema: z.ZodObject<{
-    id: z.ZodDefault<z.ZodString>;
-    pid: z.ZodDefault<z.ZodString>;
-    children: z.ZodDefault<z.ZodString>;
-}, z.core.$strip>;
-type TreeConfig = z.infer<typeof TreeConfigSchema>;
-type TreeConfigInput = z.input<typeof TreeConfigSchema>;
-declare const TreeStatsSchema: z.ZodObject<{
-    total: z.ZodNumber;
-    leaves: z.ZodNumber;
-    depth: z.ZodNumber;
-    branches: z.ZodNumber;
-}, z.core.$strip>;
-type TreeStats = z.infer<typeof TreeStatsSchema>;
-interface TreeNodeResult<T extends TreeNodeBase = TreeNodeBase> {
-    readonly node: TreeNode<T>;
-    readonly path: readonly TreeNode<T>[];
-    readonly depth: number;
-    readonly index: number;
-}
-type TreePredicate<T extends TreeNodeBase = TreeNodeBase> = (node: TreeNode<T>, depth: number, path: readonly TreeNode<T>[]) => boolean;
-type TreeTransformer<T extends TreeNodeBase = TreeNodeBase, R extends TreeNodeBase = TreeNodeBase> = (node: TreeNode<T>, depth: number, path: readonly TreeNode<T>[]) => R;
-type TreeVisitor<T extends TreeNodeBase = TreeNodeBase> = (node: TreeNode<T>, depth: number, path: readonly TreeNode<T>[]) => void | boolean;
-
 /**
  * 应用存储管理的组合式函数，支持localStorage和sessionStorage
  *
@@ -170,36 +141,32 @@ declare function useAppStorage<T = unknown>(config: StorageConfigInput<T>): AppS
  */
 declare function useCopyCode(text: string): Promise<boolean>;
 
-/**
- * 树形数据结构操作类，提供树形数据的各种操作方法
- *
- * @category Data Structures
- * @example
- * ```ts
- * // 从扁平数组创建树形结构
- * const flatList = [
- *   { id: '1', name: '根节点', pid: null },
- *   { id: '2', name: '子节点1', pid: '1' },
- *   { id: '3', name: '子节点2', pid: '1' },
- *   { id: '4', name: '孙节点', pid: '2' }
- * ]
- *
- * const tree = Tree.fromList(flatList)
- * console.log(tree) // 树形结构
- *
- * // 查找节点
- * const found = Tree.find(tree, (node) => node.name === '子节点1')
- *
- * // 过滤节点
- * const filtered = Tree.filter(tree, (node) => node.name.includes('子'))
- *
- * // 转换树形结构
- * const transformed = Tree.transform(tree, (node) => ({
- *   ...node,
- *   displayName: `[${node.name}]`
- * }))
- * ```
- */
+type TreeNode<T = any> = T & {
+    children?: TreeNode<T>[];
+    [key: string]: any;
+};
+declare const TreeConfigSchema: z.ZodObject<{
+    id: z.ZodDefault<z.ZodString>;
+    pid: z.ZodDefault<z.ZodString>;
+    children: z.ZodDefault<z.ZodString>;
+}, z.core.$strip>;
+type TreeConfigInput = z.input<typeof TreeConfigSchema>;
+declare const _TreeStatsSchema: z.ZodObject<{
+    total: z.ZodNumber;
+    leaves: z.ZodNumber;
+    depth: z.ZodNumber;
+    branches: z.ZodNumber;
+}, z.core.$strip>;
+type TreeStats = z.infer<typeof _TreeStatsSchema>;
+interface TreeNodeResult<T = any> {
+    readonly node: TreeNode<T>;
+    readonly path: readonly TreeNode<T>[];
+    readonly depth: number;
+    readonly index: number;
+}
+type TreePredicate<T = any> = (node: TreeNode<T>, depth: number, path: readonly TreeNode<T>[]) => boolean;
+type TreeTransformer<T = any, R = any> = (node: TreeNode<T>, depth: number, path: readonly TreeNode<T>[]) => R;
+type TreeVisitor<T = any> = (node: TreeNode<T>, depth: number, path: readonly TreeNode<T>[]) => void | boolean;
 declare class Tree {
     private static dfsGenerator;
     private static bfsGenerator;
@@ -229,7 +196,7 @@ declare class Tree {
      * console.log(tree) // 转换为树形结构
      * ```
      */
-    static fromList<T extends TreeNodeBase>(list: T[], config?: TreeConfigInput): TreeNode<T>[];
+    static fromList<T = any>(list: T[], config?: TreeConfigInput): TreeNode<T>[];
     /**
      * 将树形结构转换为扁平数组
      *
@@ -254,124 +221,328 @@ declare class Tree {
      * console.log(flatList) // [{ id: '1', name: '根节点' }, { id: '2', name: '子节点1' }, ...]
      * ```
      */
-    static toList<T extends TreeNodeBase>(tree: TreeNode<T> | TreeNode<T>[], config?: TreeConfigInput): T[];
-    static estimateSize<T extends TreeNodeBase>(tree: TreeNode<T> | TreeNode<T>[], config?: TreeConfigInput): number;
-    static find<T extends TreeNodeBase>(tree: TreeNode<T> | TreeNode<T>[], predicate: TreePredicate<T>, config?: TreeConfigInput): TreeNodeResult<T> | undefined;
-    static findAll<T extends TreeNodeBase>(tree: TreeNode<T> | TreeNode<T>[], predicate: TreePredicate<T>, config?: TreeConfigInput): TreeNodeResult<T>[];
-    static findById<T extends TreeNodeBase>(tree: TreeNode<T> | TreeNode<T>[], id: string, config?: TreeConfigInput): TreeNodeResult<T> | undefined;
-    static getStats<T extends TreeNodeBase>(tree: TreeNode<T> | TreeNode<T>[], config?: TreeConfigInput): TreeStats;
-    static filter<T extends TreeNodeBase>(tree: TreeNode<T> | TreeNode<T>[], predicate: TreePredicate<T>, config?: TreeConfigInput): TreeNode<T>[];
-    static transform<T extends TreeNodeBase, R extends TreeNodeBase>(tree: TreeNode<T> | TreeNode<T>[], transformer: TreeTransformer<T, R>, config?: TreeConfigInput): TreeNode<R>[];
-    static forEach<T extends TreeNodeBase>(tree: TreeNode<T> | TreeNode<T>[], visitor: TreeVisitor<T>, config?: TreeConfigInput): void;
-    static insertBefore<T extends TreeNodeBase>(tree: TreeNode<T>[], targetId: string, newNode: T, config?: TreeConfigInput): boolean;
-    static insertAfter<T extends TreeNodeBase>(tree: TreeNode<T>[], targetId: string, newNode: T, config?: TreeConfigInput): boolean;
-    static remove<T extends TreeNodeBase>(tree: TreeNode<T>[], targetId: string, config?: TreeConfigInput): TreeNode<T> | undefined;
-    static validate<T extends TreeNodeBase>(tree: TreeNode<T> | TreeNode<T>[], config?: TreeConfigInput): {
+    static toList<T = any>(tree: TreeNode<T> | TreeNode<T>[], config?: TreeConfigInput): T[];
+    /**
+     * 估算树形结构的节点数量
+     *
+     * @category Data Structures
+     * @param tree 树形结构（单个节点或节点数组）
+     * @param config 树形配置选项
+     * @returns 节点总数量
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     name: '根节点',
+     *     children: [
+     *       { id: '2', name: '子节点1', children: [] },
+     *       { id: '3', name: '子节点2', children: [] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const size = Tree.estimateSize(tree)
+     * console.log(size) // 3
+     * ```
+     */
+    static estimateSize<T = any>(tree: TreeNode<T> | TreeNode<T>[], config?: TreeConfigInput): number;
+    /**
+     * 查找树中第一个满足条件的节点
+     *
+     * @category Data Structures
+     * @param tree 树形结构（单个节点或节点数组）
+     * @param predicate 查找条件函数
+     * @param config 树形配置选项
+     * @returns 匹配的节点结果，包含节点、路径、深度和索引信息；未找到时返回undefined
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     name: '部门1',
+     *     children: [
+     *       { id: '2', name: '部门1-1', children: [] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const result = Tree.find(tree, (node) => node.name === '部门1-1')
+     * console.log(result?.node.id) // '2'
+     * console.log(result?.depth) // 1
+     * ```
+     */
+    static find<T = any>(tree: TreeNode<T> | TreeNode<T>[], predicate: TreePredicate<T>, config?: TreeConfigInput): TreeNodeResult<T> | undefined;
+    /**
+     * 查找树中所有满足条件的节点
+     *
+     * @category Data Structures
+     * @param tree 树形结构（单个节点或节点数组）
+     * @param predicate 查找条件函数
+     * @param config 树形配置选项
+     * @returns 所有匹配的节点结果数组，每个结果包含节点、路径、深度和索引信息
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     type: 'folder',
+     *     name: '根目录',
+     *     children: [
+     *       { id: '2', type: 'file', name: '文件1', children: [] },
+     *       { id: '3', type: 'file', name: '文件2', children: [] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const files = Tree.findAll(tree, (node) => node.type === 'file')
+     * console.log(files.length) // 2
+     * ```
+     */
+    static findAll<T = any>(tree: TreeNode<T> | TreeNode<T>[], predicate: TreePredicate<T>, config?: TreeConfigInput): TreeNodeResult<T>[];
+    /**
+     * 根据ID查找树中的节点
+     *
+     * @category Data Structures
+     * @param tree 树形结构（单个节点或节点数组）
+     * @param id 要查找的节点ID
+     * @param config 树形配置选项
+     * @returns 匹配的节点结果，包含节点、路径、深度和索引信息；未找到时返回undefined
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     name: '根节点',
+     *     children: [
+     *       { id: '2', name: '子节点', children: [] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const result = Tree.findById(tree, '2')
+     * console.log(result?.node.name) // '子节点'
+     * ```
+     */
+    static findById<T = any>(tree: TreeNode<T> | TreeNode<T>[], id: string, config?: TreeConfigInput): TreeNodeResult<T> | undefined;
+    /**
+     * 获取树形结构的统计信息
+     *
+     * @category Data Structures
+     * @param tree 树形结构（单个节点或节点数组）
+     * @param config 树形配置选项
+     * @returns 树的统计信息，包含总节点数、叶子节点数、最大深度和分支节点数
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     name: '根节点',
+     *     children: [
+     *       { id: '2', name: '子节点1', children: [] },
+     *       { id: '3', name: '子节点2', children: [
+     *         { id: '4', name: '孙节点', children: [] }
+     *       ] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const stats = Tree.getStats(tree)
+     * console.log(stats) // { total: 4, leaves: 2, depth: 3, branches: 2 }
+     * ```
+     */
+    static getStats<T = any>(tree: TreeNode<T> | TreeNode<T>[], config?: TreeConfigInput): TreeStats;
+    /**
+     * 过滤树形结构，保留满足条件的节点及其祖先和后代
+     *
+     * @category Data Structures
+     * @param tree 树形结构（单个节点或节点数组）
+     * @param predicate 过滤条件函数
+     * @param config 树形配置选项
+     * @returns 过滤后的树形结构数组
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     type: 'folder',
+     *     name: '根目录',
+     *     children: [
+     *       { id: '2', type: 'file', name: '文档.txt', children: [] },
+     *       { id: '3', type: 'folder', name: '子目录', children: [
+     *         { id: '4', type: 'file', name: '图片.jpg', children: [] }
+     *       ] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const filtered = Tree.filter(tree, (node) => node.type === 'file')
+     * // 返回包含所有文件节点及其父级路径的树结构
+     * ```
+     */
+    static filter<T = any>(tree: TreeNode<T> | TreeNode<T>[], predicate: TreePredicate<T>, config?: TreeConfigInput): TreeNode<T>[];
+    /**
+     * 转换树形结构，将每个节点转换为新的结构
+     *
+     * @category Data Structures
+     * @param tree 树形结构（单个节点或节点数组）
+     * @param transformer 节点转换函数
+     * @param config 树形配置选项
+     * @returns 转换后的树形结构数组
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     name: '部门1',
+     *     children: [
+     *       { id: '2', name: '部门1-1', children: [] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const transformed = Tree.transform(tree, (node, depth) => ({
+     *   key: node.id,
+     *   title: node.name,
+     *   level: depth
+     * }))
+     * // 转换为新的数据结构
+     * ```
+     */
+    static transform<T = any, R = any>(tree: TreeNode<T> | TreeNode<T>[], transformer: TreeTransformer<T, R>, config?: TreeConfigInput): TreeNode<R>[];
+    /**
+     * 遍历树形结构的每个节点
+     *
+     * @category Data Structures
+     * @param tree 树形结构（单个节点或节点数组）
+     * @param visitor 访问者函数，返回false可以跳过子节点的遍历
+     * @param config 树形配置选项
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     name: '根节点',
+     *     children: [
+     *       { id: '2', name: '子节点', children: [] }
+     *     ]
+     *   }
+     * ]
+     *
+     * Tree.forEach(tree, (node, depth) => {
+     *   console.log(`${' '.repeat(depth * 2)}${node.name}`)
+     *   // 输出缩进的树结构
+     * })
+     * ```
+     */
+    static forEach<T = any>(tree: TreeNode<T> | TreeNode<T>[], visitor: TreeVisitor<T>, config?: TreeConfigInput): void;
+    /**
+     * 在指定节点前插入新节点
+     *
+     * @category Data Structures
+     * @param tree 树形结构数组
+     * @param targetId 目标节点的ID
+     * @param newNode 要插入的新节点数据
+     * @param config 树形配置选项
+     * @returns 是否成功插入
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     name: '节点1',
+     *     children: [
+     *       { id: '2', name: '节点2', children: [] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const success = Tree.insertBefore(tree, '2', { id: '1.5', name: '新节点' })
+     * console.log(success) // true
+     * ```
+     */
+    static insertBefore<T = any>(tree: TreeNode<T>[], targetId: string, newNode: T, config?: TreeConfigInput): boolean;
+    /**
+     * 在指定节点后插入新节点
+     *
+     * @category Data Structures
+     * @param tree 树形结构数组
+     * @param targetId 目标节点的ID
+     * @param newNode 要插入的新节点数据
+     * @param config 树形配置选项
+     * @returns 是否成功插入
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     name: '节点1',
+     *     children: [
+     *       { id: '2', name: '节点2', children: [] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const success = Tree.insertAfter(tree, '2', { id: '3', name: '新节点' })
+     * console.log(success) // true
+     * ```
+     */
+    static insertAfter<T = any>(tree: TreeNode<T>[], targetId: string, newNode: T, config?: TreeConfigInput): boolean;
+    /**
+     * 从树中删除指定节点
+     *
+     * @category Data Structures
+     * @param tree 树形结构数组
+     * @param targetId 要删除的节点ID
+     * @param config 树形配置选项
+     * @returns 被删除的节点，未找到时返回undefined
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     name: '根节点',
+     *     children: [
+     *       { id: '2', name: '子节点', children: [] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const removed = Tree.remove(tree, '2')
+     * console.log(removed?.name) // '子节点'
+     * ```
+     */
+    static remove<T = any>(tree: TreeNode<T>[], targetId: string, config?: TreeConfigInput): TreeNode<T> | undefined;
+    /**
+     * 验证树形结构的有效性
+     *
+     * @category Data Structures
+     * @param tree 树形结构（单个节点或节点数组）
+     * @param config 树形配置选项
+     * @returns 验证结果，包含是否有效和错误信息数组
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     name: '根节点',
+     *     children: [
+     *       { id: '2', name: '子节点', children: [] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const result = Tree.validate(tree)
+     * console.log(result.isValid) // true
+     * console.log(result.errors) // []
+     * ```
+     */
+    static validate<T = any>(tree: TreeNode<T> | TreeNode<T>[], config?: TreeConfigInput): {
         isValid: boolean;
         errors: string[];
     };
 }
 
-/**
- * UnoCSS Flex布局预设，提供便捷的flex布局工具类
- *
- * @category Framework
- * @returns UnoCSS预设配置对象
- * @example
- * ```ts
- * // 在unocss.config.ts中使用
- * import { presetFlex } from '@movk/core'
- *
- * export default defineConfig({
- *   presets: [
- *     presetFlex(),
- *     // 其他预设...
- *   ]
- * })
- *
- * // 在HTML中使用生成的类名
- * <div class="flex-row-center-center">居中的flex容器</div>
- * <div class="flex-col-between-start">纵向分散对齐</div>
- * <div class="flex-center">完全居中</div>
- * <div class="flex-x-center">水平居中</div>
- * <div class="flex-y-center">垂直居中</div>
- * ```
- */
-declare function presetFlex(): {
-    name: string;
-    rules: ((RegExp | (([, d, j, a]: string[], { rawSelector }: {
-        rawSelector: string;
-    }) => Record<string, string>) | {
-        autocomplete: string;
-    })[] | (string | {
-        display: string;
-        'justify-content': string;
-        'align-items': string;
-    })[])[];
-    shortcuts: {
-        'flex-x-center': string;
-        'flex-y-center': string;
-        'inline-flex-x-center': string;
-        'inline-flex-y-center': string;
-    }[];
-};
-
-interface RuleContext {
-    rawSelector: string;
-}
-/**
- * UnoCSS 猫头鹰选择器预设，提供基于相邻兄弟选择器的间距和分隔符工具类
- *
- * @category Framework
- * @returns UnoCSS预设配置对象
- * @example
- * ```ts
- * // 在unocss.config.ts中使用
- * import { presetOwl } from '@movk/core'
- *
- * export default defineConfig({
- *   presets: [
- *     presetOwl(),
- *     // 其他预设...
- *   ]
- * })
- *
- * // 在HTML中使用生成的类名
- * <div class="owl-y-4">
- *   <div>项目1</div>
- *   <div>项目2</div>  <!-- 上边距 1rem -->
- *   <div>项目3</div>  <!-- 上边距 1rem -->
- * </div>
- *
- * <div class="owl-x-2">
- *   <span>按钮1</span>
- *   <span>按钮2</span>  <!-- 左边距 0.5rem -->
- *   <span>按钮3</span>  <!-- 左边距 0.5rem -->
- * </div>
- *
- * <div class="owl-divide-gray-200">
- *   <div>列表项1</div>
- *   <div>列表项2</div>  <!-- 上边框分隔线 -->
- *   <div>列表项3</div>  <!-- 上边框分隔线 -->
- * </div>
- * ```
- */
-declare function presetOwl(): {
-    name: string;
-    rules: (RegExp | (([, value]: string[], { rawSelector }: RuleContext) => string | undefined) | {
-        autocomplete: string;
-    })[][];
-    shortcuts: {
-        'owl-stack': string;
-        'owl-stack-tight': string;
-        'owl-stack-loose': string;
-        'owl-list': string;
-        'owl-list-tight': string;
-        'owl-nav': string;
-        'owl-card-stack': string;
-    }[];
-};
-
 /**
  * 数组去重，返回去除重复元素后的新数组
  *
@@ -1001,5 +1172,5 @@ declare function isFunction(value: any): value is (...args: any[]) => any;
  */
 declare function isEmpty(value: any): boolean;
 
-export { StorageTypeSchema, Tree, TreeConfigSchema, TreeStatsSchema, camelToKebab, capitalize, chunk, convertSvgToPng, convertToKebabCase, createStorageConfigSchema, debounce, deepClone, extractFilename, flatten, formatFileSize, getRandomUUID, isArray, isEmpty, isFunction, isNumber, isObject, isString, kebabToCamel, omit, omitUndefined, pick, presetFlex, presetOwl, replaceCurrentColor, separate, simpleHash, sleep, sleepWithCancel, throttle, triggerDownload, unique, useAppStorage, useCopyCode };
-export type { AnyObject, AppStorageReturn, DeepPartial, FirstParam, FirstParameter, GetObjectField, MutableByKeys, OmitByKey, PartialByKeys, PickByKey, ReadonlyByKeys, RenameKeys, RequiredByKeys, StorageConfig, StorageConfigInput, StorageType, StringOrVNode, TreeConfig, TreeConfigInput, TreeNode, TreeNodeBase, TreeNodeResult, TreePredicate, TreeStats, TreeTransformer, TreeVisitor, UnionToIntersection };
+export { StorageTypeSchema, Tree, camelToKebab, capitalize, chunk, convertSvgToPng, convertToKebabCase, createStorageConfigSchema, debounce, deepClone, extractFilename, flatten, formatFileSize, getRandomUUID, isArray, isEmpty, isFunction, isNumber, isObject, isString, kebabToCamel, omit, omitUndefined, pick, replaceCurrentColor, separate, simpleHash, sleep, sleepWithCancel, throttle, triggerDownload, unique, useAppStorage, useCopyCode };
+export type { AnyObject, AppStorageReturn, DeepPartial, FirstParam, FirstParameter, GetObjectField, MutableByKeys, OmitByKey, PartialByKeys, PickByKey, ReadonlyByKeys, RenameKeys, RequiredByKeys, StorageConfig, StorageConfigInput, StorageType, StringOrVNode, UnionToIntersection };

package/dist/index.d.ts

@@ -58,35 +58,6 @@ interface AppStorageReturn<T> {
     removeItem: () => void;
 }
 
-declare const _TreeNodeBaseSchema: z.ZodRecord<z.ZodString, z.ZodAny>;
-type TreeNodeBase = z.infer<typeof _TreeNodeBaseSchema>;
-type TreeNode<T extends TreeNodeBase = TreeNodeBase> = T & {
-    [K in TreeConfig['children']]: TreeNode<T>[];
-};
-declare const TreeConfigSchema: z.ZodObject<{
-    id: z.ZodDefault<z.ZodString>;
-    pid: z.ZodDefault<z.ZodString>;
-    children: z.ZodDefault<z.ZodString>;
-}, z.core.$strip>;
-type TreeConfig = z.infer<typeof TreeConfigSchema>;
-type TreeConfigInput = z.input<typeof TreeConfigSchema>;
-declare const TreeStatsSchema: z.ZodObject<{
-    total: z.ZodNumber;
-    leaves: z.ZodNumber;
-    depth: z.ZodNumber;
-    branches: z.ZodNumber;
-}, z.core.$strip>;
-type TreeStats = z.infer<typeof TreeStatsSchema>;
-interface TreeNodeResult<T extends TreeNodeBase = TreeNodeBase> {
-    readonly node: TreeNode<T>;
-    readonly path: readonly TreeNode<T>[];
-    readonly depth: number;
-    readonly index: number;
-}
-type TreePredicate<T extends TreeNodeBase = TreeNodeBase> = (node: TreeNode<T>, depth: number, path: readonly TreeNode<T>[]) => boolean;
-type TreeTransformer<T extends TreeNodeBase = TreeNodeBase, R extends TreeNodeBase = TreeNodeBase> = (node: TreeNode<T>, depth: number, path: readonly TreeNode<T>[]) => R;
-type TreeVisitor<T extends TreeNodeBase = TreeNodeBase> = (node: TreeNode<T>, depth: number, path: readonly TreeNode<T>[]) => void | boolean;
-
 /**
  * 应用存储管理的组合式函数，支持localStorage和sessionStorage
  *
@@ -170,36 +141,32 @@ declare function useAppStorage<T = unknown>(config: StorageConfigInput<T>): AppS
  */
 declare function useCopyCode(text: string): Promise<boolean>;
 
-/**
- * 树形数据结构操作类，提供树形数据的各种操作方法
- *
- * @category Data Structures
- * @example
- * ```ts
- * // 从扁平数组创建树形结构
- * const flatList = [
- *   { id: '1', name: '根节点', pid: null },
- *   { id: '2', name: '子节点1', pid: '1' },
- *   { id: '3', name: '子节点2', pid: '1' },
- *   { id: '4', name: '孙节点', pid: '2' }
- * ]
- *
- * const tree = Tree.fromList(flatList)
- * console.log(tree) // 树形结构
- *
- * // 查找节点
- * const found = Tree.find(tree, (node) => node.name === '子节点1')
- *
- * // 过滤节点
- * const filtered = Tree.filter(tree, (node) => node.name.includes('子'))
- *
- * // 转换树形结构
- * const transformed = Tree.transform(tree, (node) => ({
- *   ...node,
- *   displayName: `[${node.name}]`
- * }))
- * ```
- */
+type TreeNode<T = any> = T & {
+    children?: TreeNode<T>[];
+    [key: string]: any;
+};
+declare const TreeConfigSchema: z.ZodObject<{
+    id: z.ZodDefault<z.ZodString>;
+    pid: z.ZodDefault<z.ZodString>;
+    children: z.ZodDefault<z.ZodString>;
+}, z.core.$strip>;
+type TreeConfigInput = z.input<typeof TreeConfigSchema>;
+declare const _TreeStatsSchema: z.ZodObject<{
+    total: z.ZodNumber;
+    leaves: z.ZodNumber;
+    depth: z.ZodNumber;
+    branches: z.ZodNumber;
+}, z.core.$strip>;
+type TreeStats = z.infer<typeof _TreeStatsSchema>;
+interface TreeNodeResult<T = any> {
+    readonly node: TreeNode<T>;
+    readonly path: readonly TreeNode<T>[];
+    readonly depth: number;
+    readonly index: number;
+}
+type TreePredicate<T = any> = (node: TreeNode<T>, depth: number, path: readonly TreeNode<T>[]) => boolean;
+type TreeTransformer<T = any, R = any> = (node: TreeNode<T>, depth: number, path: readonly TreeNode<T>[]) => R;
+type TreeVisitor<T = any> = (node: TreeNode<T>, depth: number, path: readonly TreeNode<T>[]) => void | boolean;
 declare class Tree {
     private static dfsGenerator;
     private static bfsGenerator;
@@ -229,7 +196,7 @@ declare class Tree {
      * console.log(tree) // 转换为树形结构
      * ```
      */
-    static fromList<T extends TreeNodeBase>(list: T[], config?: TreeConfigInput): TreeNode<T>[];
+    static fromList<T = any>(list: T[], config?: TreeConfigInput): TreeNode<T>[];
     /**
      * 将树形结构转换为扁平数组
      *
@@ -254,124 +221,328 @@ declare class Tree {
      * console.log(flatList) // [{ id: '1', name: '根节点' }, { id: '2', name: '子节点1' }, ...]
      * ```
      */
-    static toList<T extends TreeNodeBase>(tree: TreeNode<T> | TreeNode<T>[], config?: TreeConfigInput): T[];
-    static estimateSize<T extends TreeNodeBase>(tree: TreeNode<T> | TreeNode<T>[], config?: TreeConfigInput): number;
-    static find<T extends TreeNodeBase>(tree: TreeNode<T> | TreeNode<T>[], predicate: TreePredicate<T>, config?: TreeConfigInput): TreeNodeResult<T> | undefined;
-    static findAll<T extends TreeNodeBase>(tree: TreeNode<T> | TreeNode<T>[], predicate: TreePredicate<T>, config?: TreeConfigInput): TreeNodeResult<T>[];
-    static findById<T extends TreeNodeBase>(tree: TreeNode<T> | TreeNode<T>[], id: string, config?: TreeConfigInput): TreeNodeResult<T> | undefined;
-    static getStats<T extends TreeNodeBase>(tree: TreeNode<T> | TreeNode<T>[], config?: TreeConfigInput): TreeStats;
-    static filter<T extends TreeNodeBase>(tree: TreeNode<T> | TreeNode<T>[], predicate: TreePredicate<T>, config?: TreeConfigInput): TreeNode<T>[];
-    static transform<T extends TreeNodeBase, R extends TreeNodeBase>(tree: TreeNode<T> | TreeNode<T>[], transformer: TreeTransformer<T, R>, config?: TreeConfigInput): TreeNode<R>[];
-    static forEach<T extends TreeNodeBase>(tree: TreeNode<T> | TreeNode<T>[], visitor: TreeVisitor<T>, config?: TreeConfigInput): void;
-    static insertBefore<T extends TreeNodeBase>(tree: TreeNode<T>[], targetId: string, newNode: T, config?: TreeConfigInput): boolean;
-    static insertAfter<T extends TreeNodeBase>(tree: TreeNode<T>[], targetId: string, newNode: T, config?: TreeConfigInput): boolean;
-    static remove<T extends TreeNodeBase>(tree: TreeNode<T>[], targetId: string, config?: TreeConfigInput): TreeNode<T> | undefined;
-    static validate<T extends TreeNodeBase>(tree: TreeNode<T> | TreeNode<T>[], config?: TreeConfigInput): {
+    static toList<T = any>(tree: TreeNode<T> | TreeNode<T>[], config?: TreeConfigInput): T[];
+    /**
+     * 估算树形结构的节点数量
+     *
+     * @category Data Structures
+     * @param tree 树形结构（单个节点或节点数组）
+     * @param config 树形配置选项
+     * @returns 节点总数量
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     name: '根节点',
+     *     children: [
+     *       { id: '2', name: '子节点1', children: [] },
+     *       { id: '3', name: '子节点2', children: [] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const size = Tree.estimateSize(tree)
+     * console.log(size) // 3
+     * ```
+     */
+    static estimateSize<T = any>(tree: TreeNode<T> | TreeNode<T>[], config?: TreeConfigInput): number;
+    /**
+     * 查找树中第一个满足条件的节点
+     *
+     * @category Data Structures
+     * @param tree 树形结构（单个节点或节点数组）
+     * @param predicate 查找条件函数
+     * @param config 树形配置选项
+     * @returns 匹配的节点结果，包含节点、路径、深度和索引信息；未找到时返回undefined
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     name: '部门1',
+     *     children: [
+     *       { id: '2', name: '部门1-1', children: [] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const result = Tree.find(tree, (node) => node.name === '部门1-1')
+     * console.log(result?.node.id) // '2'
+     * console.log(result?.depth) // 1
+     * ```
+     */
+    static find<T = any>(tree: TreeNode<T> | TreeNode<T>[], predicate: TreePredicate<T>, config?: TreeConfigInput): TreeNodeResult<T> | undefined;
+    /**
+     * 查找树中所有满足条件的节点
+     *
+     * @category Data Structures
+     * @param tree 树形结构（单个节点或节点数组）
+     * @param predicate 查找条件函数
+     * @param config 树形配置选项
+     * @returns 所有匹配的节点结果数组，每个结果包含节点、路径、深度和索引信息
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     type: 'folder',
+     *     name: '根目录',
+     *     children: [
+     *       { id: '2', type: 'file', name: '文件1', children: [] },
+     *       { id: '3', type: 'file', name: '文件2', children: [] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const files = Tree.findAll(tree, (node) => node.type === 'file')
+     * console.log(files.length) // 2
+     * ```
+     */
+    static findAll<T = any>(tree: TreeNode<T> | TreeNode<T>[], predicate: TreePredicate<T>, config?: TreeConfigInput): TreeNodeResult<T>[];
+    /**
+     * 根据ID查找树中的节点
+     *
+     * @category Data Structures
+     * @param tree 树形结构（单个节点或节点数组）
+     * @param id 要查找的节点ID
+     * @param config 树形配置选项
+     * @returns 匹配的节点结果，包含节点、路径、深度和索引信息；未找到时返回undefined
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     name: '根节点',
+     *     children: [
+     *       { id: '2', name: '子节点', children: [] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const result = Tree.findById(tree, '2')
+     * console.log(result?.node.name) // '子节点'
+     * ```
+     */
+    static findById<T = any>(tree: TreeNode<T> | TreeNode<T>[], id: string, config?: TreeConfigInput): TreeNodeResult<T> | undefined;
+    /**
+     * 获取树形结构的统计信息
+     *
+     * @category Data Structures
+     * @param tree 树形结构（单个节点或节点数组）
+     * @param config 树形配置选项
+     * @returns 树的统计信息，包含总节点数、叶子节点数、最大深度和分支节点数
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     name: '根节点',
+     *     children: [
+     *       { id: '2', name: '子节点1', children: [] },
+     *       { id: '3', name: '子节点2', children: [
+     *         { id: '4', name: '孙节点', children: [] }
+     *       ] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const stats = Tree.getStats(tree)
+     * console.log(stats) // { total: 4, leaves: 2, depth: 3, branches: 2 }
+     * ```
+     */
+    static getStats<T = any>(tree: TreeNode<T> | TreeNode<T>[], config?: TreeConfigInput): TreeStats;
+    /**
+     * 过滤树形结构，保留满足条件的节点及其祖先和后代
+     *
+     * @category Data Structures
+     * @param tree 树形结构（单个节点或节点数组）
+     * @param predicate 过滤条件函数
+     * @param config 树形配置选项
+     * @returns 过滤后的树形结构数组
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     type: 'folder',
+     *     name: '根目录',
+     *     children: [
+     *       { id: '2', type: 'file', name: '文档.txt', children: [] },
+     *       { id: '3', type: 'folder', name: '子目录', children: [
+     *         { id: '4', type: 'file', name: '图片.jpg', children: [] }
+     *       ] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const filtered = Tree.filter(tree, (node) => node.type === 'file')
+     * // 返回包含所有文件节点及其父级路径的树结构
+     * ```
+     */
+    static filter<T = any>(tree: TreeNode<T> | TreeNode<T>[], predicate: TreePredicate<T>, config?: TreeConfigInput): TreeNode<T>[];
+    /**
+     * 转换树形结构，将每个节点转换为新的结构
+     *
+     * @category Data Structures
+     * @param tree 树形结构（单个节点或节点数组）
+     * @param transformer 节点转换函数
+     * @param config 树形配置选项
+     * @returns 转换后的树形结构数组
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     name: '部门1',
+     *     children: [
+     *       { id: '2', name: '部门1-1', children: [] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const transformed = Tree.transform(tree, (node, depth) => ({
+     *   key: node.id,
+     *   title: node.name,
+     *   level: depth
+     * }))
+     * // 转换为新的数据结构
+     * ```
+     */
+    static transform<T = any, R = any>(tree: TreeNode<T> | TreeNode<T>[], transformer: TreeTransformer<T, R>, config?: TreeConfigInput): TreeNode<R>[];
+    /**
+     * 遍历树形结构的每个节点
+     *
+     * @category Data Structures
+     * @param tree 树形结构（单个节点或节点数组）
+     * @param visitor 访问者函数，返回false可以跳过子节点的遍历
+     * @param config 树形配置选项
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     name: '根节点',
+     *     children: [
+     *       { id: '2', name: '子节点', children: [] }
+     *     ]
+     *   }
+     * ]
+     *
+     * Tree.forEach(tree, (node, depth) => {
+     *   console.log(`${' '.repeat(depth * 2)}${node.name}`)
+     *   // 输出缩进的树结构
+     * })
+     * ```
+     */
+    static forEach<T = any>(tree: TreeNode<T> | TreeNode<T>[], visitor: TreeVisitor<T>, config?: TreeConfigInput): void;
+    /**
+     * 在指定节点前插入新节点
+     *
+     * @category Data Structures
+     * @param tree 树形结构数组
+     * @param targetId 目标节点的ID
+     * @param newNode 要插入的新节点数据
+     * @param config 树形配置选项
+     * @returns 是否成功插入
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     name: '节点1',
+     *     children: [
+     *       { id: '2', name: '节点2', children: [] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const success = Tree.insertBefore(tree, '2', { id: '1.5', name: '新节点' })
+     * console.log(success) // true
+     * ```
+     */
+    static insertBefore<T = any>(tree: TreeNode<T>[], targetId: string, newNode: T, config?: TreeConfigInput): boolean;
+    /**
+     * 在指定节点后插入新节点
+     *
+     * @category Data Structures
+     * @param tree 树形结构数组
+     * @param targetId 目标节点的ID
+     * @param newNode 要插入的新节点数据
+     * @param config 树形配置选项
+     * @returns 是否成功插入
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     name: '节点1',
+     *     children: [
+     *       { id: '2', name: '节点2', children: [] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const success = Tree.insertAfter(tree, '2', { id: '3', name: '新节点' })
+     * console.log(success) // true
+     * ```
+     */
+    static insertAfter<T = any>(tree: TreeNode<T>[], targetId: string, newNode: T, config?: TreeConfigInput): boolean;
+    /**
+     * 从树中删除指定节点
+     *
+     * @category Data Structures
+     * @param tree 树形结构数组
+     * @param targetId 要删除的节点ID
+     * @param config 树形配置选项
+     * @returns 被删除的节点，未找到时返回undefined
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     name: '根节点',
+     *     children: [
+     *       { id: '2', name: '子节点', children: [] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const removed = Tree.remove(tree, '2')
+     * console.log(removed?.name) // '子节点'
+     * ```
+     */
+    static remove<T = any>(tree: TreeNode<T>[], targetId: string, config?: TreeConfigInput): TreeNode<T> | undefined;
+    /**
+     * 验证树形结构的有效性
+     *
+     * @category Data Structures
+     * @param tree 树形结构（单个节点或节点数组）
+     * @param config 树形配置选项
+     * @returns 验证结果，包含是否有效和错误信息数组
+     * @example
+     * ```ts
+     * const tree = [
+     *   {
+     *     id: '1',
+     *     name: '根节点',
+     *     children: [
+     *       { id: '2', name: '子节点', children: [] }
+     *     ]
+     *   }
+     * ]
+     *
+     * const result = Tree.validate(tree)
+     * console.log(result.isValid) // true
+     * console.log(result.errors) // []
+     * ```
+     */
+    static validate<T = any>(tree: TreeNode<T> | TreeNode<T>[], config?: TreeConfigInput): {
         isValid: boolean;
         errors: string[];
     };
 }
 
-/**
- * UnoCSS Flex布局预设，提供便捷的flex布局工具类
- *
- * @category Framework
- * @returns UnoCSS预设配置对象
- * @example
- * ```ts
- * // 在unocss.config.ts中使用
- * import { presetFlex } from '@movk/core'
- *
- * export default defineConfig({
- *   presets: [
- *     presetFlex(),
- *     // 其他预设...
- *   ]
- * })
- *
- * // 在HTML中使用生成的类名
- * <div class="flex-row-center-center">居中的flex容器</div>
- * <div class="flex-col-between-start">纵向分散对齐</div>
- * <div class="flex-center">完全居中</div>
- * <div class="flex-x-center">水平居中</div>
- * <div class="flex-y-center">垂直居中</div>
- * ```
- */
-declare function presetFlex(): {
-    name: string;
-    rules: ((RegExp | (([, d, j, a]: string[], { rawSelector }: {
-        rawSelector: string;
-    }) => Record<string, string>) | {
-        autocomplete: string;
-    })[] | (string | {
-        display: string;
-        'justify-content': string;
-        'align-items': string;
-    })[])[];
-    shortcuts: {
-        'flex-x-center': string;
-        'flex-y-center': string;
-        'inline-flex-x-center': string;
-        'inline-flex-y-center': string;
-    }[];
-};
-
-interface RuleContext {
-    rawSelector: string;
-}
-/**
- * UnoCSS 猫头鹰选择器预设，提供基于相邻兄弟选择器的间距和分隔符工具类
- *
- * @category Framework
- * @returns UnoCSS预设配置对象
- * @example
- * ```ts
- * // 在unocss.config.ts中使用
- * import { presetOwl } from '@movk/core'
- *
- * export default defineConfig({
- *   presets: [
- *     presetOwl(),
- *     // 其他预设...
- *   ]
- * })
- *
- * // 在HTML中使用生成的类名
- * <div class="owl-y-4">
- *   <div>项目1</div>
- *   <div>项目2</div>  <!-- 上边距 1rem -->
- *   <div>项目3</div>  <!-- 上边距 1rem -->
- * </div>
- *
- * <div class="owl-x-2">
- *   <span>按钮1</span>
- *   <span>按钮2</span>  <!-- 左边距 0.5rem -->
- *   <span>按钮3</span>  <!-- 左边距 0.5rem -->
- * </div>
- *
- * <div class="owl-divide-gray-200">
- *   <div>列表项1</div>
- *   <div>列表项2</div>  <!-- 上边框分隔线 -->
- *   <div>列表项3</div>  <!-- 上边框分隔线 -->
- * </div>
- * ```
- */
-declare function presetOwl(): {
-    name: string;
-    rules: (RegExp | (([, value]: string[], { rawSelector }: RuleContext) => string | undefined) | {
-        autocomplete: string;
-    })[][];
-    shortcuts: {
-        'owl-stack': string;
-        'owl-stack-tight': string;
-        'owl-stack-loose': string;
-        'owl-list': string;
-        'owl-list-tight': string;
-        'owl-nav': string;
-        'owl-card-stack': string;
-    }[];
-};
-
 /**
  * 数组去重，返回去除重复元素后的新数组
  *
@@ -1001,5 +1172,5 @@ declare function isFunction(value: any): value is (...args: any[]) => any;
  */
 declare function isEmpty(value: any): boolean;
 
-export { StorageTypeSchema, Tree, TreeConfigSchema, TreeStatsSchema, camelToKebab, capitalize, chunk, convertSvgToPng, convertToKebabCase, createStorageConfigSchema, debounce, deepClone, extractFilename, flatten, formatFileSize, getRandomUUID, isArray, isEmpty, isFunction, isNumber, isObject, isString, kebabToCamel, omit, omitUndefined, pick, presetFlex, presetOwl, replaceCurrentColor, separate, simpleHash, sleep, sleepWithCancel, throttle, triggerDownload, unique, useAppStorage, useCopyCode };
-export type { AnyObject, AppStorageReturn, DeepPartial, FirstParam, FirstParameter, GetObjectField, MutableByKeys, OmitByKey, PartialByKeys, PickByKey, ReadonlyByKeys, RenameKeys, RequiredByKeys, StorageConfig, StorageConfigInput, StorageType, StringOrVNode, TreeConfig, TreeConfigInput, TreeNode, TreeNodeBase, TreeNodeResult, TreePredicate, TreeStats, TreeTransformer, TreeVisitor, UnionToIntersection };
+export { StorageTypeSchema, Tree, camelToKebab, capitalize, chunk, convertSvgToPng, convertToKebabCase, createStorageConfigSchema, debounce, deepClone, extractFilename, flatten, formatFileSize, getRandomUUID, isArray, isEmpty, isFunction, isNumber, isObject, isString, kebabToCamel, omit, omitUndefined, pick, replaceCurrentColor, separate, simpleHash, sleep, sleepWithCancel, throttle, triggerDownload, unique, useAppStorage, useCopyCode };
+export type { AnyObject, AppStorageReturn, DeepPartial, FirstParam, FirstParameter, GetObjectField, MutableByKeys, OmitByKey, PartialByKeys, PickByKey, ReadonlyByKeys, RenameKeys, RequiredByKeys, StorageConfig, StorageConfigInput, StorageType, StringOrVNode, UnionToIntersection };

package/dist/index.mjs

@@ -1 +1 @@
-import{useStorage as D}from"@vueuse/core";import{z as g}from"zod/v4";const k=g.enum(["localStorage","sessionStorage"]);function j(e){return g.object({key:g.string().min(1,{message:"Key cannot be empty"}),schema:g.custom(t=>t instanceof g.ZodType,{message:"Schema must be a valid Zod schema"}),defaultValue:g.custom(t=>e.safeParse(t).success,{message:"Default value must match the provided schema"}),prefix:g.string().default("movk"),storage:k.default("localStorage")})}g.record(g.string(),g.any());const y=g.object({id:g.string().default("id"),pid:g.string().default("pid"),children:g.string().default("children")}),P=g.object({total:g.number().int().nonnegative(),leaves:g.number().int().nonnegative(),depth:g.number().int().nonnegative(),branches:g.number().int().nonnegative()});function M(e){const t=j(e.schema).parse(e),{key:r,defaultValue:n,schema:o,storage:s,prefix:a}=t,i=`${a}:${r}`,c=(()=>{if(!(typeof window>"u"))return s==="localStorage"?localStorage:sessionStorage})();function l(h){if(h===null)return n;try{const m=JSON.parse(h),b=o.safeParse(m);return b.success?b.data:(console.warn(`[AppStorage] Validation failed for key "${i}". Using default value.`,b.error.issues),n)}catch(m){return console.warn(`[AppStorage] Failed to parse value for key "${i}". Using default value.`,m),n}}const u=D(i,n,c,{mergeDefaults:!0,serializer:{read:l,write:h=>JSON.stringify(h)}});function d(){if(!c)return n;const h=c.getItem(i);return l(h)}function p(h){const m=o.safeParse(h);if(!m.success){console.warn(`[AppStorage] Invalid value for key "${i}". Aborting setItem.`,m.error.issues);return}u.value=m.data}function f(){c&&(u.value=null)}return{state:u,getItem:d,setItem:p,removeItem:f}}async function U(e){if(typeof e!="string")throw new TypeError("Text must be a string");if(typeof window>"u")return console.warn("useCopyCode: Not available in server environment"),!1;if(navigator.clipboard&&window.isSecureContext)try{return await navigator.clipboard.writeText(e),!0}catch(t){console.warn("Clipboard API failed, falling back to legacy method:",t)}try{return L(e)}catch(t){return console.error("Failed to copy text:",t),!1}}function L(e){if(typeof document>"u")return console.warn("copyTextLegacy: Document not available"),!1;const t=document.createElement("textarea"),r=document.activeElement,n=document.getSelection(),o=n&&n.rangeCount>0?n.getRangeAt(0):null;try{return t.value=e,t.setAttribute("readonly",""),t.setAttribute("contenteditable","true"),Object.assign(t.style,{contain:"strict",position:"absolute",left:"-9999px",top:"-9999px",fontSize:"12pt",border:"0",padding:"0",margin:"0",outline:"none",boxShadow:"none",background:"transparent"}),document.body.appendChild(t),t.focus(),t.select(),t.setSelectionRange&&t.setSelectionRange(0,e.length),document.execCommand("copy")}catch(s){return console.error("Legacy copy method failed:",s),!1}finally{t.parentNode&&document.body.removeChild(t),o&&n&&(n.removeAllRanges(),n.addRange(o)),r instanceof HTMLElement&&r.focus()}}class w{static*dfsGenerator(t,r,n=[]){const{children:o}=y.parse(r);let s=0;for(const a of t){const i=[...n,a];yield{node:a,path:i,depth:n.length,index:s++};const c=a[o];c&&c.length>0&&(yield*w.dfsGenerator(c,r,i))}}static*bfsGenerator(t,r){const{children:n}=y.parse(r),o=t.map((a,i)=>({node:a,path:[a],depth:0,index:i}));let s=t.length;for(;o.length>0;){const a=o.shift();yield a;const i=a.node[n];i&&i.length>0&&i.forEach(c=>{const l=[...a.path,c];o.push({node:c,path:l,depth:a.depth+1,index:s++})})}}static selectStrategy(t){switch(t){case"find":case"findAll":case"filter":case"transform":case"forEach":case"stats":case"validate":return"dfs";default:return"dfs"}}static fromList(t,r={}){const n=y.parse(r),{id:o,pid:s,children:a}=n;if(!Array.isArray(t)||t.length===0)return[];const i=new Map,c=[];return t.forEach(l=>{const u={...l,[a]:[]};i.set(l[o],u)}),t.forEach(l=>{const u=i.get(l[o]),d=l[s];d&&i.has(d)?i.get(d)[a].push(u):c.push(u)}),c}static toList(t,r={}){const n=y.parse(r),{children:o}=n,s=[],a=Array.isArray(t)?t:[t],i=c=>{const{[o]:l,...u}=c;s.push(u),l&&l.length>0&&l.forEach(i)};return a.forEach(i),s}static estimateSize(t,r={}){const n=y.parse(r),{children:o}=n,s=Array.isArray(t)?t:[t];let a=0;const i=c=>{a++;const l=c[o];l&&l.length>0&&l.forEach(i)};return s.forEach(i),a}static find(t,r,n={}){const o=Array.isArray(t)?t:[t],s=w.selectStrategy("find")==="dfs"?w.dfsGenerator(o,n):w.bfsGenerator(o,n);for(const a of s)if(r(a.node,a.depth,a.path))return a}static findAll(t,r,n={}){const o=Array.isArray(t)?t:[t],s=w.selectStrategy("findAll"),a=[],i=s==="dfs"?w.dfsGenerator(o,n):w.bfsGenerator(o,n);for(const c of i)r(c.node,c.depth,c.path)&&a.push(c);return a}static findById(t,r,n={}){const o=y.parse(n),{id:s}=o;return this.find(t,a=>a[s]===r,n)}static getStats(t,r={}){const n=y.parse(r),{children:o}=n,s=Array.isArray(t)?t:[t];let a=0,i=0,c=0,l=0;const u=(d,p)=>{a++,c=Math.max(c,p);const f=d[o];f&&f.length>0?(l++,f.forEach(h=>u(h,p+1))):i++};return s.forEach(d=>u(d,1)),{total:a,leaves:i,depth:c,branches:l}}static filter(t,r,n={}){const o=y.parse(n),{children:s}=o,a=Array.isArray(t)?t:[t],i=[],c=(l,u,d)=>{const p=l[s],f=[];if(p&&p.length>0){const h=[...d,l];p.forEach(m=>{const b=c(m,u+1,h);b&&f.push(b)})}return r(l,u,d)||f.length>0?{...l,[s]:f}:null};return a.forEach(l=>{const u=c(l,0,[]);u&&i.push(u)}),i}static transform(t,r,n={}){const o=y.parse(n),{children:s}=o,a=Array.isArray(t)?t:[t],i=[],c=(l,u,d)=>{const p=l[s],f=[];if(p&&p.length>0){const h=[...d,l];p.forEach(m=>{f.push(c(m,u+1,h))})}return{...r(l,u,d),[s]:f}};return a.forEach(l=>{i.push(c(l,0,[]))}),i}static forEach(t,r,n={}){const o=y.parse(n),{children:s}=o,a=Array.isArray(t)?t:[t],i=(c,l,u)=>{if(r(c,l,u)!==!1){const d=c[s];if(d&&d.length>0){const p=[...u,c];d.forEach(f=>{i(f,l+1,p)})}}};a.forEach(c=>i(c,0,[]))}static insertBefore(t,r,n,o={}){const s=y.parse(o),{id:a,children:i}=s,c={...n,[i]:[]},l=(u,d)=>{for(let p=0;p<u.length;p++){const f=u[p];if(f[a]===r)return u.splice(p,0,c),!0;const h=f[i];if(h&&h.length>0){const m=[...d,f];if(l(h,m))return!0}}return!1};return l(t,[])}static insertAfter(t,r,n,o={}){const s=y.parse(o),{id:a,children:i}=s,c={...n,[i]:[]},l=(u,d)=>{for(let p=0;p<u.length;p++){const f=u[p];if(f[a]===r)return u.splice(p+1,0,c),!0;const h=f[i];if(h&&h.length>0){const m=[...d,f];if(l(h,m))return!0}}return!1};return l(t,[])}static remove(t,r,n={}){const o=y.parse(n),{id:s,children:a}=o,i=c=>{for(let l=0;l<c.length;l++){const u=c[l];if(u[s]===r)return c.splice(l,1)[0];const d=u[a];if(d&&d.length>0){const p=i(d);if(p)return p}}};return i(t)}static validate(t,r={}){const n=y.parse(r),{id:o,children:s}=n,a=Array.isArray(t)?t:[t],i=[],c=new Set,l=(u,d,p)=>{const f=u[o];if(!f||typeof f!="string"){i.push(`Node at depth ${d} has invalid or missing ID`);return}if(c.has(f)){i.push(`Duplicate ID found: ${f}`);return}if(c.add(f),p.some(m=>m[o]===f)){i.push(`Circular reference detected for ID: ${f}`);return}const h=u[s];if(h!==void 0&&!Array.isArray(h)){i.push(`Node ${f} has invalid children property (not an array)`);return}if(h&&h.length>0){const m=[...p,u];h.forEach(b=>{l(b,d+1,m)})}};return a.forEach(u=>l(u,0,[])),{isValid:i.length===0,errors:i}}}const S={row:"row",col:"column","row-reverse":"row-reverse","col-reverse":"column-reverse"},$={start:"flex-start",end:"flex-end",center:"center",between:"space-between",around:"space-around",evenly:"space-evenly"},A={start:"flex-start",end:"flex-end",center:"center",stretch:"stretch",baseline:"baseline"},C=Object.keys(S),O=Object.keys($),N=Object.keys(A),R=[new RegExp(`^(?:inline-)?flex-(${C.join("|")})(?:-(${O.join("|")}))?(?:-(${N.join("|")}))?$`),([,e,t,r],{rawSelector:n})=>{const o={display:n.startsWith("inline-")?"inline-flex":"flex"};return e&&S[e]&&(o["flex-direction"]=S[e]),t&&$[t]&&(o["justify-content"]=$[t]),r&&A[r]&&(o["align-items"]=A[r]),o},{autocomplete:`(inline-)?flex-(${C.join("|")})(-(${O.join("|")}))?(-(${N.join("|")}))?`}];function V(){return{name:"@movk/preset-flex",rules:[R,["flex-center",{display:"flex","justify-content":"center","align-items":"center"}],["inline-flex-center",{display:"inline-flex","justify-content":"center","align-items":"center"}]],shortcuts:[{"flex-x-center":"flex justify-center","flex-y-center":"flex items-center","inline-flex-x-center":"inline-flex justify-center","inline-flex-y-center":"inline-flex items-center"}]}}function x(e){return e.replace(/[.:#[\]()]/g,"\\$&")}function z(){return{name:"@movk/preset-owl",rules:[[/^owl-y-(.+)$/,([,e],{rawSelector:t})=>{if(!e)return;const r=v(e);return r?`${x(t)} > * + * { margin-block-start: ${r}; }`:void 0},{autocomplete:"owl-y-<num>"}],[/^owl-x-(.+)$/,([,e],{rawSelector:t})=>{if(!e)return;const r=v(e);return r?`${x(t)} > * + * { margin-inline-start: ${r}; }`:void 0},{autocomplete:"owl-x-<num>"}],[/^owl-block-(.+)$/,([,e],{rawSelector:t})=>{if(!e)return;const r=v(e);return r?`${x(t)} > * + * { margin-block-start: ${r}; }`:void 0},{autocomplete:"owl-block-<num>"}],[/^owl-inline-(.+)$/,([,e],{rawSelector:t})=>{if(!e)return;const r=v(e);return r?`${x(t)} > * + * { margin-inline-start: ${r}; }`:void 0},{autocomplete:"owl-inline-<num>"}],[/^owl-recursive-(.+)$/,([,e],{rawSelector:t})=>{if(!e)return;const r=v(e);return r?`${x(t)} * + * { margin-block-start: ${r}; }`:void 0},{autocomplete:"owl-recursive-<num>"}],[/^owl-divide-(.+)$/,([,e],{rawSelector:t})=>{if(!e)return;const r=B(e)||"#e5e7eb";return`${x(t)} > * + * { border-block-start: 1px solid ${r}; }`},{autocomplete:"owl-divide-<color>"}],[/^owl-divide-style-(.+)$/,([,e],{rawSelector:t})=>!e||!["solid","dashed","dotted","double","none"].includes(e)?void 0:`${x(t)} > * + * { border-block-start-style: ${e}; }`,{autocomplete:"owl-divide-style-<style>"}],[/^owl-divide-width-(.+)$/,([,e],{rawSelector:t})=>{if(!e)return;const r=v(e)||e;return`${x(t)} > * + * { border-block-start-width: ${r}; }`},{autocomplete:"owl-divide-width-<num>"}]],shortcuts:[{"owl-stack":"owl-y-4","owl-stack-tight":"owl-y-2","owl-stack-loose":"owl-y-8","owl-list":"owl-x-4","owl-list-tight":"owl-x-2","owl-nav":"owl-x-6","owl-card-stack":"owl-y-4 owl-divide-gray-200"}]}}function v(e){return/^\d+(?:\.\d+)?$/.test(e)?`${Number.parseFloat(e)*.25}rem`:/^\d+(?:\.\d+)?(?:px|rem|em|%|vh|vw|ch|ex)$/.test(e)?e:{auto:"auto",px:"1px",0:"0",1:"0.25rem",2:"0.5rem",3:"0.75rem",4:"1rem",6:"1.5rem",8:"2rem",12:"3rem",16:"4rem",24:"6rem"}[e]}function B(e){return/^#[0-9a-f]{3,8}$/i.test(e)||/^rgba?(?:\(|$)/.test(e)?e:{transparent:"transparent",current:"currentColor",black:"#000000",white:"#ffffff","gray-200":"#e5e7eb","gray-300":"#d1d5db","gray-500":"#6b7280","gray-700":"#374151","red-500":"#ef4444","blue-500":"#3b82f6","green-500":"#10b981"}[e]}function K(e){return[...new Set(e)]}function Z(e,t){const r=[];for(let n=0;n<e.length;n+=t)r.push(e.slice(n,n+t));return r}function q(e,t=1){return t===1?e.flat():e.flat(t)}function H(e,t){let r;return(...n)=>{clearTimeout(r),r=setTimeout(()=>e(...n),t)}}function J(e){return new Promise(t=>setTimeout(t,e))}function W(e){let t,r;return{promise:new Promise((n,o)=>{r=o,t=setTimeout(n,e)}),cancel:()=>{clearTimeout(t),r(new Error("Sleep was cancelled"))}}}function X(e,t){let r=!1;return function(...n){r||(e.apply(this,n),r=!0,setTimeout(()=>{r=!1},t))}}async function Q(e){if(!e||typeof e!="string")throw new Error("Invalid SVG string provided");if(typeof window>"u"||typeof document>"u")throw new TypeError("convertSvgToPng is only available in browser environment");return new Promise((t,r)=>{const n=new Image,o=document.createElement("canvas"),s=o.getContext("2d");if(!s){r(new Error("Canvas context not available"));return}n.onload=()=>{try{o.width=n.width,o.height=n.height,s.drawImage(n,0,0),o.toBlob(a=>{a?t(a):r(new Error("Failed to convert canvas to Blob"))},"image/png")}catch(a){r(new Error(`Error during canvas conversion: ${a}`))}},n.onerror=()=>{r(new Error("Failed to load SVG image"))};try{n.src=`data:image/svg+xml;base64,${btoa(e)}`}catch(a){r(new Error(`Failed to encode SVG: ${a}`))}})}function Y(e,t="file"){if(!e)return t;const r=e.get("content-disposition");if(r){const n=r.match(/filename\*?=['"]?([^'";]+)['"]?/i);if(n){let o=n[1];if(r.includes("filename*=")){const s=o.split("''");s.length===2&&(o=decodeURIComponent(s[1]))}return o}}return t}function _(e,t){if(typeof window>"u"||typeof document>"u"){console.warn("triggerDownload: Not available in server environment");return}const r=URL.createObjectURL(e),n=document.createElement("a");n.href=r,n.download=t,n.style.display="none",document.body.appendChild(n),n.click(),document.body.removeChild(n),URL.revokeObjectURL(r)}function ee(e){if(!Number.isFinite(e)||e<0||e===0)return"0 Bytes";const t=1024,r=["Bytes","KB","MB","GB","TB","PB"],n=Math.floor(Math.log(e)/Math.log(t));return n>=r.length?`${Number.parseFloat((e/t**(r.length-1)).toFixed(2))} ${r[r.length-1]}`:`${Number.parseFloat((e/t**n).toFixed(2))} ${r[n]}`}async function te(e,t){if(!e||typeof e!="string")throw new Error("Invalid SVG path provided");try{const r=await fetch(e);if(!r.ok)throw new Error(`Failed to fetch SVG file: ${r.status} ${r.statusText}`);const n=await r.text();if(!t)return n;if(typeof window>"u"||typeof DOMParser>"u")return console.warn("replaceCurrentColor: DOM manipulation not available in server environment, returning original SVG"),n;const o=new DOMParser().parseFromString(n,"image/svg+xml");if(o.querySelector("parsererror"))throw new Error("Invalid SVG content");const s=o.querySelector("svg");if(!s)throw new Error("No SVG element found in the document");s.hasAttribute("fill")||s.setAttribute("fill","currentColor");const a=i=>{i.getAttribute("fill")==="currentColor"&&i.setAttribute("fill",t),i.getAttribute("stroke")==="currentColor"&&i.setAttribute("stroke",t),Array.from(i.children).forEach(c=>{a(c)})};return a(s),new XMLSerializer().serializeToString(o)}catch(r){throw r instanceof Error?r:new Error(`Unexpected error occurred: ${r}`)}}function I(e,t=!1){if(!e||typeof e!="object"||Array.isArray(e))return e;const r=o=>o.replace(/([a-z\d])([A-Z])/g,"$1-$2").toLowerCase(),n={};for(const o in e)if(Object.prototype.hasOwnProperty.call(e,o)){const s=r(o),a=e[o];t&&a&&typeof a=="object"&&!Array.isArray(a)?n[s]=I(a,!0):n[s]=a}return n}function E(e){if(e===null||typeof e!="object")return e;if(e instanceof Date)return new Date(e.getTime());if(Array.isArray(e))return e.map(t=>E(t));if(typeof e=="object"){const t={};for(const r in e)t[r]=E(e[r]);return t}return e}function re(e,t){if(!e||typeof e!="object")return{};const r=new Set(t),n={};for(const o in e)Object.prototype.hasOwnProperty.call(e,o)&&!r.has(o)&&(n[o]=e[o]);return n}function ne(e){return!e||typeof e!="object"||Array.isArray(e)?e:Object.fromEntries(Object.entries(e).filter(([,t])=>t!==void 0))}function oe(e,t){if(!e||typeof e!="object")return{};const r={};for(const n of t)Object.prototype.hasOwnProperty.call(e,n)&&(r[n]=e[n]);return r}function ae(e,t){if(!e||typeof e!="object")return{picked:{},omitted:{}};if(t.length===0)return{picked:{},omitted:{...e}};const r=new Set(t),n={},o={};for(const s in e)if(Object.hasOwn(e,s)){const a=s;r.has(a)?n[s]=e[a]:o[s]=e[a]}return{picked:n,omitted:o}}function ie(e){return e.charAt(0).toUpperCase()+e.slice(1)}function se(e){return e.replace(/([a-z])([A-Z])/g,"$1-$2").toLowerCase()}function ce(e){return e.replace(/-([a-z])/g,(t,r)=>r.toUpperCase())}function le(e){let t=0;for(let r=0;r<e.length;r++){const n=e.charCodeAt(r);t=(t<<5)-t+n,t=t&t}return Math.abs(t).toString(36)}function ue(){return"xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx".replace(/[xy]/g,e=>{const t=Math.random()*16|0;return(e==="x"?t:t&3|8).toString(16)})}function T(e){return e!==null&&typeof e=="object"&&!Array.isArray(e)}function F(e){return Array.isArray(e)}function G(e){return typeof e=="string"}function fe(e){return typeof e=="number"&&!Number.isNaN(e)}function de(e){return typeof e=="function"}function pe(e){return e==null?!0:F(e)||G(e)?e.length===0:T(e)?Object.keys(e).length===0:!1}export{k as StorageTypeSchema,w as Tree,y as TreeConfigSchema,P as TreeStatsSchema,se as camelToKebab,ie as capitalize,Z as chunk,Q as convertSvgToPng,I as convertToKebabCase,j as createStorageConfigSchema,H as debounce,E as deepClone,Y as extractFilename,q as flatten,ee as formatFileSize,ue as getRandomUUID,F as isArray,pe as isEmpty,de as isFunction,fe as isNumber,T as isObject,G as isString,ce as kebabToCamel,re as omit,ne as omitUndefined,oe as pick,V as presetFlex,z as presetOwl,te as replaceCurrentColor,ae as separate,le as simpleHash,J as sleep,W as sleepWithCancel,X as throttle,_ as triggerDownload,K as unique,M as useAppStorage,U as useCopyCode};
+import{useStorage as $}from"@vueuse/core";import{z as y}from"zod/v4";const x=y.enum(["localStorage","sessionStorage"]);function A(e){return y.object({key:y.string().min(1,{message:"Key cannot be empty"}),schema:y.custom(t=>t instanceof y.ZodType,{message:"Schema must be a valid Zod schema"}),defaultValue:y.custom(t=>e.safeParse(t).success,{message:"Default value must match the provided schema"}),prefix:y.string().default("movk"),storage:x.default("localStorage")})}function k(e){const t=A(e.schema).parse(e),{key:n,defaultValue:r,schema:o,storage:s,prefix:a}=t,i=`${a}:${n}`,c=(()=>{if(!(typeof window>"u"))return s==="localStorage"?localStorage:sessionStorage})();function l(p){if(p===null)return r;try{const g=JSON.parse(p),w=o.safeParse(g);return w.success?w.data:(console.warn(`[AppStorage] Validation failed for key "${i}". Using default value.`,w.error.issues),r)}catch(g){return console.warn(`[AppStorage] Failed to parse value for key "${i}". Using default value.`,g),r}}const u=$(i,r,c,{mergeDefaults:!0,serializer:{read:l,write:p=>JSON.stringify(p)}});function d(){if(!c)return r;const p=c.getItem(i);return l(p)}function h(p){const g=o.safeParse(p);if(!g.success){console.warn(`[AppStorage] Invalid value for key "${i}". Aborting setItem.`,g.error.issues);return}u.value=g.data}function f(){c&&(u.value=null)}return{state:u,getItem:d,setItem:h,removeItem:f}}async function O(e){if(typeof e!="string")throw new TypeError("Text must be a string");if(typeof window>"u")return console.warn("useCopyCode: Not available in server environment"),!1;if(navigator.clipboard&&window.isSecureContext)try{return await navigator.clipboard.writeText(e),!0}catch(t){console.warn("Clipboard API failed, falling back to legacy method:",t)}try{return I(e)}catch(t){return console.error("Failed to copy text:",t),!1}}function I(e){if(typeof document>"u")return console.warn("copyTextLegacy: Document not available"),!1;const t=document.createElement("textarea"),n=document.activeElement,r=document.getSelection(),o=r&&r.rangeCount>0?r.getRangeAt(0):null;try{return t.value=e,t.setAttribute("readonly",""),t.setAttribute("contenteditable","true"),Object.assign(t.style,{contain:"strict",position:"absolute",left:"-9999px",top:"-9999px",fontSize:"12pt",border:"0",padding:"0",margin:"0",outline:"none",boxShadow:"none",background:"transparent"}),document.body.appendChild(t),t.focus(),t.select(),t.setSelectionRange&&t.setSelectionRange(0,e.length),document.execCommand("copy")}catch(s){return console.error("Legacy copy method failed:",s),!1}finally{t.parentNode&&document.body.removeChild(t),o&&r&&(r.removeAllRanges(),r.addRange(o)),n instanceof HTMLElement&&n.focus()}}const m=y.object({id:y.string().default("id"),pid:y.string().default("pid"),children:y.string().default("children")});y.object({total:y.number().int().nonnegative(),leaves:y.number().int().nonnegative(),depth:y.number().int().nonnegative(),branches:y.number().int().nonnegative()});class b{static*dfsGenerator(t,n={},r=[]){const{children:o}=m.parse(n);let s=0;for(const a of t){const i=[...r,a];yield{node:a,path:i,depth:r.length,index:s++};const c=a[o];c&&c.length>0&&(yield*b.dfsGenerator(c,n,i))}}static*bfsGenerator(t,n={}){const{children:r}=m.parse(n),o=t.map((a,i)=>({node:a,path:[a],depth:0,index:i}));let s=t.length;for(;o.length>0;){const a=o.shift();yield a;const i=a.node[r];i&&i.length>0&&i.forEach(c=>{const l=[...a.path,c];o.push({node:c,path:l,depth:a.depth+1,index:s++})})}}static selectStrategy(t){switch(t){case"find":case"findAll":case"filter":case"transform":case"forEach":case"stats":case"validate":return"dfs";default:return"dfs"}}static fromList(t,n={}){const r=m.parse(n),{id:o,pid:s,children:a}=r;if(!Array.isArray(t)||t.length===0)return[];const i=new Map,c=[];return t.forEach(l=>{const u={...l,[a]:[]};i.set(l[o],u)}),t.forEach(l=>{const u=i.get(l[o]),d=l[s];d&&i.has(d)?i.get(d)[a].push(u):c.push(u)}),c}static toList(t,n={}){const r=m.parse(n),{children:o}=r,s=[],a=Array.isArray(t)?t:[t],i=c=>{const{[o]:l,...u}=c;s.push(u),l&&l.length>0&&l.forEach(i)};return a.forEach(i),s}static estimateSize(t,n={}){const r=m.parse(n),{children:o}=r,s=Array.isArray(t)?t:[t];let a=0;const i=c=>{a++;const l=c[o];l&&l.length>0&&l.forEach(i)};return s.forEach(i),a}static find(t,n,r={}){const o=Array.isArray(t)?t:[t],s=b.selectStrategy("find")==="dfs"?b.dfsGenerator(o,r):b.bfsGenerator(o,r);for(const a of s)if(n(a.node,a.depth,a.path))return a}static findAll(t,n,r={}){const o=Array.isArray(t)?t:[t],s=b.selectStrategy("findAll"),a=[],i=s==="dfs"?b.dfsGenerator(o,r):b.bfsGenerator(o,r);for(const c of i)n(c.node,c.depth,c.path)&&a.push(c);return a}static findById(t,n,r={}){const o=m.parse(r),{id:s}=o;return this.find(t,a=>a[s]===n,r)}static getStats(t,n={}){const r=m.parse(n),{children:o}=r,s=Array.isArray(t)?t:[t];let a=0,i=0,c=0,l=0;const u=(d,h)=>{a++,c=Math.max(c,h);const f=d[o];f&&f.length>0?(l++,f.forEach(p=>u(p,h+1))):i++};return s.forEach(d=>u(d,1)),{total:a,leaves:i,depth:c,branches:l}}static filter(t,n,r={}){const o=m.parse(r),{children:s}=o,a=Array.isArray(t)?t:[t],i=[],c=(l,u,d)=>{const h=l[s],f=[];if(h&&h.length>0){const p=[...d,l];h.forEach(g=>{const w=c(g,u+1,p);w&&f.push(w)})}return n(l,u,d)||f.length>0?{...l,[s]:f}:null};return a.forEach(l=>{const u=c(l,0,[]);u&&i.push(u)}),i}static transform(t,n,r={}){const o=m.parse(r),{children:s}=o,a=Array.isArray(t)?t:[t],i=[],c=(l,u,d)=>{const h=l[s],f=[];if(h&&h.length>0){const p=[...d,l];h.forEach(g=>{f.push(c(g,u+1,p))})}return{...n(l,u,d),[s]:f}};return a.forEach(l=>{i.push(c(l,0,[]))}),i}static forEach(t,n,r={}){const o=m.parse(r),{children:s}=o,a=Array.isArray(t)?t:[t],i=(c,l,u)=>{if(n(c,l,u)!==!1){const d=c[s];if(d&&d.length>0){const h=[...u,c];d.forEach(f=>{i(f,l+1,h)})}}};a.forEach(c=>i(c,0,[]))}static insertBefore(t,n,r,o={}){const s=m.parse(o),{id:a,children:i}=s,c={...r,[i]:[]},l=(u,d)=>{for(let h=0;h<u.length;h++){const f=u[h];if(f[a]===n)return u.splice(h,0,c),!0;const p=f[i];if(p&&p.length>0){const g=[...d,f];if(l(p,g))return!0}}return!1};return l(t,[])}static insertAfter(t,n,r,o={}){const s=m.parse(o),{id:a,children:i}=s,c={...r,[i]:[]},l=(u,d)=>{for(let h=0;h<u.length;h++){const f=u[h];if(f[a]===n)return u.splice(h+1,0,c),!0;const p=f[i];if(p&&p.length>0){const g=[...d,f];if(l(p,g))return!0}}return!1};return l(t,[])}static remove(t,n,r={}){const o=m.parse(r),{id:s,children:a}=o,i=c=>{for(let l=0;l<c.length;l++){const u=c[l];if(u[s]===n)return c.splice(l,1)[0];const d=u[a];if(d&&d.length>0){const h=i(d);if(h)return h}}};return i(t)}static validate(t,n={}){const r=m.parse(n),{id:o,children:s}=r,a=Array.isArray(t)?t:[t],i=[],c=new Set,l=(u,d,h)=>{const f=u[o];if(!f||typeof f!="string"){i.push(`Node at depth ${d} has invalid or missing ID`);return}if(c.has(f)){i.push(`Duplicate ID found: ${f}`);return}if(c.add(f),h.some(g=>g[o]===f)){i.push(`Circular reference detected for ID: ${f}`);return}const p=u[s];if(p!==void 0&&!Array.isArray(p)){i.push(`Node ${f} has invalid children property (not an array)`);return}if(p&&p.length>0){const g=[...h,u];p.forEach(w=>{l(w,d+1,g)})}};return a.forEach(u=>l(u,0,[])),{isValid:i.length===0,errors:i}}}function G(e){return[...new Set(e)]}function N(e,t){const n=[];for(let r=0;r<e.length;r+=t)n.push(e.slice(r,r+t));return n}function T(e,t=1){return t===1?e.flat():e.flat(t)}function D(e,t){let n;return(...r)=>{clearTimeout(n),n=setTimeout(()=>e(...r),t)}}function F(e){return new Promise(t=>setTimeout(t,e))}function P(e){let t,n;return{promise:new Promise((r,o)=>{n=o,t=setTimeout(r,e)}),cancel:()=>{clearTimeout(t),n(new Error("Sleep was cancelled"))}}}function M(e,t){let n=!1;return function(...r){n||(e.apply(this,r),n=!0,setTimeout(()=>{n=!1},t))}}async function U(e){if(!e||typeof e!="string")throw new Error("Invalid SVG string provided");if(typeof window>"u"||typeof document>"u")throw new TypeError("convertSvgToPng is only available in browser environment");return new Promise((t,n)=>{const r=new Image,o=document.createElement("canvas"),s=o.getContext("2d");if(!s){n(new Error("Canvas context not available"));return}r.onload=()=>{try{o.width=r.width,o.height=r.height,s.drawImage(r,0,0),o.toBlob(a=>{a?t(a):n(new Error("Failed to convert canvas to Blob"))},"image/png")}catch(a){n(new Error(`Error during canvas conversion: ${a}`))}},r.onerror=()=>{n(new Error("Failed to load SVG image"))};try{r.src=`data:image/svg+xml;base64,${btoa(e)}`}catch(a){n(new Error(`Failed to encode SVG: ${a}`))}})}function L(e,t="file"){if(!e)return t;const n=e.get("content-disposition");if(n){const r=n.match(/filename\*?=['"]?([^'";]+)['"]?/i);if(r){let o=r[1];if(n.includes("filename*=")){const s=o.split("''");s.length===2&&(o=decodeURIComponent(s[1]))}return o}}return t}function V(e,t){if(typeof window>"u"||typeof document>"u"){console.warn("triggerDownload: Not available in server environment");return}const n=URL.createObjectURL(e),r=document.createElement("a");r.href=n,r.download=t,r.style.display="none",document.body.appendChild(r),r.click(),document.body.removeChild(r),URL.revokeObjectURL(n)}function z(e){if(!Number.isFinite(e)||e<0||e===0)return"0 Bytes";const t=1024,n=["Bytes","KB","MB","GB","TB","PB"],r=Math.floor(Math.log(e)/Math.log(t));return r>=n.length?`${Number.parseFloat((e/t**(n.length-1)).toFixed(2))} ${n[n.length-1]}`:`${Number.parseFloat((e/t**r).toFixed(2))} ${n[r]}`}async function B(e,t){if(!e||typeof e!="string")throw new Error("Invalid SVG path provided");try{const n=await fetch(e);if(!n.ok)throw new Error(`Failed to fetch SVG file: ${n.status} ${n.statusText}`);const r=await n.text();if(!t)return r;if(typeof window>"u"||typeof DOMParser>"u")return console.warn("replaceCurrentColor: DOM manipulation not available in server environment, returning original SVG"),r;const o=new DOMParser().parseFromString(r,"image/svg+xml");if(o.querySelector("parsererror"))throw new Error("Invalid SVG content");const s=o.querySelector("svg");if(!s)throw new Error("No SVG element found in the document");s.hasAttribute("fill")||s.setAttribute("fill","currentColor");const a=i=>{i.getAttribute("fill")==="currentColor"&&i.setAttribute("fill",t),i.getAttribute("stroke")==="currentColor"&&i.setAttribute("stroke",t),Array.from(i.children).forEach(c=>{a(c)})};return a(s),new XMLSerializer().serializeToString(o)}catch(n){throw n instanceof Error?n:new Error(`Unexpected error occurred: ${n}`)}}function S(e,t=!1){if(!e||typeof e!="object"||Array.isArray(e))return e;const n=o=>o.replace(/([a-z\d])([A-Z])/g,"$1-$2").toLowerCase(),r={};for(const o in e)if(Object.prototype.hasOwnProperty.call(e,o)){const s=n(o),a=e[o];t&&a&&typeof a=="object"&&!Array.isArray(a)?r[s]=S(a,!0):r[s]=a}return r}function v(e){if(e===null||typeof e!="object")return e;if(e instanceof Date)return new Date(e.getTime());if(Array.isArray(e))return e.map(t=>v(t));if(typeof e=="object"){const t={};for(const n in e)t[n]=v(e[n]);return t}return e}function R(e,t){if(!e||typeof e!="object")return{};const n=new Set(t),r={};for(const o in e)Object.prototype.hasOwnProperty.call(e,o)&&!n.has(o)&&(r[o]=e[o]);return r}function K(e){return!e||typeof e!="object"||Array.isArray(e)?e:Object.fromEntries(Object.entries(e).filter(([,t])=>t!==void 0))}function Z(e,t){if(!e||typeof e!="object")return{};const n={};for(const r of t)Object.prototype.hasOwnProperty.call(e,r)&&(n[r]=e[r]);return n}function q(e,t){if(!e||typeof e!="object")return{picked:{},omitted:{}};if(t.length===0)return{picked:{},omitted:{...e}};const n=new Set(t),r={},o={};for(const s in e)if(Object.hasOwn(e,s)){const a=s;n.has(a)?r[s]=e[a]:o[s]=e[a]}return{picked:r,omitted:o}}function H(e){return e.charAt(0).toUpperCase()+e.slice(1)}function J(e){return e.replace(/([a-z])([A-Z])/g,"$1-$2").toLowerCase()}function W(e){return e.replace(/-([a-z])/g,(t,n)=>n.toUpperCase())}function X(e){let t=0;for(let n=0;n<e.length;n++){const r=e.charCodeAt(n);t=(t<<5)-t+r,t=t&t}return Math.abs(t).toString(36)}function Q(){return"xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx".replace(/[xy]/g,e=>{const t=Math.random()*16|0;return(e==="x"?t:t&3|8).toString(16)})}function E(e){return e!==null&&typeof e=="object"&&!Array.isArray(e)}function C(e){return Array.isArray(e)}function j(e){return typeof e=="string"}function Y(e){return typeof e=="number"&&!Number.isNaN(e)}function _(e){return typeof e=="function"}function tt(e){return e==null?!0:C(e)||j(e)?e.length===0:E(e)?Object.keys(e).length===0:!1}export{x as StorageTypeSchema,b as Tree,J as camelToKebab,H as capitalize,N as chunk,U as convertSvgToPng,S as convertToKebabCase,A as createStorageConfigSchema,D as debounce,v as deepClone,L as extractFilename,T as flatten,z as formatFileSize,Q as getRandomUUID,C as isArray,tt as isEmpty,_ as isFunction,Y as isNumber,E as isObject,j as isString,W as kebabToCamel,R as omit,K as omitUndefined,Z as pick,B as replaceCurrentColor,q as separate,X as simpleHash,F as sleep,P as sleepWithCancel,M as throttle,V as triggerDownload,G as unique,k as useAppStorage,O as useCopyCode};

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@movk/core",
   "type": "module",
-  "version": "0.0.3",
+  "version": "0.0.4",
   "description": "Modern Vue.js utilities and composables collection with TypeScript support",
   "author": "yixuan",
   "license": "MIT",
@@ -37,39 +37,32 @@
     "dist"
   ],
   "peerDependencies": {
-    "vue": "^3.5.17"
+    "vue": "^3.5.18"
   },
   "dependencies": {
-    "@vueuse/core": "^13.5.0",
-    "zod": "^4.0.5"
+    "@vueuse/core": "^13.6.0",
+    "zod": "^4.0.14"
   },
   "devDependencies": {
-    "@antfu/eslint-config": "^4.17.0",
-    "@antfu/ni": "^25.0.0",
-    "@types/node": "^24.0.14",
-    "bumpp": "^10.2.0",
-    "eslint": "^9.31.0",
-    "lint-staged": "^15.2.10",
-    "simple-git-hooks": "^2.13.0",
+    "@antfu/eslint-config": "^5.0.0",
+    "@release-it/conventional-changelog": "^10.0.1",
+    "@types/node": "^24.1.0",
+    "bumpp": "^10.2.1",
+    "eslint": "^9.32.0",
+    "release-it": "^19.0.4",
     "taze": "^19.1.0",
     "tsx": "^4.20.3",
     "typescript": "^5.8.3",
-    "unbuild": "^3.5.0",
-    "vite": "^7.0.5",
+    "unbuild": "^3.6.0",
+    "vite": "^7.0.6",
     "vitest": "^3.2.4"
   },
-  "simple-git-hooks": {
-    "pre-commit": "pnpm lint-staged"
-  },
-  "lint-staged": {
-    "*": "eslint --fix"
-  },
   "scripts": {
     "build": "unbuild",
     "dev": "unbuild --stub",
     "lint": "eslint .",
-    "lint-fix": "nr lint --fix",
-    "release": "bumpp",
+    "lint:fix": "pnpm run lint --fix",
+    "release": "release-it --verbose",
     "start": "tsx src/index.ts",
     "typecheck": "tsc --noEmit",
     "test": "vitest",