ecinc-cloud-wappaio 9.7.16 → 9.7.17

package/lib/ecwappaio.umd.js

@@ -51495,15 +51495,347 @@ module.exports = {
 
 /***/ }),
 
-/***/ 99932:
+/***/ 86322:
 /***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
 
 "use strict";
+// ESM COMPAT FLAG
 __webpack_require__.r(__webpack_exports__);
-/* harmony import */ var qs__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(55373);
-/* harmony import */ var qs__WEBPACK_IMPORTED_MODULE_1___default = /*#__PURE__*/__webpack_require__.n(qs__WEBPACK_IMPORTED_MODULE_1__);
-/* harmony import */ var js_cookie__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(12215);
-/* harmony import */ var js_cookie__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(js_cookie__WEBPACK_IMPORTED_MODULE_0__);
+
+// EXPORTS
+__webpack_require__.d(__webpack_exports__, {
+  "default": function() { return /* binding */ wfengine; }
+});
+
+// EXTERNAL MODULE: ./node_modules/qs/lib/index.js
+var lib = __webpack_require__(55373);
+var lib_default = /*#__PURE__*/__webpack_require__.n(lib);
+// EXTERNAL MODULE: ./node_modules/js-cookie/src/js.cookie.js
+var js_cookie = __webpack_require__(12215);
+var js_cookie_default = /*#__PURE__*/__webpack_require__.n(js_cookie);
+// EXTERNAL MODULE: ./node_modules/spark-md5/spark-md5.js
+var spark_md5 = __webpack_require__(75735);
+var spark_md5_default = /*#__PURE__*/__webpack_require__.n(spark_md5);
+;// CONCATENATED MODULE: ./packages/ecwflow/wfengine/chunkUpload.js
+/**
+ * 分片上传核心模块
+ * 封装大文件分片上传、断点续传全流程逻辑
+ */
+
+
+// ========== 配置 ==========
+var DEFAULT_CHUNK_SIZE = 5; // 默认分片大小（MB）
+var MAX_RETRY = 3; // 单分片最大重试次数
+var RETRY_DELAYS = [1000, 2000, 4000]; // 指数退避延迟（ms）
+var STORAGE_PREFIX = 'chunk_upload_'; // localStorage key 前缀
+
+/**
+ * 获取分片大小（字节）
+ */
+function getChunkSize() {
+  return (window.chunkUploadSize || DEFAULT_CHUNK_SIZE) * 1024 * 1024;
+}
+
+// ========== MD5 计算 ==========
+
+/**
+ * 使用 spark-md5 增量计算文件 MD5（避免大文件一次性读入内存）
+ * @param {File} file 文件对象
+ * @param {number} chunkSize 切片大小（字节）
+ * @returns {Promise<string>} 文件 MD5 值（32位小写）
+ */
+function computeFileMD5(file, chunkSize) {
+  return new Promise(function (resolve, reject) {
+    var blobSlice = File.prototype.slice || File.prototype.mozSlice || File.prototype.webkitSlice;
+    var chunks = Math.ceil(file.size / chunkSize);
+    var currentChunk = 0;
+    var spark = new (spark_md5_default()).ArrayBuffer();
+    var reader = new FileReader();
+    reader.onload = function (e) {
+      spark.append(e.target.result);
+      currentChunk++;
+      if (currentChunk < chunks) {
+        loadNext();
+      } else {
+        resolve(spark.end());
+      }
+    };
+    reader.onerror = function () {
+      reject(new Error('文件读取失败'));
+    };
+    function loadNext() {
+      var start = currentChunk * chunkSize;
+      var end = Math.min(start + chunkSize, file.size);
+      var chunk = blobSlice.call(file, start, end);
+      reader.readAsArrayBuffer(chunk);
+    }
+    loadNext();
+  });
+}
+
+// ========== localStorage 断点进度管理 ==========
+
+/**
+ * 保存上传进度
+ */
+function saveUploadProgress(fileMd5, data) {
+  try {
+    localStorage.setItem(STORAGE_PREFIX + fileMd5, JSON.stringify(data));
+  } catch (e) {
+    // localStorage 满或不可用，静默忽略
+  }
+}
+
+/**
+ * 获取上传进度
+ */
+function getUploadProgress(fileMd5) {
+  try {
+    var raw = localStorage.getItem(STORAGE_PREFIX + fileMd5);
+    return raw ? JSON.parse(raw) : null;
+  } catch (e) {
+    return null;
+  }
+}
+
+/**
+ * 清除上传进度
+ */
+function clearUploadProgress(fileMd5) {
+  try {
+    localStorage.removeItem(STORAGE_PREFIX + fileMd5);
+  } catch (e) {
+    // 静默忽略
+  }
+}
+
+// ========== 后端接口调用 ==========
+
+/**
+ * 检查已上传分片
+ * @param {Vue} $scope Vue 实例
+ * @param {string} baseUrl 基础 URL（如 workflow/wfBusiAttach）
+ * @param {string} fileMd5 文件 MD5
+ * @param {number} totalChunks 总分片数
+ * @returns {Promise<number[]>} 已上传分片索引列表
+ */
+function checkChunkStatus($scope, baseUrl, fileMd5, totalChunks) {
+  var formData = new FormData();
+  formData.append('fileMd5', fileMd5);
+  formData.append('totalChunks', totalChunks);
+  return $scope.$http({
+    url: baseUrl + '/uploadChunkCheck',
+    method: 'post',
+    data: formData
+  }).then(function (res) {
+    if (res.code === 'success' && res.body) {
+      return res.body.uploadedChunks || [];
+    }
+    return [];
+  }).catch(function () {
+    return [];
+  });
+}
+
+/**
+ * 上传单个分片（含重试）
+ * @param {Vue} $scope Vue 实例
+ * @param {string} baseUrl 基础 URL
+ * @param {File} file 完整文件对象
+ * @param {number} chunkIndex 分片索引
+ * @param {string} fileMd5 文件 MD5
+ * @param {number} totalChunks 总分片数
+ * @param {string} fileName 文件名
+ * @param {number} fileSize 文件大小
+ * @returns {Promise}
+ */
+function uploadSingleChunk($scope, baseUrl, file, chunkIndex, fileMd5, totalChunks, fileName, fileSize) {
+  var chunkSize = getChunkSize();
+  var start = chunkIndex * chunkSize;
+  var end = Math.min(start + chunkSize, file.size);
+  var chunk = file.slice(start, end);
+  var formData = new FormData();
+  formData.append('chunkFile', chunk, 'chunk_' + chunkIndex);
+  formData.append('fileMd5', fileMd5);
+  formData.append('chunkIndex', chunkIndex);
+  formData.append('totalChunks', totalChunks);
+  formData.append('fileName', fileName);
+  formData.append('fileSize', fileSize);
+  return doUploadWithRetry($scope, baseUrl + '/uploadChunk', formData, 0, chunkIndex);
+}
+
+/**
+ * 带重试的上传请求
+ */
+function doUploadWithRetry($scope, url, formData, retryCount, chunkIdx) {
+  return $scope.$http({
+    url: url,
+    method: 'post',
+    data: formData
+  }).then(function (res) {
+    if (res.code !== 'success') {
+      console.error('[chunkUpload] chunk_' + chunkIdx + ' failed:', res.message);
+      throw new Error(res.message || 'chunk upload failed');
+    }
+    console.log('[chunkUpload] chunk_' + chunkIdx + ' success');
+    return res;
+  }).catch(function (err) {
+    if (retryCount < MAX_RETRY) {
+      console.warn('[chunkUpload] chunk_' + chunkIdx + ' retry ' + (retryCount + 1) + ':', err.message || err);
+      var delay = RETRY_DELAYS[retryCount] || RETRY_DELAYS[RETRY_DELAYS.length - 1];
+      return new Promise(function (resolve) {
+        setTimeout(resolve, delay);
+      }).then(function () {
+        return doUploadWithRetry($scope, url, formData, retryCount + 1, chunkIdx);
+      });
+    }
+    throw err;
+  });
+}
+
+/**
+ * 合并分片
+ * @param {Vue} $scope Vue 实例
+ * @param {string} baseUrl 基础 URL
+ * @param {string} fileMd5 文件 MD5
+ * @param {string} fileName 文件名
+ * @param {number} fileSize 文件大小
+ * @param {number} totalChunks 总分片数
+ * @param {Object} reqData 业务参数（module, busiDataId 等）
+ * @returns {Promise}
+ */
+function mergeChunks($scope, baseUrl, fileMd5, fileName, fileSize, totalChunks, reqData) {
+  var formData = new FormData();
+  formData.append('fileMd5', fileMd5);
+  formData.append('fileName', fileName);
+  formData.append('fileSize', fileSize);
+  formData.append('totalChunks', totalChunks);
+  if (reqData) {
+    for (var key in reqData) {
+      if (reqData.hasOwnProperty(key) && reqData[key] !== undefined && reqData[key] !== null) {
+        formData.append(key, reqData[key]);
+      }
+    }
+  }
+  return $scope.$http({
+    url: baseUrl + '/uploadChunkMerge',
+    method: 'post',
+    data: formData
+  });
+}
+
+// ========== 主编排函数 ==========
+
+/**
+ * 分片上传主流程
+ * @param {Vue} $scope Vue 实例
+ * @param {string} uploadUrl 上传 URL（如 workflow/wfBusiAttach/upload）
+ * @param {File} file 文件对象
+ * @param {Object} reqData 业务参数
+ * @param {Object} config 配置（含 onUploadProgress 回调）
+ * @returns {Promise} 合并后的响应，与原 upload 接口返回格式一致
+ */
+function chunkedUpload($scope, uploadUrl, file, reqData, config) {
+  var chunkSize = getChunkSize();
+  var totalChunks = Math.ceil(file.size / chunkSize);
+  var fileName = file.name || 'unknown';
+  var fileSize = file.size;
+
+  // 从 uploadUrl 中提取 baseUrl（去掉末尾的 /upload）
+  var baseUrl = uploadUrl.replace(/\/upload\/?$/, '');
+  var onProgress = config && config.onUploadProgress || null;
+  return new Promise(function (resolve, reject) {
+    // Step 1: 计算文件 MD5
+    computeFileMD5(file, chunkSize).then(function (fileMd5) {
+      // Step 2: 检查断点续传进度
+      var savedProgress = getUploadProgress(fileMd5);
+      var uploadedBytes = savedProgress ? savedProgress.uploadedBytes || 0 : 0;
+      return checkChunkStatus($scope, baseUrl, fileMd5, totalChunks).then(function (uploadedChunks) {
+        // Step 3: 逐片上传未完成的分片
+        var completedChunks = uploadedChunks.length;
+        var uploadedBytesFromServer = 0;
+        for (var i = 0; i < uploadedChunks.length; i++) {
+          var idx = uploadedChunks[i];
+          var cStart = idx * chunkSize;
+          var cEnd = Math.min(cStart + chunkSize, fileSize);
+          uploadedBytesFromServer += cEnd - cStart;
+        }
+        uploadedBytes = uploadedBytesFromServer;
+
+        // 模拟初始进度回调
+        if (onProgress) {
+          onProgress({
+            loaded: uploadedBytes,
+            total: fileSize
+          });
+        }
+        return uploadChunksSequentially($scope, baseUrl, file, fileMd5, totalChunks, uploadedChunks, fileName, fileSize, chunkSize, function (chunkBytes) {
+          completedChunks++;
+          uploadedBytes += chunkBytes;
+          if (onProgress) {
+            onProgress({
+              loaded: uploadedBytes,
+              total: fileSize
+            });
+          }
+          // 保存进度到 localStorage
+          saveUploadProgress(fileMd5, {
+            completedChunks: completedChunks,
+            uploadedBytes: uploadedBytes,
+            totalChunks: totalChunks,
+            fileName: fileName,
+            fileSize: fileSize,
+            timestamp: Date.now()
+          });
+        }).then(function () {
+          // Step 4: 合并分片
+          return mergeChunks($scope, baseUrl, fileMd5, fileName, fileSize, totalChunks, reqData);
+        }).then(function (mergeResult) {
+          // Step 5: 合并成功，清除进度记录
+          clearUploadProgress(fileMd5);
+          resolve(mergeResult);
+        });
+      });
+    }).catch(function (err) {
+      reject(err);
+    });
+  });
+}
+
+/**
+ * 逐片串行上传
+ * 使用 Array.reduce 链式调用，reduce 回调参数 cIdx 天然为每次迭代创建独立闭包，
+ * 避免 for + var 共享变量导致所有分片使用同一个 chunkIndex 的问题。
+ */
+function uploadChunksSequentially($scope, baseUrl, file, fileMd5, totalChunks, uploadedChunks, fileName, fileSize, chunkSize, onChunkDone) {
+  var uploadedSet = {};
+  for (var i = 0; i < uploadedChunks.length; i++) {
+    uploadedSet[uploadedChunks[i]] = true;
+  }
+
+  // 构建待上传分片索引数组
+  var chunkIndices = [];
+  for (var chunkIndex = 0; chunkIndex < totalChunks; chunkIndex++) {
+    if (!uploadedSet[chunkIndex]) {
+      chunkIndices.push(chunkIndex);
+    }
+  }
+
+  // reduce 的 cIdx 参数每次迭代都是独立的值，无闭包共享问题
+  return chunkIndices.reduce(function (chain, cIdx) {
+    return chain.then(function () {
+      return uploadSingleChunk($scope, baseUrl, file, cIdx, fileMd5, totalChunks, fileName, fileSize).then(function () {
+        var cStart = cIdx * chunkSize;
+        var cEnd = Math.min(cStart + chunkSize, fileSize);
+        var cBytes = cEnd - cStart;
+        if (onChunkDone) {
+          onChunkDone(cBytes);
+        }
+      });
+    });
+  }, Promise.resolve());
+}
+;// CONCATENATED MODULE: ./packages/ecwflow/wfengine/index.js
 function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
 function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
 function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
