Initial commit

src/utils/ruoyi.js

@@ -0,0 +1,250 @@
+/**
+ * 通用js方法封装处理
+ *
+ */
+
+const baseURL = process.env.VUE_APP_BASE_API
+
+// 日期格式化
+export function parseTime(time, pattern) {
+  if (arguments.length === 0 || !time) {
+    return null
+  }
+  const format = pattern || '{y}-{m}-{d} {h}:{i}:{s}'
+  let date
+  if (typeof time === 'object') {
+    date = time
+  } else {
+    if ((typeof time === 'string') && (/^[0-9]+$/.test(time))) {
+      time = parseInt(time)
+    } else if (typeof time === 'string') {
+      time = time.replace(new RegExp(/-/gm), '/');
+    }
+    if ((typeof time === 'number') && (time.toString().length === 10)) {
+      time = time * 1000
+    }
+    date = new Date(time)
+  }
+  const formatObj = {
+    y: date.getFullYear(),
+    m: date.getMonth() + 1,
+    d: date.getDate(),
+    h: date.getHours(),
+    i: date.getMinutes(),
+    s: date.getSeconds(),
+    a: date.getDay()
+  }
+  const time_str = format.replace(/{(y|m|d|h|i|s|a)+}/g, (result, key) => {
+    let value = formatObj[key]
+    // Note: getDay() returns 0 on Sunday
+    if (key === 'a') { return ['日', '一', '二', '三', '四', '五', '六'][value] }
+    if (result.length > 0 && value < 10) {
+      value = '0' + value
+    }
+    return value || 0
+  })
+  return time_str
+}
+
+// 表单重置
+export function resetForm(refName) {
+  if (this.$refs[refName]) {
+    this.$refs[refName].resetFields();
+  }
+}
+
+/**
+ * 添加日期范围
+ * @param { beginTime: '', endTime: '', page: 1} params 
+ * @param {*} dateRange 日期范围数组
+ * @param {*} propName C#属性名首字母大写
+ * @returns 
+ */
+// 添加日期范围
+export function addDateRange(params, dateRange, propName) {
+  let search = params;
+  search = typeof (search) === 'object' && search !== null && !Array.isArray(search) ? search : {};
+  dateRange = Array.isArray(dateRange) ? dateRange : [];
+  if (typeof (propName) === 'undefined') {
+    search['beginTime'] = dateRange[0];
+    search['endTime'] = dateRange[1];
+  } else {
+    search['begin' + propName] = dateRange[0];
+    search['end' + propName] = dateRange[1];
+  }
+  return search;
+}
+
+export function addDateRange2(dateRange, index) {
+  var time = undefined;
+  if (null != dateRange && '' != dateRange) {
+    if (dateRange.length <= 2) {
+      time = dateRange[index];
+    }
+  }
+  return time;
+}
+
+// 回显数据字典
+export function selectDictLabel(datas, value) {
+  if (value === undefined) {
+    return "";
+  }
+  var actions = [];
+  Object.keys(datas).some((key) => {
+    if (datas[key].dictValue == ('' + value)) {
+      actions.push(datas[key].dictLabel);
+      return true;
+    }
+  })
+  if (actions.length === 0) {
+    actions.push(value);
+  }
+  return actions.join('');
+}
+
+// 回显数据字典（字符串数组）
+export function selectDictLabels(datas, value, separator) {
+  if (value === undefined) {
+    return "";
+  }
+  var actions = [];
+  var currentSeparator = undefined === separator ? "," : separator;
+  var temp = value.split(currentSeparator);
+  Object.keys(value.split(currentSeparator)).some((val) => {
+    var match = false;
+    Object.keys(datas).some((key) => {
+      if (datas[key].value == ('' + temp[val])) {
+        actions.push(datas[key].label + currentSeparator);
+        match = true;
+      }
+    })
+    if (!match) {
+      actions.push(temp[val] + currentSeparator);
+    }
+  })
+  return actions.join('').substring(0, actions.join('').length - 1);
+}
+
+// table是否显示当前列
+export function showColumn(columns, value) {
+  columns.filter((item, index) => {
+    // console.log(item);
+    return item.key == value;
+  });
+}
+
+// 通用下载方法
+export function download(url, fileName) {
+  // window.location.href = baseURL + "/common/download?fileName=" + encodeURI(fileName) + "&delete=" + true;
+  // window.open(baseURL + "/common/download?fileName=" + encodeURI(fileName) + "&delete=" + true)
+  window.open(baseURL + url)
+}
+
+// 字符串格式化(%s )
+export function sprintf(str) {
+  var args = arguments,
+    flag = true,
+    i = 1;
+  str = str.replace(/%s/g, function () {
+    var arg = args[i++];
+    if (typeof arg === 'undefined') {
+      flag = false;
+      return '';
+    }
+    return arg;
+  });
+  return flag ? str : '';
+}
+
+// 转换字符串，undefined,null等转化为""
+export function praseStrEmpty(str) {
+  if (!str || str == "undefined" || str == "null") {
+    return "";
+  }
+  return str;
+}
+export function praseStrZero(str) {
+  if (!str || str == "undefined" || str == "null") {
+    console.log('zero')
+    return 0;
+  }
+  return str;
+}
+/**
+ * 构造树型结构数据
+ * @param {*} data 数据源
+ * @param {*} id id字段 默认 'id'
+ * @param {*} parentId 父节点字段 默认 'parentId'
+ * @param {*} children 孩子节点字段 默认 'children'
+ * @param {*} rootId 根Id 默认 0
+ */
+export function handleTree(data, id, parentId, children, rootId) {
+  id = id || 'id'
+  parentId = parentId || 'parentId'
+  children = children || 'children'
+  rootId = rootId || Math.min.apply(Math, data.map(item => { return item[parentId] })) || 0
+  //对源数据深度克隆
+  const cloneData = JSON.parse(JSON.stringify(data))
+  //循环所有项
+  const treeData = cloneData.filter(father => {
+    let branchArr = cloneData.filter(child => {
+      //返回每一项的子级数组
+      return father[id] === child[parentId]
+    });
+    branchArr.length > 0 ? father.children = branchArr : '';
+    //返回第一层
+    return father[parentId] === rootId;
+  });
+  return treeData != '' ? treeData : data;
+}
+
+/**
+ * 构造自定义字典数据
+ * @param {*} data 数据源
+ * @param {*} lableId id字段 默认 'lableId'
+ * @param {*} labelName 名称 默认 'labelName'
+ */
+export function handleDict(data, lableId, labelName) {
+  lableId = lableId || 'id'
+  labelName = labelName || 'name'
+  //循环所有项
+  var dictList = [];
+  if (!Array.isArray(data)) {
+    return [];
+  }
+  data.forEach((element) => {
+    dictList.push({
+      dictLabel: element[labelName],
+      dictValue: element[lableId].toString(),
+    });
+  });
+  return dictList;
+}
+
+// 验证是否为blob格式
+export async function blobValidate(data) {
+  try {
+    const text = await data.text();
+    JSON.parse(text);
+    return false;
+  } catch (error) {
+    return true;
+  }
+}
+
+// 数据合并
+export function mergeRecursive(source, target) {
+  for (var p in target) {
+    try {
+      if (target[p].constructor == Object) {
+        source[p] = mergeRecursive(source[p], target[p]);
+      } else {
+        source[p] = target[p];
+      }
+    } catch (e) {
+      source[p] = target[p];
+    }
+  }
+  return source;
+};