dlsjs 0.1.25 → 1.0.3

package/public/vite.svg

@@ -1 +0,0 @@
-<svg xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" aria-hidden="true" role="img" class="iconify iconify--logos" width="31.88" height="32" preserveAspectRatio="xMidYMid meet" viewBox="0 0 256 257"><defs><linearGradient id="IconifyId1813088fe1fbc01fb466" x1="-.828%" x2="57.636%" y1="7.652%" y2="78.411%"><stop offset="0%" stop-color="#41D1FF"></stop><stop offset="100%" stop-color="#BD34FE"></stop></linearGradient><linearGradient id="IconifyId1813088fe1fbc01fb467" x1="43.376%" x2="50.316%" y1="2.242%" y2="89.03%"><stop offset="0%" stop-color="#FFEA83"></stop><stop offset="8.333%" stop-color="#FFDD35"></stop><stop offset="100%" stop-color="#FFA800"></stop></linearGradient></defs><path fill="url(#IconifyId1813088fe1fbc01fb466)" d="M255.153 37.938L134.897 252.976c-2.483 4.44-8.862 4.466-11.382.048L.875 37.958c-2.746-4.814 1.371-10.646 6.827-9.67l120.385 21.517a6.537 6.537 0 0 0 2.322-.004l117.867-21.483c5.438-.991 9.574 4.796 6.877 9.62Z"></path><path fill="url(#IconifyId1813088fe1fbc01fb467)" d="M185.432.063L96.44 17.501a3.268 3.268 0 0 0-2.634 3.014l-5.474 92.456a3.268 3.268 0 0 0 3.997 3.378l24.777-5.718c2.318-.535 4.413 1.507 3.936 3.838l-7.361 36.047c-.495 2.426 1.782 4.5 4.151 3.78l15.304-4.649c2.372-.72 4.652 1.36 4.15 3.788l-11.698 56.621c-.732 3.542 3.979 5.473 5.943 2.437l1.313-2.028l72.516-144.72c1.215-2.423-.88-5.186-3.54-4.672l-25.505 4.922c-2.396.462-4.435-1.77-3.759-4.114l16.646-57.705c.677-2.35-1.37-4.583-3.769-4.113Z"></path></svg>

package/src/core/Browser/Nav.js

@@ -1,33 +0,0 @@
-/**
- * 是否在移动端
- */
-export function isMobileDevice() {
-    // 常见的移动端User-Agent正则表达式
-    const mobileUserAgent = /Mobile|Android|iPhone|iPad|iPod|BlackBerry|IEMobile|Opera Mini/i;
-
-    return mobileUserAgent.test(navigator.userAgent);
-}
-
-/**
- * 复制文本到剪贴板
- * 当处于安全模式下（localhost或https下）使用navigator.clipboard.writeText()添加
- * 否则使用更高兼容模式document.execCommand('Copy')，模拟选中复制，但有几率受到dom聚焦情况影响
- * @param value
- * @param text
- * @return Promise<>
- */
-export function copyText(value) {
-    if(navigator.clipboard) {
-        return navigator.clipboard.writeText(value)
-    }else {
-        const tempInput = document.createElement('input')
-        document.body.appendChild(tempInput)
-        tempInput.value = value
-        tempInput.select()
-        document.execCommand('Copy')
-        document.body.removeChild(tempInput)
-        return Promise.resolve()
-    }
-}
-
-export default {isMobileDevice, copyText}

package/src/core/Browser/Screen.js

@@ -1,29 +0,0 @@
-// 此处代码来自文心一言的回答
-export function toggleFullscreen() {
-    const elem = document.documentElement; // 你可以选择任何HTML元素使其全屏
-    if (isFullscreenActive()) {
-        exitFullscreen();
-    } else {
-        requestFullscreen(elem);
-    }
-}
-
-export function requestFullscreen(element) {
-    if (element.requestFullscreen) {
-        element.requestFullscreen();
-    }
-}
-
-export function exitFullscreen() {
-    if (document.exitFullscreen) {
-        document.exitFullscreen();
-    }
-}
-
-export function isFullscreenActive() {
-    return !!document.fullscreenElement
-}
-
-export default {
-    toggleFullscreen, requestFullscreen, exitFullscreen, isFullscreenActive
-}

