vue2.X分片上传_vue视频分片上传

作者：你好赵伟 | 2024-03-19 13:27:29

踩

vue视频分片上传

前言

场景：vue2.X使用ant design vue UI框架实现大文件分片上传，小于5MB普通上传，大于5MB用分片上传。
接口有五个（请查看五：接口文件）：
1.断点续传-初始化接口 initMultiPartUpload
2.断点续传-分片文件上传接口 uploadPartFile
3.断点续传-查询分片上传信息接口 listMultipart
4.断点续传-合并分片文件接口 mergeMultipartUpload

效果图：在这里插入图片描述
初始化的接口：

查询接口：
上传接口：

合并的接口：

一：封装解析文件md5的方法

spark-md5.js

(function (factory) {
  if (typeof exports === 'object') {
    // Node/CommonJS
    module.exports = factory()
  } else if (typeof define === 'function' && define.amd) {
    // AMD
    define(factory)
  } else {
    // Browser globals (with support for web workers)
    var glob

    try {
      glob = window
    } catch (e) {
      glob = self
    }

    glob.SparkMD5 = factory()
  }
}(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
}))

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752

二：封装分片上传的方法文件

sectionUpLoadUtil.js

import {
  mergeMultipartUpload,
  listMultipart,
  uploadPartFile,
  initMultiPartUpload,
} from '@/api/sectionFile.js'
import SparkMD5 from './spark-md5.js'
var chunkSize = 5 * 1024 * 1024 // 1MB一片
var chunkCount = []
var chunkList = [] // 分片列表
var uploaded = [] // 已经上传的
var uploadId = '' //分片上传唯一标识
var uploadPath = ''
var uploadPathSuccess = {
  status: 0,
  message: '',
  url: '',
}
var numbers = 0

/*** 传入文件对象,返回文件生成的HASH值,buffer
 * @param file
 * @returns {Promise<unknown>}
 */
export const changeBuffer = (file) => {
  return new Promise((resolve) => {
    var fileReader = new FileReader()
    fileReader.readAsArrayBuffer(file)
    fileReader.onload = (ev) => {
      var buffer = ev.target.result,
        spark = new SparkMD5.ArrayBuffer(),
        HASH,
        suffix
      spark.append(buffer)
      HASH = spark.end()
      resolve({
        buffer,
        HASH,
      })
    }
  })
}
// 获取md5
function readFileMD5(file, pieceSize, concurrent) {
  return new Promise((resolve, reject) => {
    // 读取视频文件的md5
    changeBuffer(file).then((res) => {
      initMultiPartUpload(file.name, res.HASH, file.size, file.name)
        .then((res) => {
          uploadPath = res.data.uploadPath
          uploadId = res.data.uploadId
          chunkSize = res.data.partSize // 1MB一片
          chunkCount = res.data.partCount // 总片数
          //已上传成功
          if (res.data.done) {
            uploadPathSuccess = {
              status: res.status,
              message: '已上传成功',
              url: res.data.uploadPath,
            }
            resolve({ uploadPathSuccess })
          } else {
            listMultipart(res.data.uploadId)
              .then(async (reslistMultipart) => {
                uploaded = reslistMultipart.data.uploadedPartNums
                //判断已上传了多少
                if (chunkCount == uploaded.length) {
                  _mergeMultipartUpload().then((res) => {
                    uploadPathSuccess = {
                      status: res.status,
                      message: res.message,
                      url: res.url,
                    }
                    resolve({ uploadPathSuccess })
                  })
                } else {
                  var _concurrentUpload = await concurrentUpload(file, pieceSize, concurrent)
                  if (numbers % 3 === 0 && uploaded.length < chunkCount) {
                    _concurrentUpload = await concurrentUpload(file, pieceSize, concurrent)
                  }
                  //如果上传成功
                  if (_concurrentUpload.status === 0) {
                    await _mergeMultipartUpload().then((res) => {
                      uploadPathSuccess = {
                        status: res.status,
                        message: res.message,
                        url: res.url,
                      }
                    })
                  }
                  resolve({ uploadPathSuccess })
                }
              })
              .catch((err) => {
                uploadPathSuccess = {
                  status: 1,
                  message: 'listMultipart查询分片上传信息接口报错:' + err.message,
                  url: '',
                }
                resolve({ uploadPathSuccess })
              })
          }
        })
        .catch((e) => {
          uploadPathSuccess = {
            status: 1,
            message: e.message,
            url: '',
          }
          reject(uploadPathSuccess)
        })
    })
  })
}
/***
 * 获取每一个分片的详情
 **/