@@ -51518,6 +51850,7 @@ function _arrayWithoutHoles(r) { if (Array.isArray(r)) return _arrayLikeToArray(
 function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
 
 
+
 var install = function install(Vue) {
   var WfEngine = new Vue({
     methods: {
@@ -51735,7 +52068,7 @@ var install = function install(Vue) {
                 }
               }
               if ($scope.wfJsonData && $scope.wfJsonData.routes) {
-                var rindex = js_cookie__WEBPACK_IMPORTED_MODULE_0___default().get('route-index-' + $scope.wfInstance.id);
+                var rindex = js_cookie_default().get('route-index-' + $scope.wfInstance.id);
                 if (rindex !== undefined && rindex !== null) {
                   rindex = parseInt(rindex);
                   if ($scope.wfJsonData.routes.length > rindex) $scope.submitHandle.route.index = rindex;
@@ -52183,7 +52516,7 @@ var install = function install(Vue) {
           $scope.$http({
             method: 'POST',
             contentType: 'application/x-www-form-urlencoded',
-            data: qs__WEBPACK_IMPORTED_MODULE_1___default().stringify(saveData),
+            data: lib_default().stringify(saveData),
             params: params,
             url: wfEngineUrl
           }).then(function (res) {
@@ -52229,7 +52562,7 @@ var install = function install(Vue) {
                 });
               }
               if ($scope.wfJsonData && $scope.wfJsonData.routes) {
-                var rindex = js_cookie__WEBPACK_IMPORTED_MODULE_0___default().get('route-index-' + $scope.wfInstance.id);
+                var rindex = js_cookie_default().get('route-index-' + $scope.wfInstance.id);
                 if (rindex !== undefined && rindex !== null) {
                   rindex = parseInt(rindex);
                   if ($scope.wfJsonData.routes.length > rindex) $scope.submitHandle.route.index = rindex;
@@ -52304,7 +52637,7 @@ var install = function install(Vue) {
           }
           var submitHandle = JSON.parse(JSON.stringify($scope.submitHandle));
           if (submitType.indexOf('Save') !== -1) {
-            js_cookie__WEBPACK_IMPORTED_MODULE_0___default().set('route-index-' + $scope.wfInstance.id, submitHandle.route.index);
+            js_cookie_default().set('route-index-' + $scope.wfInstance.id, submitHandle.route.index);
             var route = $scope.wfJsonData == null || $scope.wfJsonData.routes == null || $scope.wfJsonData.routes.length === 0 ? {
               taskNodes: []
             } : $scope.wfJsonData.routes[submitHandle.route.index];
@@ -52315,14 +52648,14 @@ var install = function install(Vue) {
                   if (nextUsers !== '') nextUsers += ';';
                   nextUsers += user.id;
                 });
-                js_cookie__WEBPACK_IMPORTED_MODULE_0___default().set('route-wfuser-' + $scope.curTN.tnID + '-' + wfNode.id, nextUsers);
+                js_cookie_default().set('route-wfuser-' + $scope.curTN.tnID + '-' + wfNode.id, nextUsers);
               }
             });
             delete submitHandle.submitRoute;
             delete submitHandle.nextTNProp;
             delete submitHandle.nextTNUser;
           } else {
-            js_cookie__WEBPACK_IMPORTED_MODULE_0___default().set('route-index-' + $scope.wfInstance.id, '', {
+            js_cookie_default().set('route-index-' + $scope.wfInstance.id, '', {
               expires: 0
             });
             var selRoute = $scope.wfJsonData == null || $scope.wfJsonData.routes == null || $scope.wfJsonData.routes.length === 0 ? {
@@ -52365,7 +52698,7 @@ var install = function install(Vue) {
                 delete wfNode.users;
                 submitHandle.nextTNProp.push(wfNode);
                 submitHandle.nextTNUser.push(nextUsers);
-                js_cookie__WEBPACK_IMPORTED_MODULE_0___default().set('route-wfuser-' + $scope.curTN.tnID + '-' + wfNode.id, '', {
+                js_cookie_default().set('route-wfuser-' + $scope.curTN.tnID + '-' + wfNode.id, '', {
                   expires: 0
                 });
               }
@@ -52398,7 +52731,7 @@ var install = function install(Vue) {
               headers: {
                 'Content-Type': 'application/x-www-form-urlencoded;charset=UTF-8'
               },
-              data: qs__WEBPACK_IMPORTED_MODULE_1___default().stringify(saveData),
+              data: lib_default().stringify(saveData),
               url: (params.wfEngineUrl || $scope.wfEngineUrl || 'workflow/wfInstance') + '/saveWfInstance'
             }).then(function (res) {
               if (res.code === 'success') {
@@ -52671,7 +53004,7 @@ var install = function install(Vue) {
               _this4.$http({
                 method: 'POST',
                 contentType: 'application/x-www-form-urlencoded',
-                data: qs__WEBPACK_IMPORTED_MODULE_1___default().stringify(saveData),
+                data: lib_default().stringify(saveData),
                 params: $scope.$vnode.context.wfParams,
                 url: 'workflow/wfInstance/getUdmNodeUsers'
               }).then(function (res) {
@@ -52721,7 +53054,7 @@ var install = function install(Vue) {
               headers: {
                 'Content-Type': 'application/x-www-form-urlencoded;charset=UTF-8'
               },
-              data: qs__WEBPACK_IMPORTED_MODULE_1___default().stringify({
+              data: lib_default().stringify({
                 wfInstance: JSON.stringify($scope.wfInstance),
                 nextTNUsers: JSON.stringify(nextTNUsers)
               }),
@@ -52879,6 +53212,11 @@ var install = function install(Vue) {
         }
       },
       upload: function upload($scope, uploadUrl, file, params, config) {
+        // 分片上传分流判断：chunkFileSizeThreshold > 0 且文件大小超过阈值
+        var chunkThreshold = window.chunkFileSizeThreshold;
+        if (chunkThreshold > 0 && file && file.size > chunkThreshold * 1024 * 1024) {
+          return chunkedUpload($scope, uploadUrl, file, params, config);
+        }
         var formData = new FormData();
         if (params != null) {
           for (var key in params) {
@@ -52977,7 +53315,7 @@ var install = function install(Vue) {
   });
   Vue.prototype.$wfEngine = WfEngine;
 };
-/* harmony default export */ __webpack_exports__["default"] = (install);
+/* harmony default export */ var wfengine = (install);
 
 /***/ }),
 
@@ -239448,6 +239786,750 @@ Sortable.mount(Remove, Revert);
 
 
 
+/***/ }),
+
+/***/ 75735:
+/***/ (function(module) {
+
+(function (factory) {
+    if (true) {
+        // Node/CommonJS
+        module.exports = factory();
+    } else { var glob; }
+}(function (undefined) {
+
+    'use strict';
+
+    /*
+     * Fastest md5 implementation around (JKM md5).
+     * Credits: Joseph Myers
+     *
+     * @see http://www.myersdaily.org/joseph/javascript/md5-text.html
+     * @see http://jsperf.com/md5-shootout/7
+     */
+
+    /* this function is much faster,
+      so if possible we use it. Some IEs
+      are the only ones I know of that
+      need the idiotic second function,
+      generated by an if clause.  */
+    var add32 = function (a, b) {
+        return (a + b) & 0xFFFFFFFF;
+    },
+        hex_chr = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f'];
+
+
+    function cmn(q, a, b, x, s, t) {
+        a = add32(add32(a, q), add32(x, t));
+        return add32((a << s) | (a >>> (32 - s)), b);
+    }
+
+    function md5cycle(x, k) {
+        var a = x[0],
+            b = x[1],
+            c = x[2],
+            d = x[3];
+
+        a += (b & c | ~b & d) + k[0] - 680876936 | 0;
+        a  = (a << 7 | a >>> 25) + b | 0;
+        d += (a & b | ~a & c) + k[1] - 389564586 | 0;
+        d  = (d << 12 | d >>> 20) + a | 0;
+        c += (d & a | ~d & b) + k[2] + 606105819 | 0;
+        c  = (c << 17 | c >>> 15) + d | 0;
+        b += (c & d | ~c & a) + k[3] - 1044525330 | 0;
+        b  = (b << 22 | b >>> 10) + c | 0;
+        a += (b & c | ~b & d) + k[4] - 176418897 | 0;
+        a  = (a << 7 | a >>> 25) + b | 0;
+        d += (a & b | ~a & c) + k[5] + 1200080426 | 0;
+        d  = (d << 12 | d >>> 20) + a | 0;
+        c += (d & a | ~d & b) + k[6] - 1473231341 | 0;
+        c  = (c << 17 | c >>> 15) + d | 0;
+        b += (c & d | ~c & a) + k[7] - 45705983 | 0;
+        b  = (b << 22 | b >>> 10) + c | 0;
+        a += (b & c | ~b & d) + k[8] + 1770035416 | 0;
+        a  = (a << 7 | a >>> 25) + b | 0;
+        d += (a & b | ~a & c) + k[9] - 1958414417 | 0;
+        d  = (d << 12 | d >>> 20) + a | 0;
+        c += (d & a | ~d & b) + k[10] - 42063 | 0;
+        c  = (c << 17 | c >>> 15) + d | 0;
+        b += (c & d | ~c & a) + k[11] - 1990404162 | 0;
+        b  = (b << 22 | b >>> 10) + c | 0;
+        a += (b & c | ~b & d) + k[12] + 1804603682 | 0;
+        a  = (a << 7 | a >>> 25) + b | 0;
+        d += (a & b | ~a & c) + k[13] - 40341101 | 0;
+        d  = (d << 12 | d >>> 20) + a | 0;
+        c += (d & a | ~d & b) + k[14] - 1502002290 | 0;
+        c  = (c << 17 | c >>> 15) + d | 0;
+        b += (c & d | ~c & a) + k[15] + 1236535329 | 0;
+        b  = (b << 22 | b >>> 10) + c | 0;
+
+        a += (b & d | c & ~d) + k[1] - 165796510 | 0;
+        a  = (a << 5 | a >>> 27) + b | 0;
+        d += (a & c | b & ~c) + k[6] - 1069501632 | 0;
+        d  = (d << 9 | d >>> 23) + a | 0;
+        c += (d & b | a & ~b) + k[11] + 643717713 | 0;
+        c  = (c << 14 | c >>> 18) + d | 0;
+        b += (c & a | d & ~a) + k[0] - 373897302 | 0;
+        b  = (b << 20 | b >>> 12) + c | 0;
+        a += (b & d | c & ~d) + k[5] - 701558691 | 0;
+        a  = (a << 5 | a >>> 27) + b | 0;
+        d += (a & c | b & ~c) + k[10] + 38016083 | 0;
+        d  = (d << 9 | d >>> 23) + a | 0;
+        c += (d & b | a & ~b) + k[15] - 660478335 | 0;
+        c  = (c << 14 | c >>> 18) + d | 0;
+        b += (c & a | d & ~a) + k[4] - 405537848 | 0;
+        b  = (b << 20 | b >>> 12) + c | 0;
+        a += (b & d | c & ~d) + k[9] + 568446438 | 0;
+        a  = (a << 5 | a >>> 27) + b | 0;
+        d += (a & c | b & ~c) + k[14] - 1019803690 | 0;
+        d  = (d << 9 | d >>> 23) + a | 0;
+        c += (d & b | a & ~b) + k[3] - 187363961 | 0;
+        c  = (c << 14 | c >>> 18) + d | 0;
+        b += (c & a | d & ~a) + k[8] + 1163531501 | 0;
+        b  = (b << 20 | b >>> 12) + c | 0;
+        a += (b & d | c & ~d) + k[13] - 1444681467 | 0;
+        a  = (a << 5 | a >>> 27) + b | 0;
+        d += (a & c | b & ~c) + k[2] - 51403784 | 0;
+        d  = (d << 9 | d >>> 23) + a | 0;
+        c += (d & b | a & ~b) + k[7] + 1735328473 | 0;
+        c  = (c << 14 | c >>> 18) + d | 0;
+        b += (c & a | d & ~a) + k[12] - 1926607734 | 0;
+        b  = (b << 20 | b >>> 12) + c | 0;
+
+        a += (b ^ c ^ d) + k[5] - 378558 | 0;
+        a  = (a << 4 | a >>> 28) + b | 0;
+        d += (a ^ b ^ c) + k[8] - 2022574463 | 0;
+        d  = (d << 11 | d >>> 21) + a | 0;
+        c += (d ^ a ^ b) + k[11] + 1839030562 | 0;
+        c  = (c << 16 | c >>> 16) + d | 0;
+        b += (c ^ d ^ a) + k[14] - 35309556 | 0;
+        b  = (b << 23 | b >>> 9) + c | 0;
+        a += (b ^ c ^ d) + k[1] - 1530992060 | 0;
+        a  = (a << 4 | a >>> 28) + b | 0;
+        d += (a ^ b ^ c) + k[4] + 1272893353 | 0;
+        d  = (d << 11 | d >>> 21) + a | 0;
+        c += (d ^ a ^ b) + k[7] - 155497632 | 0;
+        c  = (c << 16 | c >>> 16) + d | 0;
+        b += (c ^ d ^ a) + k[10] - 1094730640 | 0;
+        b  = (b << 23 | b >>> 9) + c | 0;
+        a += (b ^ c ^ d) + k[13] + 681279174 | 0;
+        a  = (a << 4 | a >>> 28) + b | 0;
+        d += (a ^ b ^ c) + k[0] - 358537222 | 0;
+        d  = (d << 11 | d >>> 21) + a | 0;
+        c += (d ^ a ^ b) + k[3] - 722521979 | 0;
+        c  = (c << 16 | c >>> 16) + d | 0;
+        b += (c ^ d ^ a) + k[6] + 76029189 | 0;
+        b  = (b << 23 | b >>> 9) + c | 0;
+        a += (b ^ c ^ d) + k[9] - 640364487 | 0;
+        a  = (a << 4 | a >>> 28) + b | 0;
+        d += (a ^ b ^ c) + k[12] - 421815835 | 0;
+        d  = (d << 11 | d >>> 21) + a | 0;
+        c += (d ^ a ^ b) + k[15] + 530742520 | 0;
+        c  = (c << 16 | c >>> 16) + d | 0;
+        b += (c ^ d ^ a) + k[2] - 995338651 | 0;
+        b  = (b << 23 | b >>> 9) + c | 0;
+
+        a += (c ^ (b | ~d)) + k[0] - 198630844 | 0;
+        a  = (a << 6 | a >>> 26) + b | 0;
+        d += (b ^ (a | ~c)) + k[7] + 1126891415 | 0;
+        d  = (d << 10 | d >>> 22) + a | 0;
+        c += (a ^ (d | ~b)) + k[14] - 1416354905 | 0;
+        c  = (c << 15 | c >>> 17) + d | 0;
+        b += (d ^ (c | ~a)) + k[5] - 57434055 | 0;
+        b  = (b << 21 |b >>> 11) + c | 0;
+        a += (c ^ (b | ~d)) + k[12] + 1700485571 | 0;
+        a  = (a << 6 | a >>> 26) + b | 0;
+        d += (b ^ (a | ~c)) + k[3] - 1894986606 | 0;
+        d  = (d << 10 | d >>> 22) + a | 0;
+        c += (a ^ (d | ~b)) + k[10] - 1051523 | 0;
+        c  = (c << 15 | c >>> 17) + d | 0;
+        b += (d ^ (c | ~a)) + k[1] - 2054922799 | 0;
+        b  = (b << 21 |b >>> 11) + c | 0;
+        a += (c ^ (b | ~d)) + k[8] + 1873313359 | 0;
+        a  = (a << 6 | a >>> 26) + b | 0;
+        d += (b ^ (a | ~c)) + k[15] - 30611744 | 0;
+        d  = (d << 10 | d >>> 22) + a | 0;
+        c += (a ^ (d | ~b)) + k[6] - 1560198380 | 0;
+        c  = (c << 15 | c >>> 17) + d | 0;
+        b += (d ^ (c | ~a)) + k[13] + 1309151649 | 0;
+        b  = (b << 21 |b >>> 11) + c | 0;
+        a += (c ^ (b | ~d)) + k[4] - 145523070 | 0;
+        a  = (a << 6 | a >>> 26) + b | 0;
+        d += (b ^ (a | ~c)) + k[11] - 1120210379 | 0;
+        d  = (d << 10 | d >>> 22) + a | 0;
+        c += (a ^ (d | ~b)) + k[2] + 718787259 | 0;
+        c  = (c << 15 | c >>> 17) + d | 0;
+        b += (d ^ (c | ~a)) + k[9] - 343485551 | 0;
+        b  = (b << 21 | b >>> 11) + c | 0;
+
+        x[0] = a + x[0] | 0;
+        x[1] = b + x[1] | 0;
+        x[2] = c + x[2] | 0;
+        x[3] = d + x[3] | 0;
+    }
+
+    function md5blk(s) {
+        var md5blks = [],
+            i; /* Andy King said do it this way. */
+
+        for (i = 0; i < 64; i += 4) {
+            md5blks[i >> 2] = s.charCodeAt(i) + (s.charCodeAt(i + 1) << 8) + (s.charCodeAt(i + 2) << 16) + (s.charCodeAt(i + 3) << 24);
+        }
+        return md5blks;
+    }
+
+    function md5blk_array(a) {
+        var md5blks = [],
+            i; /* Andy King said do it this way. */
+
+        for (i = 0; i < 64; i += 4) {
+            md5blks[i >> 2] = a[i] + (a[i + 1] << 8) + (a[i + 2] << 16) + (a[i + 3] << 24);
+        }
+        return md5blks;
+    }
+
+    function md51(s) {
+        var n = s.length,
+            state = [1732584193, -271733879, -1732584194, 271733878],
+            i,
+            length,
+            tail,
+            tmp,
+            lo,
+            hi;
+
+        for (i = 64; i <= n; i += 64) {
+            md5cycle(state, md5blk(s.substring(i - 64, i)));
+        }
+        s = s.substring(i - 64);
+        length = s.length;
+        tail = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];
+        for (i = 0; i < length; i += 1) {
+            tail[i >> 2] |= s.charCodeAt(i) << ((i % 4) << 3);
+        }
+        tail[i >> 2] |= 0x80 << ((i % 4) << 3);
+        if (i > 55) {
+            md5cycle(state, tail);
+            for (i = 0; i < 16; i += 1) {
+                tail[i] = 0;
+            }
+        }
+
+        // Beware that the final length might not fit in 32 bits so we take care of that
+        tmp = n * 8;
+        tmp = tmp.toString(16).match(/(.*?)(.{0,8})$/);
+        lo = parseInt(tmp[2], 16);
+        hi = parseInt(tmp[1], 16) || 0;
+
+        tail[14] = lo;
+        tail[15] = hi;
+
+        md5cycle(state, tail);
+        return state;
+    }
+
+    function md51_array(a) {
+        var n = a.length,
+            state = [1732584193, -271733879, -1732584194, 271733878],
+            i,
+            length,
+            tail,
+            tmp,
+            lo,
+            hi;
+
+        for (i = 64; i <= n; i += 64) {
+            md5cycle(state, md5blk_array(a.subarray(i - 64, i)));
+        }
+
+        // Not sure if it is a bug, however IE10 will always produce a sub array of length 1
+        // containing the last element of the parent array if the sub array specified starts
+        // beyond the length of the parent array - weird.
+        // https://connect.microsoft.com/IE/feedback/details/771452/typed-array-subarray-issue
+        a = (i - 64) < n ? a.subarray(i - 64) : new Uint8Array(0);
+
+        length = a.length;
+        tail = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];
+        for (i = 0; i < length; i += 1) {
+            tail[i >> 2] |= a[i] << ((i % 4) << 3);
+        }
+
+        tail[i >> 2] |= 0x80 << ((i % 4) << 3);
+        if (i > 55) {
+            md5cycle(state, tail);
+            for (i = 0; i < 16; i += 1) {
+                tail[i] = 0;
+            }
+        }
+
+        // Beware that the final length might not fit in 32 bits so we take care of that
+        tmp = n * 8;
+        tmp = tmp.toString(16).match(/(.*?)(.{0,8})$/);
+        lo = parseInt(tmp[2], 16);
+        hi = parseInt(tmp[1], 16) || 0;
+
+        tail[14] = lo;
+        tail[15] = hi;
+
+        md5cycle(state, tail);
+
+        return state;
+    }
+
+    function rhex(n) {
+        var s = '',
+            j;
+        for (j = 0; j < 4; j += 1) {
+            s += hex_chr[(n >> (j * 8 + 4)) & 0x0F] + hex_chr[(n >> (j * 8)) & 0x0F];
+        }
+        return s;
+    }
+
+    function hex(x) {
+        var i;
+        for (i = 0; i < x.length; i += 1) {
+            x[i] = rhex(x[i]);
+        }
+        return x.join('');
+    }
+
+    // In some cases the fast add32 function cannot be used..
+    if (hex(md51('hello')) !== '5d41402abc4b2a76b9719d911017c592') {
+        add32 = function (x, y) {
+            var lsw = (x & 0xFFFF) + (y & 0xFFFF),
+                msw = (x >> 16) + (y >> 16) + (lsw >> 16);
+            return (msw << 16) | (lsw & 0xFFFF);
+        };
+    }
+
+    // ---------------------------------------------------
+
+    /**
+     * ArrayBuffer slice polyfill.
+     *
+     * @see https://github.com/ttaubert/node-arraybuffer-slice
+     */
+
+    if (typeof ArrayBuffer !== 'undefined' && !ArrayBuffer.prototype.slice) {
+        (function () {
+            function clamp(val, length) {
+                val = (val | 0) || 0;
+
+                if (val < 0) {
+                    return Math.max(val + length, 0);
+                }
+
+                return Math.min(val, length);
+            }
+
+            ArrayBuffer.prototype.slice = function (from, to) {
+                var length = this.byteLength,
+                    begin = clamp(from, length),
+                    end = length,
+                    num,
+                    target,
+                    targetArray,
+                    sourceArray;
+
+                if (to !== undefined) {
+                    end = clamp(to, length);
+                }
+
+                if (begin > end) {
+                    return new ArrayBuffer(0);
+                }
+
+                num = end - begin;
+                target = new ArrayBuffer(num);
+                targetArray = new Uint8Array(target);
+
+                sourceArray = new Uint8Array(this, begin, num);
+                targetArray.set(sourceArray);
+
+                return target;
+            };
+        })();
+    }
+
+    // ---------------------------------------------------
+
+    /**
+     * Helpers.
+     */
+
+    function toUtf8(str) {
+        if (/[\u0080-\uFFFF]/.test(str)) {
+            str = unescape(encodeURIComponent(str));
+        }
+
+        return str;
+    }
+
+    function utf8Str2ArrayBuffer(str, returnUInt8Array) {
+        var length = str.length,
+           buff = new ArrayBuffer(length),
+           arr = new Uint8Array(buff),
+           i;
+
+        for (i = 0; i < length; i += 1) {
+            arr[i] = str.charCodeAt(i);
+        }
+
+        return returnUInt8Array ? arr : buff;
+    }
+
+    function arrayBuffer2Utf8Str(buff) {
+        return String.fromCharCode.apply(null, new Uint8Array(buff));
+    }
+
+    function concatenateArrayBuffers(first, second, returnUInt8Array) {
+        var result = new Uint8Array(first.byteLength + second.byteLength);
+
+        result.set(new Uint8Array(first));
+        result.set(new Uint8Array(second), first.byteLength);
+
+        return returnUInt8Array ? result : result.buffer;
+    }
+
+    function hexToBinaryString(hex) {
+        var bytes = [],
+            length = hex.length,
+            x;
+
+        for (x = 0; x < length - 1; x += 2) {
+            bytes.push(parseInt(hex.substr(x, 2), 16));
+        }
+
+        return String.fromCharCode.apply(String, bytes);
+    }
+
+    // ---------------------------------------------------
+
+    /**
+     * SparkMD5 OOP implementation.
+     *
+     * Use this class to perform an incremental md5, otherwise use the
+     * static methods instead.
+     */
+
+    function SparkMD5() {
+        // call reset to init the instance
+        this.reset();
+    }
+
+    /**
+     * Appends a string.
+     * A conversion will be applied if an utf8 string is detected.
+     *
+     * @param {String} str The string to be appended
+     *
+     * @return {SparkMD5} The instance itself
+     */
+    SparkMD5.prototype.append = function (str) {
+        // Converts the string to utf8 bytes if necessary
+        // Then append as binary
+        this.appendBinary(toUtf8(str));
+
+        return this;
+    };
+
+    /**
+     * Appends a binary string.
+     *
+     * @param {String} contents The binary string to be appended
+     *
+     * @return {SparkMD5} The instance itself
+     */
+    SparkMD5.prototype.appendBinary = function (contents) {
+        this._buff += contents;
+        this._length += contents.length;
+
+        var length = this._buff.length,
+            i;
+
+        for (i = 64; i <= length; i += 64) {
+            md5cycle(this._hash, md5blk(this._buff.substring(i - 64, i)));
+        }
+
+        this._buff = this._buff.substring(i - 64);
+
+        return this;
+    };
+
+    /**
+     * Finishes the incremental computation, reseting the internal state and
+     * returning the result.
+     *
+     * @param {Boolean} raw True to get the raw string, false to get the hex string
+     *
+     * @return {String} The result
+     */
+    SparkMD5.prototype.end = function (raw) {
+        var buff = this._buff,
+            length = buff.length,
+            i,
+            tail = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
+            ret;
+
+        for (i = 0; i < length; i += 1) {
+            tail[i >> 2] |= buff.charCodeAt(i) << ((i % 4) << 3);
+        }
+
+        this._finish(tail, length);
+        ret = hex(this._hash);
+
+        if (raw) {
+            ret = hexToBinaryString(ret);
+        }
+
+        this.reset();
+
+        return ret;
+    };
+
+    /**
+     * Resets the internal state of the computation.
+     *
+     * @return {SparkMD5} The instance itself
+     */
+    SparkMD5.prototype.reset = function () {
+        this._buff = '';
+        this._length = 0;
+        this._hash = [1732584193, -271733879, -1732584194, 271733878];
+
+        return this;
+    };
+
+    /**
+     * Gets the internal state of the computation.
+     *
+     * @return {Object} The state
+     */
+    SparkMD5.prototype.getState = function () {
+        return {
+            buff: this._buff,
+            length: this._length,
+            hash: this._hash.slice()
+        };
+    };
+
+    /**
+     * Gets the internal state of the computation.
+     *
+     * @param {Object} state The state
+     *
+     * @return {SparkMD5} The instance itself
+     */
+    SparkMD5.prototype.setState = function (state) {
+        this._buff = state.buff;
+        this._length = state.length;
+        this._hash = state.hash;
+
+        return this;
+    };
+
+    /**
+     * Releases memory used by the incremental buffer and other additional
+     * resources. If you plan to use the instance again, use reset instead.
+     */
+    SparkMD5.prototype.destroy = function () {
+        delete this._hash;
+        delete this._buff;
+        delete this._length;
+    };
+
+    /**
+     * Finish the final calculation based on the tail.
+     *
+     * @param {Array}  tail   The tail (will be modified)
+     * @param {Number} length The length of the remaining buffer
+     */
+    SparkMD5.prototype._finish = function (tail, length) {
+        var i = length,
+            tmp,
+            lo,
+            hi;
+
+        tail[i >> 2] |= 0x80 << ((i % 4) << 3);
+        if (i > 55) {
+            md5cycle(this._hash, tail);
+            for (i = 0; i < 16; i += 1) {
+                tail[i] = 0;
+            }
+        }
+
+        // Do the final computation based on the tail and length
+        // Beware that the final length may not fit in 32 bits so we take care of that
+        tmp = this._length * 8;
+        tmp = tmp.toString(16).match(/(.*?)(.{0,8})$/);
+        lo = parseInt(tmp[2], 16);
+        hi = parseInt(tmp[1], 16) || 0;
+
+        tail[14] = lo;
+        tail[15] = hi;
+        md5cycle(this._hash, tail);
+    };
+
+    /**
+     * Performs the md5 hash on a string.
+     * A conversion will be applied if utf8 string is detected.
+     *
+     * @param {String}  str The string
+     * @param {Boolean} [raw] True to get the raw string, false to get the hex string
+     *
+     * @return {String} The result
+     */
+    SparkMD5.hash = function (str, raw) {
+        // Converts the string to utf8 bytes if necessary
+        // Then compute it using the binary function
+        return SparkMD5.hashBinary(toUtf8(str), raw);
+    };
+
+    /**
+     * Performs the md5 hash on a binary string.
+     *
+     * @param {String}  content The binary string
+     * @param {Boolean} [raw]     True to get the raw string, false to get the hex string
+     *
+     * @return {String} The result
+     */
+    SparkMD5.hashBinary = function (content, raw) {
+        var hash = md51(content),
+            ret = hex(hash);
+
+        return raw ? hexToBinaryString(ret) : ret;
+    };
+
+    // ---------------------------------------------------
+
+    /**
+     * SparkMD5 OOP implementation for array buffers.
+     *
+     * Use this class to perform an incremental md5 ONLY for array buffers.
+     */
+    SparkMD5.ArrayBuffer = function () {
+        // call reset to init the instance
+        this.reset();
+    };
+
+    /**
+     * Appends an array buffer.
+     *
+     * @param {ArrayBuffer} arr The array to be appended
+     *
+     * @return {SparkMD5.ArrayBuffer} The instance itself
+     */
+    SparkMD5.ArrayBuffer.prototype.append = function (arr) {
+        var buff = concatenateArrayBuffers(this._buff.buffer, arr, true),
+            length = buff.length,
+            i;
+
+        this._length += arr.byteLength;
+
+        for (i = 64; i <= length; i += 64) {
+            md5cycle(this._hash, md5blk_array(buff.subarray(i - 64, i)));
+        }
+
+        this._buff = (i - 64) < length ? new Uint8Array(buff.buffer.slice(i - 64)) : new Uint8Array(0);
+
+        return this;
+    };
+
+    /**
+     * Finishes the incremental computation, reseting the internal state and
+     * returning the result.
+     *
+     * @param {Boolean} raw True to get the raw string, false to get the hex string
+     *
+     * @return {String} The result
+     */
+    SparkMD5.ArrayBuffer.prototype.end = function (raw) {
+        var buff = this._buff,
+            length = buff.length,
+            tail = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
+            i,
+            ret;
+
+        for (i = 0; i < length; i += 1) {
+            tail[i >> 2] |= buff[i] << ((i % 4) << 3);
+        }
+
+        this._finish(tail, length);
+        ret = hex(this._hash);
+
+        if (raw) {
+            ret = hexToBinaryString(ret);
+        }
+
+        this.reset();
+
+        return ret;
+    };
+
+    /**
+     * Resets the internal state of the computation.
+     *
+     * @return {SparkMD5.ArrayBuffer} The instance itself
+     */
+    SparkMD5.ArrayBuffer.prototype.reset = function () {
+        this._buff = new Uint8Array(0);
+        this._length = 0;
+        this._hash = [1732584193, -271733879, -1732584194, 271733878];
+
+        return this;
+    };
+
+    /**
+     * Gets the internal state of the computation.
+     *
+     * @return {Object} The state
+     */
+    SparkMD5.ArrayBuffer.prototype.getState = function () {
+        var state = SparkMD5.prototype.getState.call(this);
+
+        // Convert buffer to a string
+        state.buff = arrayBuffer2Utf8Str(state.buff);
+
+        return state;
+    };
+
+    /**
+     * Gets the internal state of the computation.
+     *
+     * @param {Object} state The state
+     *
+     * @return {SparkMD5.ArrayBuffer} The instance itself
+     */
+    SparkMD5.ArrayBuffer.prototype.setState = function (state) {
+        // Convert string to buffer
+        state.buff = utf8Str2ArrayBuffer(state.buff, true);
+
+        return SparkMD5.prototype.setState.call(this, state);
+    };
+
+    SparkMD5.ArrayBuffer.prototype.destroy = SparkMD5.prototype.destroy;
+
+    SparkMD5.ArrayBuffer.prototype._finish = SparkMD5.prototype._finish;
+
+    /**
+     * Performs the md5 hash on an array buffer.
+     *
+     * @param {ArrayBuffer} arr The array buffer
+     * @param {Boolean}     [raw] True to get the raw string, false to get the hex one
+     *
+     * @return {String} The result
+     */
+    SparkMD5.ArrayBuffer.hash = function (arr, raw) {
+        var hash = md51_array(new Uint8Array(arr)),
+            ret = hex(hash);
+
+        return raw ? hexToBinaryString(ret) : ret;
+    };
+
+    return SparkMD5;
+}));
+
+
 /***/ }),
 
 /***/ 88310:
@@ -286702,7 +287784,7 @@ var wappaio_install = function install(Vue) {
   });
 
   // 3. 异步加载工作流引擎插件（独立 chunk）
-  Promise.resolve(/* import() eager */).then(__webpack_require__.bind(__webpack_require__, 99932)).then(function (m) {
+  Promise.resolve(/* import() eager */).then(__webpack_require__.bind(__webpack_require__, 86322)).then(function (m) {
     Vue.use(m.default || m);
   });
 };
@@ -286740,7 +287822,7 @@ var webSocket = websocket/* default */.A;
 
 // ---------- 工作流相关 ----------
 var WfengineModule = function WfengineModule() {
-  return Promise.resolve(/* import() eager */).then(__webpack_require__.bind(__webpack_require__, 99932));
+  return Promise.resolve(/* import() eager */).then(__webpack_require__.bind(__webpack_require__, 86322));
 };
 var WflowformModule = function WflowformModule() {
   return Promise.resolve(/* import() eager */).then(__webpack_require__.bind(__webpack_require__, 89013));