package/src/core/ES/Tree.js

@@ -1,339 +0,0 @@
-/**
- * 平铺结构转树形结构
- * @param list
- * @param extendProps
- */
-import {isType} from "./Judgment";
-import {clone, uniqBy} from "ramda";
-
-/**
- * 列表转树（高性能版，适配100W+数据）
- * @param {Array} list - 原始列表数据
- * @param {Object} extendProps - 自定义属性映射 {id: 'id', children: 'children', parentId: 'parentId'}
- * @returns {Array} 树形结构数据
- */
-export function list2Tree (list, extendProps = {}) {
-    // 1. 配置默认属性映射，兼容自定义字段
-    const props = {
-        id: 'id',
-        children: 'children',
-        parentId: 'parentId',
-        useConcat: false, // 保留原有配置，实际优化后无需concat
-        ...extendProps
-    };
-
-    // 校验数据结构
-    if(list[0] && !list[0].hasOwnProperty('id')) {
-        console.warn('数据非标准，未找到唯一标识字段，直接返回')
-        return list
-    }
-
-    const { id: idKey, children: childrenKey, parentId: parentIdKey, useConcat } = props;
-
-    // 2. 构建ID到节点的哈希映射（O(n)），同时初始化children数组
-    const nodeMap = new Map();
-    const rootNodes = []; // 存储根节点（parentId为空/0/不存在的节点）
-
-    // 第一次遍历：初始化映射和children，O(n)
-    for (const node of list) {
-        const nodeId = node[idKey];
-        // 初始化children数组（避免后续判断undefined）
-        if (!node[childrenKey]) {
-            node[childrenKey] = [];
-        }
-        // 将节点存入Map，方便后续快速查找父节点
-        nodeMap.set(nodeId, node);
-    }
-
-    // 第二次遍历：关联父子节点，O(n)
-    for (const node of list) {
-        const parentId = node[parentIdKey];
-        const parentNode = nodeMap.get(parentId);
-
-        if (parentNode) {
-            // 有父节点：添加到父节点的children中
-            if (useConcat && Array.isArray(parentNode[childrenKey])) {
-                parentNode[childrenKey] = parentNode[childrenKey].concat(node);
-            } else {
-                parentNode[childrenKey].push(node);
-            }
-        } else {
-            // 无父节点：归为根节点（parentId为空/0/不存在）
-            rootNodes.push(node);
-        }
-    }
-
-    // 3. 清理空children（可选，保持和原逻辑一致）
-    for (const node of list) {
-        if (Array.isArray(node[childrenKey]) && node[childrenKey].length === 0) {
-            delete node[childrenKey];
-        }
-    }
-
-    return rootNodes;
-}
-
-/**
- * 为list添加_parentIds属性，属性为不含自身的数组，顺序从最外层开始
- * @param list
- */
-export function setParentIds4List(list) {
-    list.forEach(data => {
-        let parentIds = []
-        let nextParentId = data.parentId
-        while (nextParentId) {
-            parentIds.push(nextParentId)
-            let parentNode = list.find(item => item.id === nextParentId)
-            if(parentNode) nextParentId = parentNode.parentId
-            else nextParentId = null
-        }
-        data._parentIds = parentIds.reverse()
-    })
-}
-
-/**
- * 查找树上的点
- */
-export function treeFind(treeLike, func) {
-    let tree = []
-    if(isType('Array', treeLike)) {
-        tree = treeLike
-    }else if(isType('Object', treeLike)) {
-        tree = [treeLike]
-    }
-    for(let item of tree) {
-        if(func(item)) {
-            return item
-        }
-    }
-    for(let item of tree) {
-        if(item?.children) {
-            const nextMatch = treeFind(item.children, func)
-            if(nextMatch) return nextMatch
-        }
-    }
-    return null
-}
-
-/**
- * 查找节点的父级
- * @param tree
- * @param func
- * @param parent
- */
-export function treeFindParent(tree, func, parent) {
-    for(let item of tree) {
-        if(func(item)) {
-            return parent
-        }
-    }
-    for(let item of tree) {
-        if(item.children) {
-            const res = treeFindParent(item.children, func, item)
-            if(res) return res
-        }
-    }
-    return null
-}
-
-/**
- * 修改树上的点
- */
-export function treeMap(treeLike, func) {
-    let tree = []
-    if(isType('Array', treeLike)) {
-        tree = treeLike
-    }else if(isType('Object', treeLike)) {
-        tree = [treeLike]
-    }
-    const newTree = []
-    for(let index in tree) {
-        let item = tree[index]
-        newTree[index] = func(item)
-        if(item.children?.length) {
-            newTree[index].children = treeMap(item.children, func)
-        }
-    }
-    return newTree
-}
-
-/**
- * 遍历树上的点
- */
-export function treeForEach(treeLike, func) {
-    let tree = []
-    if(isType('Array', treeLike)) {
-        tree = treeLike
-    }else if(isType('Object', treeLike)) {
-        tree = [treeLike]
-    }
-    for(let index in tree) {
-        let item = tree[index]
-        func(item)
-        if(item.children?.length) {
-            treeForEach(item.children, func)
-        }
-    }
-}
-
-/**
- * 删除树上的点，首个匹配
- */
-export function treeDel(tree, func) {
-    let parent = treeFindParent(tree, func, {children: tree})
-    let index = parent.children.findIndex(func)
-    return parent.children.splice(Number(index), 1)
-}
-
-/**
- * 寻找叶子对象
- * @param obj
- * @param leafKey
- */
-export function findLeaf(obj, leafKey) {
-    if(obj?.hasOwnProperty && obj.hasOwnProperty(leafKey) || obj[leafKey]) {
-        return findLeaf(obj[leafKey], leafKey)
-    }else {
-        return obj
-    }
-}
-
-export function forkProp(obj, leafKey, propName) {
-    if(obj?.hasOwnProperty && obj.hasOwnProperty(propName)) {
-        return obj[propName]
-    }else if(obj?.hasOwnProperty && obj.hasOwnProperty(leafKey) || obj[leafKey]) {
-        return forkProp(obj[leafKey], leafKey, propName)
-    }else {
-        return null
-    }
-}
-
-/**
- * 维表转树
- * @param dimList 平铺维表
- * @param dimLink 维表关联关系 e.g.['市','区县','乡镇']
- * @param dimMap 维表关联映射字段 e.g.{'市': {propFieldName: 'code1', textFieldName: 'name1'}, '区': {propFieldName: 'code2', textFieldName: 'name2'}, '乡镇': {propFieldName: 'code3', textFieldName: 'name3'}}
- */
-export function dim2Tree(dimList, dimLink, dimMap) {
-    let list = dim2List(dimList, dimLink, dimMap)
-    return list2Tree(list);
-}
-
-export function dim2List(dimList, dimLink, dimMap) {
-    let filedSort = [];
-    if (dimLink.length) {
-        for (let propName of dimLink) {
-            if (!propName) continue;
-            let match = dimMap[propName]
-            filedSort.push(match);
-        }
-    }
-    let dataTreeOrg = [];
-    for (let r of dimList) {
-        for (let linkIndexStr in filedSort) {
-            let linkIndex = Number(linkIndexStr)
-            let node = { id: '', parentId: '', label: '' };
-            for (let i = 0; i <= linkIndex; i++) {
-                node.id += r[filedSort[i].propFieldName];
-                if (linkIndex > 0 && i > 0) node.parentId += r[filedSort[i - 1].propFieldName];
-            }
-            if (linkIndex == 0) node.parentId = '-1';
-            node.label = r[filedSort[linkIndex].textFieldName];
-            node.value = r[filedSort[linkIndex].propFieldName];
-            dataTreeOrg.push(node);
-        }
-    }
-    return uniqBy(item => item.id, dataTreeOrg);
-}
-
-/**
- * 树筛选（包含父节点）
- * @param treeLike
- * @param func
- */
-export function treeFilter(treeLike, func) {
-    const list = tree2List(treeLike)
-    setParentIds4List(list)
-    const res = list.filter(func)
-    const resParentIds = res.map(item => item._parentIds).flat()
-    const resIds = res.map(item => item.id)
-    const res2 = list.filter(item => resParentIds.includes(item.id) || resIds.includes(item.id))
-    return list2Tree(res2)
-}
-
-/**
- * 树转平铺
- * @param treeLike
- * @param list
- */
-export function tree2List(treeLike, list = []) {
-    let tree = []
-    if(isType('Array', treeLike)) {
-        tree = treeLike
-    }else if(isType('Object', treeLike)) {
-        tree = [treeLike]
-    }
-    for(let item of tree) {
-        list.push(item)
-        if(item.children?.length) {
-            tree2List(item.children, list)
-        }
-    }
-    return list
-}
-
-/**
- * 裁剪树形结构到指定层级（高性能版，不裁剪原始树，返回一颗新树）
- * @param {Array} treeLike - 原始树形结构数据
- * @param {number} level - 要保留的层级（从1开始，level=1保留根节点，level=2保留根+一级子节点，以此类推）
- * @returns {Array} 裁剪后的指定层级节点列表
- */
-export function treeCutLevel(treeLike, level) {
-    // 边界值处理：层级≤0 返回空，层级=1 直接返回根节点（浅拷贝避免修改原数据）
-    if (level <= 0) return [];
-    if (level === 1) {
-        // 只保留根节点，浅拷贝根节点（删除children），不影响原数据
-        return treeLike.map(node => {
-            const newNode = { ...node }; // 浅拷贝当前节点
-            delete newNode.children;     // 移除子节点，只保留当前层级
-            return newNode;
-        });
-    }
-
-    // 初始化：当前处理的层级节点列表（初始为根节点）
-    let currentLevelNodes = [...treeLike]; // 浅拷贝当前层级节点，不修改原数组
-    // 存储最终要返回的目标层级节点
-    let targetNodes = [];
-
-    // 遍历到指定层级（从第2层开始，到level层结束）
-    for (let currentLevel = 2; currentLevel <= level; currentLevel++) {
-        // 收集下一层的所有节点
-        const nextLevelNodes = [];
-
-        for (const node of currentLevelNodes) {
-            // 只处理有children的节点
-            if (node.children && node.children.length > 0) {
-                if (currentLevel === level) {
-                    // 到达目标层级：浅拷贝当前子节点，删除其children后加入结果
-                    const cutNodes = node.children.map(child => {
-                        const newChild = { ...child };
-                        delete newChild.children;
-                        return newChild;
-                    });
-                    targetNodes.push(...cutNodes);
-                } else {
-                    // 未到目标层级：收集子节点，继续遍历下一层
-                    nextLevelNodes.push(...node.children);
-                }
-            }
-        }
-
-        // 更新当前层级节点为下一层
-        currentLevelNodes = nextLevelNodes;
-
-        // 提前终止：如果下一层没有节点，无需继续循环
-        if (currentLevelNodes.length === 0) break;
-    }
-
-    return targetNodes;
-}