export const getChunkInfo = (file, currentChunk, chunkSize) => {
  var start = currentChunk * chunkSize
  var end = Math.min(file.size, start + chunkSize)
  var chunk = file.slice(start, end)
  return {
    start,
    end,
    chunk,
  }
}
/***
 * 针对每个文件进行chunk处理
 **/
export const readChunkMD5 = (file, pieceSize, concurrent) => {
  // 针对单个文件进行chunk上传
  for (var i = 0; i < chunkCount; i++) {
    const { chunk } = getChunkInfo(file, i, chunkSize)

    // 判断已经上传的分片中是否包含当前分片
    if (uploaded.indexOf(i + '') == -1) {
      uploadChunk({
        chunk,
        currentChunk: i,
        chunkCount,
      })
    }
  }
}

/***
 * 并发上传
 **/
export async function concurrentUpload(file, pieceSize, concurrent) {
  chunkList = []
  for (var i = 1; i <= chunkCount; i++) {
    chunkList.push(Number(i))
  }
  chunkList = chunkList.filter((e) => !uploaded.some((item) => item === e))

  await concurrentExecution(chunkList, concurrent, (curItem) => {
    return new Promise((resolve, reject) => {
      const { chunk } = getChunkInfo(file, curItem - 1, chunkSize)
      var chunkInfo = {
        chunk,
        currentChunk: curItem,
        chunkCount,
      }
      var inde = chunkInfo.currentChunk

      if (uploaded.indexOf(inde + '') == -1) {
        // 构建上传文件的formData
        var uploadData = createUploadData(chunkInfo)

        uploadPartFile(uploadData)
          .then(async (res) => {
            numbers++
            uploaded.push(chunkInfo.currentChunk)
            resolve()
          })
          .catch((e) => {
            reject(e)
          })
      }
    })
  })
    .then(async (res) => {
      uploadPathSuccess = {
        status: 0,
        message: '上传成功',
        url: '',
      }
    })
    .catch((err) => {
      uploadPathSuccess = {
        status: 1,
        message: '上传失败',
        url: '',
      }
    })
  return uploadPathSuccess
}
// 合并文件
export const _mergeMultipartUpload = () => {
  return new Promise((resolve, reject) => {
    mergeMultipartUpload(uploadPath, uploadId)
      .then((res) => {
        uploadPathSuccess = {
          status: res.status,
          message: '上传成功',
          url: uploadPath,
        }
        resolve(uploadPathSuccess)
      })
      .catch((err) => {
        uploadPathSuccess = {
          status: err.status,
          message: err.message,
          url: '',
        }
        resolve(uploadPathSuccess)
      })
  })
}
/***
 * 创建文件上传参数
 **/
export const createUploadData = (chunkInfo) => {
  var fetchForm = new FormData()
  fetchForm.append('file', chunkInfo.chunk)
  fetchForm.append('filePath', uploadPath)
  fetchForm.append('partSize', chunkInfo.chunk.size)
  fetchForm.append('partNumber', chunkInfo.currentChunk)
  fetchForm.append('uploadId', uploadId)
  return fetchForm
}

/**
 * 文件分片上传
 * @params file {File} 文件
 * @params pieceSize {Number} 分片大小 默认3MB
 * @params concurrent {Number} 并发数量 默认2
 * @params process {Function} 进度回调函数
 * @params success {Function} 成功回调函数
 * @params error {Function} 失败回调函数
 */
export const uploadByPieces = (file, pieceSize = 5, concurrent = 3) => {
  return new Promise((resolve, reject) => {
    file = file
    numbers = 0
    readFileMD5(file, pieceSize, concurrent).then((res) => {
      resolve(res)
    })
  })
}

/**
 * 并发执行
 * @params list {Array} - 要迭代的数组
 * @params limit {Number} - 并发数量控制数,最好小于3
 * @params asyncHandle {Function} - 对`list`的每一个项的处理函数，参数为当前处理项，必须 return 一个Promise来确定是否继续进行迭代
 * @return {Promise} - 返回一个 Promise 值来确认所有数据是否迭代完成
 */
