@zhouyihang/js-kit 1.0.0

package/src/utils/mergeArr.js

@@ -0,0 +1,18 @@
+// 合并两个有序数组
+function mergeArr(arr1, arr2) {
+  let i = 0,
+    j = 0;
+  const result = [];
+  while (i < arr1.length && j < arr2.length) {
+    if (arr1[i] < arr2[j]) {
+      result.push(arr1[i++]);
+    } else {
+      result.push(arr2[j++]);
+    }
+  }
+  while (i < arr1.length) result.push(arr1[i++]);
+  while (j < arr2.length) result.push(arr2[j++]);
+  return result;
+}
+
+export default mergeArr;

package/src/utils/parseUrl.js

@@ -0,0 +1,13 @@
+function parseUrl(url) {
+  const obj = {};
+  const query = url.split("?")[1];
+  if (!query) return obj;
+
+  query.split("&").forEach((item) => {
+    const [key, value] = item.split("=");
+    obj[key] = decodeURIComponent(value || "");
+  });
+  return obj;
+}
+
+export default parseUrl;

package/src/utils/throttle.js

@@ -0,0 +1,14 @@
+function throttle(func, limit) {
+  let flag = true;
+  return function (...args) {
+    if (flag) {
+      flag = false;
+      func.apply(this, args);
+      setTimeout(() => {
+        flag = true;
+      }, limit);
+    }
+  };
+}
+
+export default throttle;

package/src/utils/toTree.js

@@ -0,0 +1,23 @@
+// 扁平数据结构转树
+function toTree(data) {
+  const result = [];
+  if (!Array.isArray(data)) return result;
+
+  const map = {};
+  data.forEach((item) => {
+    map[item.id] = item;
+  });
+
+  data.forEach((item) => {
+    const parent = map[item.parentId];
+    if (parent) {
+      (parent.children || (parent.children = [])).push(item);
+    } else {
+      result.push(item);
+    }
+  });
+
+  return result;
+}
+
+export default toTree;