package/src/javascript.svg

@@ -1 +0,0 @@
-<svg xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" aria-hidden="true" role="img" class="iconify iconify--logos" width="32" height="32" preserveAspectRatio="xMidYMid meet" viewBox="0 0 256 256"><path fill="#F7DF1E" d="M0 0h256v256H0V0Z"></path><path d="m67.312 213.932l19.59-11.856c3.78 6.701 7.218 12.371 15.465 12.371c7.905 0 12.89-3.092 12.89-15.12v-81.798h24.057v82.138c0 24.917-14.606 36.259-35.916 36.259c-19.245 0-30.416-9.967-36.087-21.996m85.07-2.576l19.588-11.341c5.157 8.421 11.859 14.607 23.715 14.607c9.969 0 16.325-4.984 16.325-11.858c0-8.248-6.53-11.17-17.528-15.98l-6.013-2.58c-17.357-7.387-28.87-16.667-28.87-36.257c0-18.044 13.747-31.792 35.228-31.792c15.294 0 26.292 5.328 34.196 19.247l-18.732 12.03c-4.125-7.389-8.591-10.31-15.465-10.31c-7.046 0-11.514 4.468-11.514 10.31c0 7.217 4.468 10.14 14.778 14.608l6.014 2.577c20.45 8.765 31.963 17.7 31.963 37.804c0 21.654-17.012 33.51-39.867 33.51c-22.339 0-36.774-10.654-43.819-24.574"></path></svg>

