widget.qw 1.0.83 → 1.0.85

package/src/util/toast_util.js

@@ -1,25 +1,25 @@
-import { showSuccessToast, showFailToast, showLoadingToast, closeToast,setToastDefaultOptions } from 'vant';
-
-setToastDefaultOptions({ duration: 5000 })
-
-export function warnToast(msg) {
-    showFailToast(msg)
-}
-
-export function successToast(msg) {
-    showSuccessToast(msg)
-}
-
-export function showLoading() {
-    showLoadingToast({
-        message: '加载中...',
-        // 禁止背景点击
-        forbidClick: true,
-        // 一直转圈
-        duration:0
-    })
-}
-
-export function hideLoading(){
-    closeToast()
+import { showSuccessToast, showFailToast, showLoadingToast, closeToast,setToastDefaultOptions } from 'vant';
+
+setToastDefaultOptions({ duration: 5000 })
+
+export function warnToast(msg) {
+    showFailToast(msg)
+}
+
+export function successToast(msg) {
+    showSuccessToast(msg)
+}
+
+export function showLoading() {
+    showLoadingToast({
+        message: '加载中...',
+        // 禁止背景点击
+        forbidClick: true,
+        // 一直转圈
+        duration:0
+    })
+}
+
+export function hideLoading(){
+    closeToast()
 }

package/src/util/tree_util.js

@@ -1,154 +1,154 @@
-// 递归查找叶子节点及父节点
-// 返回存入res数组
-export const findNodes = (id, nodes, res) => {
-    if (!nodes || !id) {
-        return false
-    }
-
-    for (var i = 0; i < nodes.length; i++) {
-        let node = nodes[i]
-        res.push(node)
-
-        if (node.id == id) {
-            return true
-        }
-
-        if (node.children) {
-            let result = findNodes(id, node.children, res)
-            if (result) {
-                return true
-            }
-        }
-
-        res.pop()
-    }
-}
-
-// 查找节点
-export const findNode = (id, nodes) => {
-    if (!nodes || !id) {
-        return null
-    }
-
-
-    let res = []
-    findNodes(id, nodes, res)
-
-    if (res.length < 1) {
-        return null
-    }
-
-    return res[res.length - 1]
-}
-
-// 查找节点路径列表
-// 返回:[父,子，孙]
-export const findPaths =(targetId, nodes, path = [])=> {
-    if (!nodes || nodes.length < 1 || !targetId)
-        return []
-
-    for (const node of nodes) {
-        if (node.id === targetId) {
-            return [...path, node];
-        }
-        if (node.children?.length) {
-            const founds = findPaths(targetId, node.children, [...path, node]);
-            if (founds && founds.length > 0) return founds;
-        }
-    }
-
-    return []
-}
-
-//查找父节点
-export const findParent = (id, nodes) => {
-    if (!nodes || !id) {
-        return null
-    }
-
-    let paths = findPaths(id, nodes)
-
-    if (!paths || paths.length < 2) {
-        return null
-    }
-
-    return paths[paths.length-2]
-}
-
-// id列表转为节点对象列表
-export const ids2nodes=(ids,totalNodes)=>{
-    if(!totalNodes || totalNodes.length<1 || !ids || ids.length<1)
-        return []
-    
-    let res = []
-    for(var i=0;i<ids.length;i++){
-        let node = findNode(ids[i], totalNodes)
-        res.push(node)
-    }
-    return res
-}
-
-// 将找到的父子节点数组拼装为树
-export const concatNodes = (nodes) => {
-    let res = null
-
-    for (var i = 0; i < nodes.length; i++) {
-        let node = nodes[nodes.length - i - 1]
-
-        res = {
-            text: node.text,
-            id: node.id,
-            children: res ? [res] : null
-        }
-    }
-
-    return res
-}
-
-// 递归格式化树结构数据为picker组件数据
-export const data2columns = (nodes) => {
-    if (!nodes) {
-        return []
-    }
-
-    return nodes.map(e => {
-        return {
-            text: e.text,
-            id: e.id,
-            children: e.children ? data2columns(e.children) : null
-        }
-    })
-}
-
-// 树中是否存在值
-export const isFindNode = (id, nodes)=>{
-    let res = []
-    findNodes(id, nodes, res)
-    return res.length > 0
-}
-
-// 判断child_id是否等于或属于parent_id
-// nodes:树数据
-export const isChildNode = (child_id, parent_id, nodes)=>{
-    if(child_id == parent_id){
-        return true
-    }
-
-    let ns = []
-    findNodes(child_id, nodes, ns)
-
-    let one = ns.filter(e=>{
-        return e.id == parent_id
-    })
-    return one.length > 0
-}
-
-// 判断child_ids是否属于parent_ids中的任意一个
-// nodes:树数据
-export const isExistChildNode = (child_id, parent_ids, nodes)=>{
-    let list = parent_ids.filter(e=>{
-        return isChildNode(child_id, e, nodes)
-    })
-
-    return list.length > 0
+// 递归查找叶子节点及父节点
+// 返回存入res数组
+export const findNodes = (id, nodes, res) => {
+    if (!nodes || !id) {
+        return false
+    }
+
+    for (var i = 0; i < nodes.length; i++) {
+        let node = nodes[i]
+        res.push(node)
+
+        if (node.id == id) {
+            return true
+        }
+
+        if (node.children) {
+            let result = findNodes(id, node.children, res)
+            if (result) {
+                return true
+            }
+        }
+
+        res.pop()
+    }
+}
+
+// 查找节点
+export const findNode = (id, nodes) => {
+    if (!nodes || !id) {
+        return null
+    }
+
+
+    let res = []
+    findNodes(id, nodes, res)
+
+    if (res.length < 1) {
+        return null
+    }
+
+    return res[res.length - 1]
+}
+
+// 查找节点路径列表
+// 返回:[父,子，孙]
+export const findPaths =(targetId, nodes, path = [])=> {
+    if (!nodes || nodes.length < 1 || !targetId)
+        return []
+
+    for (const node of nodes) {
+        if (node.id === targetId) {
+            return [...path, node];
+        }
+        if (node.children?.length) {
+            const founds = findPaths(targetId, node.children, [...path, node]);
+            if (founds && founds.length > 0) return founds;
+        }
+    }
+
+    return []
+}
+
+//查找父节点
+export const findParent = (id, nodes) => {
+    if (!nodes || !id) {
+        return null
+    }
+
+    let paths = findPaths(id, nodes)
+
+    if (!paths || paths.length < 2) {
+        return null
+    }
+
+    return paths[paths.length-2]
+}
+
+// id列表转为节点对象列表
+export const ids2nodes=(ids,totalNodes)=>{
+    if(!totalNodes || totalNodes.length<1 || !ids || ids.length<1)
+        return []
+    
+    let res = []
+    for(var i=0;i<ids.length;i++){
+        let node = findNode(ids[i], totalNodes)
+        res.push(node)
+    }
+    return res
+}
+
+// 将找到的父子节点数组拼装为树
+export const concatNodes = (nodes) => {
+    let res = null
+
+    for (var i = 0; i < nodes.length; i++) {
+        let node = nodes[nodes.length - i - 1]
+
+        res = {
+            text: node.text,
+            id: node.id,
+            children: res ? [res] : null
+        }
+    }
+
+    return res
+}
+
+// 递归格式化树结构数据为picker组件数据
+export const data2columns = (nodes) => {
+    if (!nodes) {
+        return []
+    }
+
+    return nodes.map(e => {
+        return {
+            text: e.text,
+            id: e.id,
+            children: e.children ? data2columns(e.children) : null
+        }
+    })
+}
+
+// 树中是否存在值
+export const isFindNode = (id, nodes)=>{
+    let res = []
+    findNodes(id, nodes, res)
+    return res.length > 0
+}
+
+// 判断child_id是否等于或属于parent_id
+// nodes:树数据
+export const isChildNode = (child_id, parent_id, nodes)=>{
+    if(child_id == parent_id){
+        return true
+    }
+
+    let ns = []
+    findNodes(child_id, nodes, ns)
+
+    let one = ns.filter(e=>{
+        return e.id == parent_id
+    })
+    return one.length > 0
+}
+
+// 判断child_ids是否属于parent_ids中的任意一个
+// nodes:树数据
+export const isExistChildNode = (child_id, parent_ids, nodes)=>{
+    let list = parent_ids.filter(e=>{
+        return isChildNode(child_id, e, nodes)
+    })
+
+    return list.length > 0
 }

package/src/util/uuid_util.js

@@ -1,9 +1,9 @@
-export function uuid8() {
-  // 获取当前时间戳的后 8 位十六进制
-  let hex = Date.now().toString(16).slice(-8);
-  // 如果不足 8 位则补全
-  if (hex.length < 8) {
-    hex = '0'.repeat(8 - hex.length) + hex;
-  }
-  return hex;
-}
+export function uuid8() {
+  // 获取当前时间戳的后 8 位十六进制
+  let hex = Date.now().toString(16).slice(-8);
+  // 如果不足 8 位则补全
+  if (hex.length < 8) {
+    hex = '0'.repeat(8 - hex.length) + hex;
+  }
+  return hex;
+}