export function concurrentExecution(list, limit, asyncHandle) {
  // 递归执行
  var recursion = (arr) => {
    // 执行方法 arr.shift() 取出并移除第一个数据
    return asyncHandle(arr.shift()).then(() => {
      // 数组还未迭代完，递归继续进行迭代
      if (arr.length !== 0) {
        return recursion(arr)
      } else {
        return 'finish'
      }
    })
  }
  // 创建新的并发数组
  var listCopy = [].concat(list)
  // 正在进行的所有并发异步操作
  var asyncList = []
  limit = limit > listCopy.length ? listCopy.length : limit
  while (limit--) {
    asyncList.push(recursion(listCopy))
  }
  // 所有并发异步操作都完成后，本次并发控制迭代完成
  return Promise.all(asyncList)
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283

三：定义一个公共方法

util.js

// 防抖函数
export function debounce(fn, delay = 300) {
  //默认300毫秒
  var timer
  return function () {
    var args = arguments
    if (timer) {
      clearTimeout(timer)
    }
    timer = setTimeout(() => {
      fn.apply(this, args) // this 指向vue
    }, delay)
  }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14

四：使用断点续传方法的页面

<template>
  <div>
    <a-upload :customRequest="customRequest" :file-list="fileList" @change="handleUploadChange" :accept="uploadAccept">
      <a-button v-if="fileList.length < 1"> <a-icon :type="loading ? 'loading' : 'plus'" /> 上传文件 </a-button>
    </a-upload>
  </div>
</template>

<script>
import { debounce } from '@/utils/util'
import { uploadByPieces, concurrentExecution } from '@/utils/sectionUpLoadUtil'
export default {
  data() {
    return {
      //文件
      fileList: [],
      //上传的格式
      uploadAccept: '',
        //上传的loading
      loading: false,
      //上传文件的地址
      action:'',
    }
  },
  methods:{
        //上传文件(限制只允许上传一个文件)
    async handleUploadChange(info) {
    //   if (!fileTypes.test(info.file.name.toLowerCase())) {
    //     // 格式根据自己需求定义
    //     this.$message.error('上传格式不正确，请上传' + this.uploadTitle)
    //     return false
    //   }
      if (info.file.status == 'removed') {
        //主动删除文件
        // this.btnLoading = false
      }

      let fileList = [...info.fileList]
      fileList = fileList.slice(-1)
      fileList = fileList.map((file) => {
        if (file.response) {
          file.url = file.response.url
        }
        return file
      })
      this.fileList = fileList
      if (this.fileList[0]?.response?.status == 0) {
        //上传成功
        // this.btnLoading = false
      }
    },
        // 图片上传的api
    uploadFile(parameter) {
      return request({
        url: this.action,
        method: 'post',
        headers: { 'Content-Type': 'multipart/form-data' },
        data: parameter,
        timeout: 1000 * 60 * 10,
      })
    },
        // 自定义上传，可以自定义上传接口，不用通过action属性，还是非常灵活的
    customRequest: debounce(async function (file) {
      //同时只能处理一个文件上传
      await concurrentExecution(this.fileList, 1, (curItem) => {
        return new Promise(async (resolve) => {
          //如果小于5MB则走老接口  反之走断点续传
          if (curItem.size / 1024 / 1024 > 5) {
            await uploadByPieces(curItem.originFileObj).then((res) => {
              if (res.uploadPathSuccess.status !== 0) {
                file.onError()
                file.status = 'error'
                this.$message.warning(res.uploadPathSuccess.message)
                return
              }
              const fileObj = file.file
              // 调用组件内方法, 设置为成功状态
              file.onSuccess(
                {
                  status: 0,
                  data: {
                    downloadPath: process.env.VUE_APP_MINIO_PROXY_KEY + '/' + res.uploadPathSuccess.url,
                    size: fileObj.size,
                    suffix: fileObj.name.substring(fileObj.name.lastIndexOf('.') + 1),
                  },
                },
                file
              )
              file.status = 'done'
              resolve()
            })
          } else {
            // file 是上传的文件 其内容会在放在下面
            // 后端需要接受的参数是 formData数据，
            const form = new FormData()
            form.append('file', file.file)
            // uploadFile
            this.uploadFile(form)
              .then((res) => {
                // 调用组件内方法, 设置为成功状态
                file.onSuccess(res, file)
                file.status = 'done'
                resolve()
              })
              .catch((err) => {
                file.onError()
                file.status = 'error'
                if (err.message != "Cannot read properties of undefined (reading 'status')") {
                  this.$message.error(err.message)
                } else {
                  this.$message.error('上传超时，请求失败!')
                }
                resolve()
              })
          }
        })
      })
    }, 500),
  },
}
</script>
<style lang="less" scoped>
</style>
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123

五：接口文件

sectionFile.js

// 切片断点续传调用接口
import { request } from '@/utils/request'

const fileApi = {
  initMultiPartUpload: '/micro/file/minio/initMultiPartUpload', //断点续传-初始化接口
  uploadPartFile: '/micro/file/minio/uploadPartFile', // 断点续传-分片文件上传接口
  listMultipart: '/micro/file/minio/listMultipart', // 断点续传-查询分片上传信息接口
  mergeMultipartUpload: '/micro/file/minio/mergeMultipartUpload', //断点续传-合并分片文件接口
  abortMultipartUpload: '/micro/file/minio/abortMultipartUpload', // 断点续传-取消/中止分片上传接口

  listMultipartUploadId: '/micro/file/minio/listMultipart/', // 断点续传-根据文件uploadId查询文件上传状态接口
}
/**
 *断点续传-根据文件uploadId查询文件上传状态接口
 * @param {*} uploadId  分片上传唯一标识
 * 这个接口一般不用
 * @returns
 */
export const listMultipartUploadId = (uploadId) => {
  return request({
    url: fileApi.listMultipartUploadId + '/' + uploadId,
    method: 'post',
    // baseURL: '/mock',
  })
}
/**
 * 断点续传-取消/中止分片上传接口
 * @param {*} filePath  文件上传路径 上传文件到minio的路径，无需拼接桶位
 * @param {*} uploadId  分片上传唯一标识
 * @returns
 */
export const abortMultipartUpload = (filePath, uploadId) => {
  return request({
    url: fileApi.abortMultipartUpload + '?filePath=' + filePath + '&uploadId=' + uploadId,
    method: 'get',
    // baseURL: '/mock',
  })
}
/**
 *  断点续传-合并分片文件接口
 * @param {*} filePath  文件上传路径 上传文件到minio的路径，无需拼接桶位
 * @param {*} uploadId  分片上传唯一标识
 * @returns
 */
export const mergeMultipartUpload = (filePath, uploadId) => {
  return request({
    url: fileApi.mergeMultipartUpload,
    method: 'post',
    data: {
      uploadId,
      filePath,
    },
    // baseURL: '/mock',
  })
}
/**
 *  断点续传-查询分片上传信息接口
 * @param {*} filePath  文件上传路径 上传文件到minio的路径，无需拼接桶位
 * @param {*} uploadId  分片上传唯一标识
 * @returns
 */
export const listMultipart = (uploadId) => {
  return request({
    url: fileApi.listMultipart + '/' + uploadId,
    method: 'post',
    // baseURL: '/mock',
  })
}
/**
 * 断点续传-分片文件上传接口
 * @param {*} file  分片文件
 * @param {*} filePath  文件上传路径 上传文件到minio的路径，无需拼接桶位
 * @param {*} partSize  当前分片大小
 * @param {*} partNumber  当前分片序号
 * @param {*} uploadId  分片上传唯一标识
 * @returns
 */
export const uploadPartFile = (data) => {
  return request({
    url: fileApi.uploadPartFile,
    method: 'post',
    data,
    // responseType: 'blob',
    processData: false, // 告诉jQuery不要去处理发送的数据
    contentType: false, // 告诉jQuery不要去设置Content-Type请求头
    headers: {
      'content-type': 'multipart/form-data; ',
    },
    timeout: 1000 * 60 * 10,
    // baseURL: '/mock',
  })
}
/**
 * 断点续传-初始化接口
 * @param {*} name  文件名称
 * @param {*} md5  文件MD5
 * @param {*} size  文件大小
 * @param {*} localPath  文件在电脑本地绝对路径
 * @returns
 */
export const initMultiPartUpload = (name, md5, size, localPath) => {
  return request({
    url: fileApi.initMultiPartUpload,
    method: 'post',
    data: {
      name: name,
      md5: md5,
      size: size,
      localPath: localPath,
    },
    // baseURL: '/mock',
  })
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114

六：注意点

1.process.env.VUE_APP_MINIO_PROXY_KEY是定义在.env文件里的minio地址ip的全局常量
2.因为页面使用SparkMD5跟npm有冲突，所以存了一份SparkMD5的js文件，以本地引用的方法引入
3.断点续传根据接口实际业务去变化，我这边由于后端定了文件上传的步骤，导致前端被动接受
4.本文限制文件名相同以及md5相同则判断视为同一个文件
5.本文限制一次性同时上传3个分片，分片可以用户自定义

声明：本文内容由网友自发贡献，不代表【wpsshop博客】立场，版权归原作者所有，本站不承担相应法律责任。如您发现有侵权的内容，请联系我们。转载请注明出处：https://www.wpsshop.cn/w/你好赵伟/article/detail/267816?site