package/vite.config.js

@@ -1,106 +0,0 @@
-// vite.config.js
-import { defineConfig } from 'vite';
-import { resolve } from 'path';
-import { readdirSync, statSync } from 'fs';
-
-// 自动获取所有源文件，用于生成对应的类型声明映射
-function getSourceFiles(dir, base = '') {
-    const results = [];
-    const items = readdirSync(dir);
-
-    for (const item of items) {
-        const fullPath = resolve(dir, item);
-        const relativePath = base ? `${base}/${item}` : item;
-
-        if (statSync(fullPath).isDirectory()) {
-            results.push(...getSourceFiles(fullPath, relativePath));
-        } else if (item.endsWith('.js')) {
-            results.push(relativePath.replace(/\\/g, '/'));
-        }
-    }
-
-    return results;
-}
-
-export default defineConfig({
-    build: {
-        lib: {
-            // 入口文件
-            entry: resolve(__dirname, 'src/core/index.js'),
-            // UMD格式的全局变量名
-            name: 'dlsjs',
-            // 输出文件名格式
-            fileName: (format) => {
-                if (format === 'es') return 'dlsjs.esm.js';
-                if (format === 'umd') return 'dlsjs.umd.js';
-                if (format === 'iife') return 'dlsjs.iife.js';
-                return `dlsjs.${format}.js`;
-            },
-            // 输出格式
-            formats: ['es', 'umd', 'cjs']
-        },
-        // 核心配置：将目标设置为 ES5
-        target: 'es2015', // 或更保守的 'es5'、'es2020'
-        // 生成sourcemap便于调试
-        sourcemap: true,
-        // 清空输出目录
-        emptyOutDir: true,
-        rollupOptions: {
-            // 外部化依赖，不打包进库
-            external: [],
-            output: {
-                // 为UMD格式提供全局变量名
-                globals: {},
-                // 保留导出结构
-                preserveModules: false,
-                // 生成导出的ES模块
-                exports: 'named'
-            }
-        }
-    },
-    // 开发服务器配置
-    server: {
-        port: 3000,
-        open: true
-    },
-    // 插件配置
-    plugins: [
-        // 自定义插件：构建完成后处理类型声明文件
-        {
-            name: 'copy-types',
-            closeBundle() {
-                const fs = require('fs');
-                const path = require('path');
-
-                // 复制types目录到dist目录
-                const typesDir = path.resolve(__dirname, 'types');
-                const distTypesDir = path.resolve(__dirname, 'dist/types');
-
-                function copyDir(src, dest) {
-                    if (!fs.existsSync(dest)) {
-                        fs.mkdirSync(dest, { recursive: true });
-                    }
-
-                    const items = fs.readdirSync(src);
-
-                    for (const item of items) {
-                        const srcPath = path.join(src, item);
-                        const destPath = path.join(dest, item);
-                        const stat = fs.statSync(srcPath);
-
-                        if (stat.isDirectory()) {
-                            copyDir(srcPath, destPath);
-                        } else if (item.endsWith('.d.ts')) {
-                            fs.copyFileSync(srcPath, destPath);
-                        }
-                    }
-                }
-
-                if (fs.existsSync(typesDir)) {
-                    copyDir(typesDir, distTypesDir);
-                    console.log('✓ Type declaration files copied to dist/types/');
-                }
-            }
-        }
-    ]
-});