排序优化

src/utils/index.js

@@ -56,6 +56,54 @@ export function deepCopy(obj) {
   return result;
 }
 
+/**
+ * 
+ * @param {Array}     originData  初始数据
+ * @param {Boolean}   isUp        true: 升序  false: 降序
+ * @param {String}    sortField   排序字段，如果没有，则直接排序
+ * @param {Function}  converFun   字段转换函数
+ */
+export function arraySort(originData, isUp = true, sortedField, converFun) {
+  let sortedData = originData.slice(), swap, sourceA, sourceB;
+  for(let i = 0; i < sortedData.length - 1; i ++) {
+    for(let j = 0; j < sortedData.length - i -1; j++) {
+      sourceA = sortedData[j]
+      sourceB = sortedData[j + 1]
+      if(sortedField && !converFun) {
+        sourceA = sourceA[sortedField]
+        sourceB = sourceB[sortedField]
+      } else if(sortedField && converFun && typeof converFun === 'function'){
+        if(!sourceA[sortedField] || !sourceB[sortedField]) {
+          sourceA = 0
+          sourceB = 0
+        } else {
+          sourceA = converFun(sourceA[sortedField])
+          sourceB = converFun(sourceB[sortedField])  
+        }
+      }
+      if(!sourceA || !sourceB) {
+        sourceA = 0
+        sourceB = 0
+      }
+    if(isUp) {
+        if(sourceA - 0 > sourceB - 0) {
+          swap = sortedData[j]
+          sortedData[j] = sortedData[j + 1]
+          sortedData[j + 1] = swap
+        }
+      } else {
+        if(sourceA - 0 < sourceB - 0) {
+          swap = sortedData[j]
+          sortedData[j] = sortedData[j + 1]
+          sortedData[j + 1] = swap
+        }  
+      }
+    }
+  }
+  console.log(sortedData)
+  return sortedData
+}
+
 export function pageJumpUrl(){
   let url = { 
     pageListUrl : 'https://test1-contents.yunqueyi.com/content_list',