微信小程序生成二维码并保存到本地方法

微信小程序生成二维码请保存到本地方法

官方weapp-qrcode插件 github链接

功能完成样子
在这里插入图片描述
wxml

<view class="qrcode">
  <canvas style="width: 275px; height: 275px;" canvas-id='myQrcode'></canvas>
</view>
<view class=" qrcode-btn" bind:tap="saveQrcode">
  <image src="https://imgzs.linkunst.com:10003/allimg/sccontrol/9999/20231128/21953source656544a5eb1de.png" mode="" />
  <view>保存图片</view>
</view>

js文件

import drawQrcode from './weapp-qrcode.js';
//二维码生成
  QRcodeGeneration() {
    return new Promise((resolve, reject) => {
      wx.hideLoading();
      drawQrcode({
        text: 'https://***/**?id=1', //您的生成路径
        width: 275, //宽度
        height: 275, //高度
        typeNumber: 7, //非必须，二维码的计算模式，默认值-1
        canvasId: 'myQrcode', //必须，绘制的canvasId
        correctLevel: 1, //非必须，二维码纠错级别，默认值为高级，取值：{ L: 1, M: 0, Q: 3, H: 2 }
        _this: this, //非必须，若在组件中使用，需要传入，v0.7.0+版本支持
        callback: () => { //绘制完成回调 要加定时不然拿不到 暂不知道啥原因~
          setTimeout(() => { //更多配置请前往官方github地址文档查看
            wx.canvasToTempFilePath(
              {
                canvasId: 'myQrcode',
                success: (res) => {
                  resolve(res); //导出临时二维码图片路径
                },
              },
              this
            );
          }, 500);
        },
      });
    });
  },
  //保存二维码
  async saveQrcode() {
   const { tempFilePath } = await this.QRcodeGeneration(); //获取二维码路径
    wx.getImageInfo({
      src: tempFilePath,//传入
      success: function (ret) {
        var path = ret.path; 
        wx.saveImageToPhotosAlbum({
          filePath: path,
          success(result) { //保存到本地
            if (result.errMsg === 'saveImageToPhotosAlbum:ok') {
              wx.showToast({
                title: '保存成功',
              });
            }
          },
        });
      },
    });
  },
  /**
   * 生命周期函数--监听页面加载
   */
  onLoad(options) {
    wx.showLoading({ title: '正在努力生成~' });
    setTimeout(() => {
      this.QRcodeGeneration(); //这里加延迟因为怕拿不到canvas的dom
    }, 1000);
  },

如果github进不去可以直接复制我这个js到项目里
weapp-qrcode.js

/**
 * weapp.qrcode.js v1.0.0 (https://github.com/yingye/weapp-qrcode#readme)
 */

var hasOwn = Object.prototype.hasOwnProperty,
  toStr = Object.prototype.toString,
  defineProperty = Object.defineProperty,
  gOPD = Object.getOwnPropertyDescriptor,
  isArray = function (t) {
    return 'function' == typeof Array.isArray ? Array.isArray(t) : '[object Array]' === toStr.call(t);
  },
  isPlainObject = function (t) {
    if (!t || '[object Object]' !== toStr.call(t)) return !1;
    var e,
      r = hasOwn.call(t, 'constructor'),
      o = t.constructor && t.constructor.prototype && hasOwn.call(t.constructor.prototype, 'isPrototypeOf');
    if (t.constructor && !r && !o) return !1;
    for (e in t);
    return void 0 === e || hasOwn.call(t, e);
  },
  setProperty = function (t, e) {
    defineProperty && '__proto__' === e.name ? defineProperty(t, e.name, { enumerable: !0, configurable: !0, value: e.newValue, writable: !0 }) : (t[e.name] = e.newValue);
  },
  getProperty = function (t, e) {
    if ('__proto__' === e) {
      if (!hasOwn.call(t, e)) return;
      if (gOPD) return gOPD(t, e).value;
    }
    return t[e];
  },
  extend = function t() {
    var e,
      r,
      o,
      n,
      i,
      a,
      s = arguments[0],
      u = 1,
      l = arguments.length,
      h = !1;
    for ('boolean' == typeof s && ((h = s), (s = arguments[1] || {}), (u = 2)), (null == s || ('object' != typeof s && 'function' != typeof s)) && (s = {}); u < l; ++u)
      if (null != (e = arguments[u]))
        for (r in e)
          (o = getProperty(s, r)),
            s !== (n = getProperty(e, r)) && (h && n && (isPlainObject(n) || (i = isArray(n))) ? (i ? ((i = !1), (a = o && isArray(o) ? o : [])) : (a = o && isPlainObject(o) ? o : {}), setProperty(s, { name: r, newValue: t(h, a, n) })) : void 0 !== n && setProperty(s, { name: r, newValue: n }));
    return s;
  };
function QR8bitByte(t) {
  (this.mode = QRMode.MODE_8BIT_BYTE), (this.data = t);
}
function QRCode(t, e) {
  (this.typeNumber = t), (this.errorCorrectLevel = e), (this.modules = null), (this.moduleCount = 0), (this.dataCache = null), (this.dataList = new Array());
}
(QR8bitByte.prototype = {
  getLength: function (t) {
    return this.data.length;
  },
  write: function (t) {
    for (var e = 0; e < this.data.length; e++) t.put(this.data.charCodeAt(e), 8);
  },
}),
  (QRCode.prototype = {
    addData: function (t) {
      var e = new QR8bitByte(t);
      this.dataList.push(e), (this.dataCache = null);
    },
    isDark: function (t, e) {
      if (t < 0 || this.moduleCount <= t || e < 0 || this.moduleCount <= e) throw new Error(t + ',' + e);
      return this.modules[t][e];
    },
    getModuleCount: function () {
      return this.moduleCount;
    },
    make: function () {
      if (this.typeNumber < 1) {
        var t = 1;
        for (t = 1; t < 40; t++) {
          for (var e = QRRSBlock.getRSBlocks(t, this.errorCorrectLevel), r = new QRBitBuffer(), o = 0, n = 0; n < e.length; n++) o += e[n].dataCount;
          for (n = 0; n < this.dataList.length; n++) {
            var i = this.dataList[n];
            r.put(i.mode, 4), r.put(i.getLength(), QRUtil.getLengthInBits(i.mode, t)), i.write(r);
          }
          if (r.getLengthInBits() <= 8 * o) break;
        }
        this.typeNumber = t;
      }
      this.makeImpl(!1, this.getBestMaskPattern());
    },
    makeImpl: function (t, e) {
      (this.moduleCount = 4 * this.typeNumber + 17), (this.modules = new Array(this.moduleCount));
      for (var r = 0; r < this.moduleCount; r++) {
        this.modules[r] = new Array(this.moduleCount);
        for (var o = 0; o < this.moduleCount; o++) this.modules[r][o] = null;
      }
      this.setupPositionProbePattern(0, 0),
        this.setupPositionProbePattern(this.moduleCount - 7, 0),
        this.setupPositionProbePattern(0, this.moduleCount - 7),
        this.setupPositionAdjustPattern(),
        this.setupTimingPattern(),
        this.setupTypeInfo(t, e),
        this.typeNumber >= 7 && this.setupTypeNumber(t),
        null == this.dataCache && (this.dataCache = QRCode.createData(this.typeNumber, this.errorCorrectLevel, this.dataList)),
        this.mapData(this.dataCache, e);
    },
    setupPositionProbePattern: function (t, e) {
      for (var r = -1; r <= 7; r++)
        if (!(t + r <= -1 || this.moduleCount <= t + r)) for (var o = -1; o <= 7; o++) e + o <= -1 || this.moduleCount <= e + o || (this.modules[t + r][e + o] = (0 <= r && r <= 6 && (0 == o || 6 == o)) || (0 <= o && o <= 6 && (0 == r || 6 == r)) || (2 <= r && r <= 4 && 2 <= o && o <= 4));
    },
    getBestMaskPattern: function () {
      for (var t = 0, e = 0, r = 0; r < 8; r++) {
        this.makeImpl(!0, r);
        var o = QRUtil.getLostPoint(this);
        (0 == r || t > o) && ((t = o), (e = r));
      }
      return e;
    },
    createMovieClip: function (t, e, r) {
      var o = t.createEmptyMovieClip(e, r);
      this.make();
      for (var n = 0; n < this.modules.length; n++)
        for (var i = 1 * n, a = 0; a < this.modules[n].length; a++) {
          var s = 1 * a;
          this.modules[n][a] && (o.beginFill(0, 100), o.moveTo(s, i), o.lineTo(s + 1, i), o.lineTo(s + 1, i + 1), o.lineTo(s, i + 1), o.endFill());
        }
      return o;
    },
    setupTimingPattern: function () {
      for (var t = 8; t < this.moduleCount - 8; t++) null == this.modules[t][6] && (this.modules[t][6] = t % 2 == 0);
      for (var e = 8; e < this.moduleCount - 8; e++) null == this.modules[6][e] && (this.modules[6][e] = e % 2 == 0);
    },
    setupPositionAdjustPattern: function () {
      for (var t = QRUtil.getPatternPosition(this.typeNumber), e = 0; e < t.length; e++)
        for (var r = 0; r < t.length; r++) {
          var o = t[e],
            n = t[r];
          if (null == this.modules[o][n]) for (var i = -2; i <= 2; i++) for (var a = -2; a <= 2; a++) this.modules[o + i][n + a] = -2 == i || 2 == i || -2 == a || 2 == a || (0 == i && 0 == a);
        }
    },
    setupTypeNumber: function (t) {
      for (var e = QRUtil.getBCHTypeNumber(this.typeNumber), r = 0; r < 18; r++) {
        var o = !t && 1 == ((e >> r) & 1);
        this.modules[Math.floor(r / 3)][(r % 3) + this.moduleCount - 8 - 3] = o;
      }
      for (r = 0; r < 18; r++) {
        o = !t && 1 == ((e >> r) & 1);
        this.modules[(r % 3) + this.moduleCount - 8 - 3][Math.floor(r / 3)] = o;
      }
    },
    setupTypeInfo: function (t, e) {
      for (var r = (this.errorCorrectLevel << 3) | e, o = QRUtil.getBCHTypeInfo(r), n = 0; n < 15; n++) {
        var i = !t && 1 == ((o >> n) & 1);
        n < 6 ? (this.modules[n][8] = i) : n < 8 ? (this.modules[n + 1][8] = i) : (this.modules[this.moduleCount - 15 + n][8] = i);
      }
      for (n = 0; n < 15; n++) {
        i = !t && 1 == ((o >> n) & 1);
        n < 8 ? (this.modules[8][this.moduleCount - n - 1] = i) : n < 9 ? (this.modules[8][15 - n - 1 + 1] = i) : (this.modules[8][15 - n - 1] = i);
      }
      this.modules[this.moduleCount - 8][8] = !t;
    },
    mapData: function (t, e) {
      for (var r = -1, o = this.moduleCount - 1, n = 7, i = 0, a = this.moduleCount - 1; a > 0; a -= 2)
        for (6 == a && a--; ; ) {
          for (var s = 0; s < 2; s++)
            if (null == this.modules[o][a - s]) {
              var u = !1;
              i < t.length && (u = 1 == ((t[i] >>> n) & 1)), QRUtil.getMask(e, o, a - s) && (u = !u), (this.modules[o][a - s] = u), -1 == --n && (i++, (n = 7));
            }
          if ((o += r) < 0 || this.moduleCount <= o) {
            (o -= r), (r = -r);
            break;
          }
        }
    },
  }),
  (QRCode.PAD0 = 236),
  (QRCode.PAD1 = 17),
  (QRCode.createData = function (t, e, r) {
    for (var o = QRRSBlock.getRSBlocks(t, e), n = new QRBitBuffer(), i = 0; i < r.length; i++) {
      var a = r[i];
      n.put(a.mode, 4), n.put(a.getLength(), QRUtil.getLengthInBits(a.mode, t)), a.write(n);
    }
    var s = 0;
    for (i = 0; i < o.length; i++) s += o[i].dataCount;
    if (n.getLengthInBits() > 8 * s) throw new Error('code length overflow. (' + n.getLengthInBits() + '>' + 8 * s + ')');
    for (n.getLengthInBits() + 4 <= 8 * s && n.put(0, 4); n.getLengthInBits() % 8 != 0; ) n.putBit(!1);
    for (; !(n.getLengthInBits() >= 8 * s || (n.put(QRCode.PAD0, 8), n.getLengthInBits() >= 8 * s)); ) n.put(QRCode.PAD1, 8);
    return QRCode.createBytes(n, o);
  }),
  (QRCode.createBytes = function (t, e) {
    for (var r = 0, o = 0, n = 0, i = new Array(e.length), a = new Array(e.length), s = 0; s < e.length; s++) {
      var u = e[s].dataCount,
        l = e[s].totalCount - u;
      (o = Math.max(o, u)), (n = Math.max(n, l)), (i[s] = new Array(u));
      for (var h = 0; h < i[s].length; h++) i[s][h] = 255 & t.buffer[h + r];
      r += u;
      var f = QRUtil.getErrorCorrectPolynomial(l),
        g = new QRPolynomial(i[s], f.getLength() - 1).mod(f);
      a[s] = new Array(f.getLength() - 1);
      for (h = 0; h < a[s].length; h++) {
        var c = h + g.getLength() - a[s].length;
        a[s][h] = c >= 0 ? g.get(c) : 0;
      }
    }
    var d = 0;
    for (h = 0; h < e.length; h++) d += e[h].totalCount;
    var R = new Array(d),
      m = 0;
    for (h = 0; h < o; h++) for (s = 0; s < e.length; s++) h < i[s].length && (R[m++] = i[s][h]);
    for (h = 0; h < n; h++) for (s = 0; s < e.length; s++) h < a[s].length && (R[m++] = a[s][h]);
    return R;
  });
for (
  var QRMode = { MODE_NUMBER: 1, MODE_ALPHA_NUM: 2, MODE_8BIT_BYTE: 4, MODE_KANJI: 8 },
    QRErrorCorrectLevel = { L: 1, M: 0, Q: 3, H: 2 },
    QRMaskPattern = { PATTERN000: 0, PATTERN001: 1, PATTERN010: 2, PATTERN011: 3, PATTERN100: 4, PATTERN101: 5, PATTERN110: 6, PATTERN111: 7 },
    QRUtil = {
      PATTERN_POSITION_TABLE: [
        [],
        [6, 18],
        [6, 22],
        [6, 26],
        [6, 30],
        [6, 34],
        [6, 22, 38],
        [6, 24, 42],
        [6, 26, 46],
        [6, 28, 50],
        [6, 30, 54],
        [6, 32, 58],
        [6, 34, 62],
        [6, 26, 46, 66],
        [6, 26, 48, 70],
        [6, 26, 50, 74],
        [6, 30, 54, 78],
        [6, 30, 56, 82],
        [6, 30, 58, 86],
        [6, 34, 62, 90],
        [6, 28, 50, 72, 94],
        [6, 26, 50, 74, 98],
        [6, 30, 54, 78, 102],
        [6, 28, 54, 80, 106],
        [6, 32, 58, 84, 110],
        [6, 30, 58, 86, 114],
        [6, 34, 62, 90, 118],
        [6, 26, 50, 74, 98, 122],
        [6, 30, 54, 78, 102, 126],
        [6, 26, 52, 78, 104, 130],
        [6, 30, 56, 82, 108, 134],
        [6, 34, 60, 86, 112, 138],
        [6, 30, 58, 86, 114, 142],
        [6, 34, 62, 90, 118, 146],
        [6, 30, 54, 78, 102, 126, 150],
        [6, 24, 50, 76, 102, 128, 154],
        [6, 28, 54, 80, 106, 132, 158],
        [6, 32, 58, 84, 110, 136, 162],
        [6, 26, 54, 82, 110, 138, 166],
        [6, 30, 58, 86, 114, 142, 170],
      ],
      G15: 1335,
      G18: 7973,
      G15_MASK: 21522,
      getBCHTypeInfo: function (t) {
        for (var e = t << 10; QRUtil.getBCHDigit(e) - QRUtil.getBCHDigit(QRUtil.G15) >= 0; ) e ^= QRUtil.G15 << (QRUtil.getBCHDigit(e) - QRUtil.getBCHDigit(QRUtil.G15));
        return ((t << 10) | e) ^ QRUtil.G15_MASK;
      },
      getBCHTypeNumber: function (t) {
        for (var e = t << 12; QRUtil.getBCHDigit(e) - QRUtil.getBCHDigit(QRUtil.G18) >= 0; ) e ^= QRUtil.G18 << (QRUtil.getBCHDigit(e) - QRUtil.getBCHDigit(QRUtil.G18));
        return (t << 12) | e;
      },
      getBCHDigit: function (t) {
        for (var e = 0; 0 != t; ) e++, (t >>>= 1);
        return e;
      },
      getPatternPosition: function (t) {
        return QRUtil.PATTERN_POSITION_TABLE[t - 1];
      },
      getMask: function (t, e, r) {
        switch (t) {
          case QRMaskPattern.PATTERN000:
            return (e + r) % 2 == 0;
          case QRMaskPattern.PATTERN001:
            return e % 2 == 0;
          case QRMaskPattern.PATTERN010:
            return r % 3 == 0;
          case QRMaskPattern.PATTERN011:
            return (e + r) % 3 == 0;
          case QRMaskPattern.PATTERN100:
            return (Math.floor(e / 2) + Math.floor(r / 3)) % 2 == 0;
          case QRMaskPattern.PATTERN101:
            return ((e * r) % 2) + ((e * r) % 3) == 0;
          case QRMaskPattern.PATTERN110:
            return (((e * r) % 2) + ((e * r) % 3)) % 2 == 0;
          case QRMaskPattern.PATTERN111:
            return (((e * r) % 3) + ((e + r) % 2)) % 2 == 0;
          default:
            throw new Error('bad maskPattern:' + t);
        }
      },
      getErrorCorrectPolynomial: function (t) {
        for (var e = new QRPolynomial([1], 0), r = 0; r < t; r++) e = e.multiply(new QRPolynomial([1, QRMath.gexp(r)], 0));
        return e;
      },
      getLengthInBits: function (t, e) {
        if (1 <= e && e < 10)
          switch (t) {
            case QRMode.MODE_NUMBER:
              return 10;
            case QRMode.MODE_ALPHA_NUM:
              return 9;
            case QRMode.MODE_8BIT_BYTE:
            case QRMode.MODE_KANJI:
              return 8;
            default:
              throw new Error('mode:' + t);
          }
        else if (e < 27)
          switch (t) {
            case QRMode.MODE_NUMBER:
              return 12;
            case QRMode.MODE_ALPHA_NUM:
              return 11;
            case QRMode.MODE_8BIT_BYTE:
              return 16;
            case QRMode.MODE_KANJI:
              return 10;
            default:
              throw new Error('mode:' + t);
          }
        else {
          if (!(e < 41)) throw new Error('type:' + e);
          switch (t) {
            case QRMode.MODE_NUMBER:
              return 14;
            case QRMode.MODE_ALPHA_NUM:
              return 13;
            case QRMode.MODE_8BIT_BYTE:
              return 16;
            case QRMode.MODE_KANJI:
              return 12;
            default:
              throw new Error('mode:' + t);
          }
        }
      },
      getLostPoint: function (t) {
        for (var e = t.getModuleCount(), r = 0, o = 0; o < e; o++)
          for (var n = 0; n < e; n++) {
            for (var i = 0, a = t.isDark(o, n), s = -1; s <= 1; s++) if (!(o + s < 0 || e <= o + s)) for (var u = -1; u <= 1; u++) n + u < 0 || e <= n + u || (0 == s && 0 == u) || (a == t.isDark(o + s, n + u) && i++);
            i > 5 && (r += 3 + i - 5);
          }
        for (o = 0; o < e - 1; o++)
          for (n = 0; n < e - 1; n++) {
            var l = 0;
            t.isDark(o, n) && l++, t.isDark(o + 1, n) && l++, t.isDark(o, n + 1) && l++, t.isDark(o + 1, n + 1) && l++, (0 != l && 4 != l) || (r += 3);
          }
        for (o = 0; o < e; o++) for (n = 0; n < e - 6; n++) t.isDark(o, n) && !t.isDark(o, n + 1) && t.isDark(o, n + 2) && t.isDark(o, n + 3) && t.isDark(o, n + 4) && !t.isDark(o, n + 5) && t.isDark(o, n + 6) && (r += 40);
        for (n = 0; n < e; n++) for (o = 0; o < e - 6; o++) t.isDark(o, n) && !t.isDark(o + 1, n) && t.isDark(o + 2, n) && t.isDark(o + 3, n) && t.isDark(o + 4, n) && !t.isDark(o + 5, n) && t.isDark(o + 6, n) && (r += 40);
        var h = 0;
        for (n = 0; n < e; n++) for (o = 0; o < e; o++) t.isDark(o, n) && h++;
        return (r += 10 * (Math.abs((100 * h) / e / e - 50) / 5));
      },
    },
    QRMath = {
      glog: function (t) {
        if (t < 1) throw new Error('glog(' + t + ')');
        return QRMath.LOG_TABLE[t];
      },
      gexp: function (t) {
        for (; t < 0; ) t += 255;
        for (; t >= 256; ) t -= 255;
        return QRMath.EXP_TABLE[t];
      },
      EXP_TABLE: new Array(256),
      LOG_TABLE: new Array(256),
    },
    i = 0;
  i < 8;
  i++
)
  QRMath.EXP_TABLE[i] = 1 << i;
for (i = 8; i < 256; i++) QRMath.EXP_TABLE[i] = QRMath.EXP_TABLE[i - 4] ^ QRMath.EXP_TABLE[i - 5] ^ QRMath.EXP_TABLE[i - 6] ^ QRMath.EXP_TABLE[i - 8];
for (i = 0; i < 255; i++) QRMath.LOG_TABLE[QRMath.EXP_TABLE[i]] = i;
function QRPolynomial(t, e) {
  if (void 0 == t.length) throw new Error(t.length + '/' + e);
  for (var r = 0; r < t.length && 0 == t[r]; ) r++;
  this.num = new Array(t.length - r + e);
  for (var o = 0; o < t.length - r; o++) this.num[o] = t[o + r];
}
function QRRSBlock(t, e) {
  (this.totalCount = t), (this.dataCount = e);
}
function QRBitBuffer() {
  (this.buffer = new Array()), (this.length = 0);
}
function utf16to8(t) {
  var e, r, o, n;
  for (e = '', o = t.length, r = 0; r < o; r++)
    (n = t.charCodeAt(r)) >= 1 && n <= 127
      ? (e += t.charAt(r))
      : n > 2047
      ? ((e += String.fromCharCode(224 | ((n >> 12) & 15))), (e += String.fromCharCode(128 | ((n >> 6) & 63))), (e += String.fromCharCode(128 | ((n >> 0) & 63))))
      : ((e += String.fromCharCode(192 | ((n >> 6) & 31))), (e += String.fromCharCode(128 | ((n >> 0) & 63))));
  return e;
}
function drawQrcode(t) {
  (t = t || {}),
    (t = extend(!0, { width: 256, height: 256, x: 0, y: 0, typeNumber: -1, correctLevel: QRErrorCorrectLevel.H, background: '#ffffff', foreground: '#000000', image: { imageResource: '', dx: 0, dy: 0, dWidth: 100, dHeight: 100 } }, t)).canvasId || t.ctx
      ? (function () {
          var e,
            r = new QRCode(t.typeNumber, t.correctLevel);
          r.addData(utf16to8(t.text)), r.make(), (e = t.ctx ? t.ctx : t._this ? wx.createCanvasContext && wx.createCanvasContext(t.canvasId, t._this) : wx.createCanvasContext && wx.createCanvasContext(t.canvasId));
          for (var o = t.width / r.getModuleCount(), n = t.height / r.getModuleCount(), i = 0; i < r.getModuleCount(); i++)
            for (var a = 0; a < r.getModuleCount(); a++) {
              var s = r.isDark(i, a) ? t.foreground : t.background;
              e.setFillStyle(s);
              var u = Math.ceil((a + 1) * o) - Math.floor(a * o),
                l = Math.ceil((i + 1) * o) - Math.floor(i * o);
              e.fillRect(Math.round(a * o) + t.x, Math.round(i * n) + t.y, u, l);
            }
          t.image.imageResource && e.drawImage(t.image.imageResource, t.image.dx, t.image.dy, t.image.dWidth, t.image.dHeight);
          e.draw(!1, function (e) {
            t.callback && t.callback(e);
          });
        })()
      : console.warn('please set canvasId or ctx!');
}
(QRPolynomial.prototype = {
  get: function (t) {
    return this.num[t];
  },
  getLength: function () {
    return this.num.length;
  },
  multiply: function (t) {
    for (var e = new Array(this.getLength() + t.getLength() - 1), r = 0; r < this.getLength(); r++) for (var o = 0; o < t.getLength(); o++) e[r + o] ^= QRMath.gexp(QRMath.glog(this.get(r)) + QRMath.glog(t.get(o)));
    return new QRPolynomial(e, 0);
  },
  mod: function (t) {
    if (this.getLength() - t.getLength() < 0) return this;
    for (var e = QRMath.glog(this.get(0)) - QRMath.glog(t.get(0)), r = new Array(this.getLength()), o = 0; o < this.getLength(); o++) r[o] = this.get(o);
    for (o = 0; o < t.getLength(); o++) r[o] ^= QRMath.gexp(QRMath.glog(t.get(o)) + e);
    return new QRPolynomial(r, 0).mod(t);
  },
}),
  (QRRSBlock.RS_BLOCK_TABLE = [
    [1, 26, 19],
    [1, 26, 16],
    [1, 26, 13],
    [1, 26, 9],
    [1, 44, 34],
    [1, 44, 28],
    [1, 44, 22],
    [1, 44, 16],
    [1, 70, 55],
    [1, 70, 44],
    [2, 35, 17],
    [2, 35, 13],
    [1, 100, 80],
    [2, 50, 32],
    [2, 50, 24],
    [4, 25, 9],
    [1, 134, 108],
    [2, 67, 43],
    [2, 33, 15, 2, 34, 16],
    [2, 33, 11, 2, 34, 12],
    [2, 86, 68],
    [4, 43, 27],
    [4, 43, 19],
    [4, 43, 15],
    [2, 98, 78],
    [4, 49, 31],
    [2, 32, 14, 4, 33, 15],
    [4, 39, 13, 1, 40, 14],
    [2, 121, 97],
    [2, 60, 38, 2, 61, 39],
    [4, 40, 18, 2, 41, 19],
    [4, 40, 14, 2, 41, 15],
    [2, 146, 116],
    [3, 58, 36, 2, 59, 37],
    [4, 36, 16, 4, 37, 17],
    [4, 36, 12, 4, 37, 13],
    [2, 86, 68, 2, 87, 69],
    [4, 69, 43, 1, 70, 44],
    [6, 43, 19, 2, 44, 20],
    [6, 43, 15, 2, 44, 16],
    [4, 101, 81],
    [1, 80, 50, 4, 81, 51],
    [4, 50, 22, 4, 51, 23],
    [3, 36, 12, 8, 37, 13],
    [2, 116, 92, 2, 117, 93],
    [6, 58, 36, 2, 59, 37],
    [4, 46, 20, 6, 47, 21],
    [7, 42, 14, 4, 43, 15],
    [4, 133, 107],
    [8, 59, 37, 1, 60, 38],
    [8, 44, 20, 4, 45, 21],
    [12, 33, 11, 4, 34, 12],
    [3, 145, 115, 1, 146, 116],
    [4, 64, 40, 5, 65, 41],
    [11, 36, 16, 5, 37, 17],
    [11, 36, 12, 5, 37, 13],
    [5, 109, 87, 1, 110, 88],
    [5, 65, 41, 5, 66, 42],
    [5, 54, 24, 7, 55, 25],
    [11, 36, 12],
    [5, 122, 98, 1, 123, 99],
    [7, 73, 45, 3, 74, 46],
    [15, 43, 19, 2, 44, 20],
    [3, 45, 15, 13, 46, 16],
    [1, 135, 107, 5, 136, 108],
    [10, 74, 46, 1, 75, 47],
    [1, 50, 22, 15, 51, 23],
    [2, 42, 14, 17, 43, 15],
    [5, 150, 120, 1, 151, 121],
    [9, 69, 43, 4, 70, 44],
    [17, 50, 22, 1, 51, 23],
    [2, 42, 14, 19, 43, 15],
    [3, 141, 113, 4, 142, 114],
    [3, 70, 44, 11, 71, 45],
    [17, 47, 21, 4, 48, 22],
    [9, 39, 13, 16, 40, 14],
    [3, 135, 107, 5, 136, 108],
    [3, 67, 41, 13, 68, 42],
    [15, 54, 24, 5, 55, 25],
    [15, 43, 15, 10, 44, 16],
    [4, 144, 116, 4, 145, 117],
    [17, 68, 42],
    [17, 50, 22, 6, 51, 23],
    [19, 46, 16, 6, 47, 17],
    [2, 139, 111, 7, 140, 112],
    [17, 74, 46],
    [7, 54, 24, 16, 55, 25],
    [34, 37, 13],
    [4, 151, 121, 5, 152, 122],
    [4, 75, 47, 14, 76, 48],
    [11, 54, 24, 14, 55, 25],
    [16, 45, 15, 14, 46, 16],
    [6, 147, 117, 4, 148, 118],
    [6, 73, 45, 14, 74, 46],
    [11, 54, 24, 16, 55, 25],
    [30, 46, 16, 2, 47, 17],
    [8, 132, 106, 4, 133, 107],
    [8, 75, 47, 13, 76, 48],
    [7, 54, 24, 22, 55, 25],
    [22, 45, 15, 13, 46, 16],
    [10, 142, 114, 2, 143, 115],
    [19, 74, 46, 4, 75, 47],
    [28, 50, 22, 6, 51, 23],
    [33, 46, 16, 4, 47, 17],
    [8, 152, 122, 4, 153, 123],
    [22, 73, 45, 3, 74, 46],
    [8, 53, 23, 26, 54, 24],
    [12, 45, 15, 28, 46, 16],
    [3, 147, 117, 10, 148, 118],
    [3, 73, 45, 23, 74, 46],
    [4, 54, 24, 31, 55, 25],
    [11, 45, 15, 31, 46, 16],
    [7, 146, 116, 7, 147, 117],
    [21, 73, 45, 7, 74, 46],
    [1, 53, 23, 37, 54, 24],
    [19, 45, 15, 26, 46, 16],
    [5, 145, 115, 10, 146, 116],
    [19, 75, 47, 10, 76, 48],
    [15, 54, 24, 25, 55, 25],
    [23, 45, 15, 25, 46, 16],
    [13, 145, 115, 3, 146, 116],
    [2, 74, 46, 29, 75, 47],
    [42, 54, 24, 1, 55, 25],
    [23, 45, 15, 28, 46, 16],
    [17, 145, 115],
    [10, 74, 46, 23, 75, 47],
    [10, 54, 24, 35, 55, 25],
    [19, 45, 15, 35, 46, 16],
    [17, 145, 115, 1, 146, 116],
    [14, 74, 46, 21, 75, 47],
    [29, 54, 24, 19, 55, 25],
    [11, 45, 15, 46, 46, 16],
    [13, 145, 115, 6, 146, 116],
    [14, 74, 46, 23, 75, 47],
    [44, 54, 24, 7, 55, 25],
    [59, 46, 16, 1, 47, 17],
    [12, 151, 121, 7, 152, 122],
    [12, 75, 47, 26, 76, 48],
    [39, 54, 24, 14, 55, 25],
    [22, 45, 15, 41, 46, 16],
    [6, 151, 121, 14, 152, 122],
    [6, 75, 47, 34, 76, 48],
    [46, 54, 24, 10, 55, 25],
    [2, 45, 15, 64, 46, 16],
    [17, 152, 122, 4, 153, 123],
    [29, 74, 46, 14, 75, 47],
    [49, 54, 24, 10, 55, 25],
    [24, 45, 15, 46, 46, 16],
    [4, 152, 122, 18, 153, 123],
    [13, 74, 46, 32, 75, 47],
    [48, 54, 24, 14, 55, 25],
    [42, 45, 15, 32, 46, 16],
    [20, 147, 117, 4, 148, 118],
    [40, 75, 47, 7, 76, 48],
    [43, 54, 24, 22, 55, 25],
    [10, 45, 15, 67, 46, 16],
    [19, 148, 118, 6, 149, 119],
    [18, 75, 47, 31, 76, 48],
    [34, 54, 24, 34, 55, 25],
    [20, 45, 15, 61, 46, 16],
  ]),
  (QRRSBlock.getRSBlocks = function (t, e) {
    var r = QRRSBlock.getRsBlockTable(t, e);
    if (void 0 == r) throw new Error('bad rs block @ typeNumber:' + t + '/errorCorrectLevel:' + e);
    for (var o = r.length / 3, n = new Array(), i = 0; i < o; i++) for (var a = r[3 * i + 0], s = r[3 * i + 1], u = r[3 * i + 2], l = 0; l < a; l++) n.push(new QRRSBlock(s, u));
    return n;
  }),
  (QRRSBlock.getRsBlockTable = function (t, e) {
    switch (e) {
      case QRErrorCorrectLevel.L:
        return QRRSBlock.RS_BLOCK_TABLE[4 * (t - 1) + 0];
      case QRErrorCorrectLevel.M:
        return QRRSBlock.RS_BLOCK_TABLE[4 * (t - 1) + 1];
      case QRErrorCorrectLevel.Q:
        return QRRSBlock.RS_BLOCK_TABLE[4 * (t - 1) + 2];
      case QRErrorCorrectLevel.H:
        return QRRSBlock.RS_BLOCK_TABLE[4 * (t - 1) + 3];
      default:
        return;
    }
  }),
  (QRBitBuffer.prototype = {
    get: function (t) {
      var e = Math.floor(t / 8);
      return 1 == ((this.buffer[e] >>> (7 - (t % 8))) & 1);
    },
    put: function (t, e) {
      for (var r = 0; r < e; r++) this.putBit(1 == ((t >>> (e - r - 1)) & 1));
    },
    getLengthInBits: function () {
      return this.length;
    },
    putBit: function (t) {
      var e = Math.floor(this.length / 8);
      this.buffer.length <= e && this.buffer.push(0), t && (this.buffer[e] |= 128 >>> this.length % 8), this.length++;
    },
  });
export default drawQrcode;

本文来自互联网用户投稿，该文观点仅代表作者本人，不代表本站立场。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如若转载，请注明出处：http://www.mfbz.cn/a/195597.html

如若内容造成侵权/违法违规/事实不符，请联系我们进行投诉反馈qq邮箱809451989@qq.com，一经查实，立即删除！

相关文章

Transformers实战——文本相似度

Transformers实战——文本相似度

文章目录 一、改写文本分类1.导入相关包2.加载数据集3.划分数据集4.数据集预处理5.创建模型6.创建评估函数7.创建 TrainingArguments8.创建 Trainer9.模型训练10.模型评估11.模型预测 二、交互/单塔模式1.导入相关包2.加载数据集3.划分数据集4.数据集预处理5.创建模型&#xff…
阅读更多...
机器学习的复习笔记2-回归

机器学习的复习笔记2-回归

一、什么是回归 机器学习中的回归是一种预测性分析任务&#xff0c;旨在找出因变量&#xff08;目标变量&#xff09;和自变量&#xff08;预测变量&#xff09;之间的关系。与分类问题不同&#xff0c;回归问题关注的是预测连续型或数值型数据&#xff0c;如温度、年龄、薪水…
阅读更多...
springboot自定义更换启动banner动画

springboot自定义更换启动banner动画

springboot自定义更换启动banner动画 文章目录 springboot自定义更换启动banner动画 &#x1f4d5;1.新建banner&#x1f5a5;️2.启动项目&#x1f516;3.自动生成工具&#x1f9e3;4.彩蛋 &#x1f58a;️最后总结 &#x1f4d5;1.新建banner 在resources中新建banner.txt文…
阅读更多...
数智赋能 锦江汽车携手苏州金龙打造高质量盛会服务

数智赋能 锦江汽车携手苏州金龙打造高质量盛会服务

作为一家老牌客运公司&#xff0c;成立于1956年的上海锦江汽车服务有限公司&#xff08;以下简称锦江汽车&#xff09;&#xff0c;拥有1200多辆大巴和5000多辆轿车&#xff0c;是上海乃至长三角地区规模最大的专业旅游客运公司。面对客运市场的持续萎缩&#xff0c;锦江汽车坚…
阅读更多...
打破TikTok信息壁垒：东南亚达人不实名就封小黄车？跨境新店考核规则更改！

打破TikTok信息壁垒：东南亚达人不实名就封小黄车？跨境新店考核规则更改！

近期&#xff0c;TKFFF得到一个模糊消息&#xff0c;不保真但是个合规的趋势&#xff0c;分享给大家&#xff01; 目前泰国已落实达人实名制&#xff0c;11月底或者12月底之前可能东南亚所有达人都需要实名制&#xff0c;后期也会同步到全球。 如果达人不实名&#xff0c;会被…
阅读更多...
蓝桥杯-平方和（599）

蓝桥杯-平方和（599）

【题目】平方和 【通过测试】代码 import java.util.Scanner; import java.util.ArrayList; import java.util.List; // 1:无需package // 2: 类名必须Main, 不可修改public class Main {public static void main(String[] args) {Scanner scan new Scanner(System.in);//在此…
阅读更多...
有哪些可信的SSL证书颁发机构？

有哪些可信的SSL证书颁发机构？

目前市面上所显示的SSL证书颁发机构可所谓不计其数&#xff0c;类型也是多样&#xff0c;就好比我们同样是买一件T恤&#xff0c;却有百家不同类型的店铺一个道理。根据CA里面看似很多&#xff0c;但能拿到99%浏览器及设备信任度的寥寥无几&#xff0c;下面小编整理出几家靠谱可…
阅读更多...
【substance painter】如何制作一个生锈磨损的枪

【substance painter】如何制作一个生锈磨损的枪

&#x1f468;‍&#x1f4bb;个人主页&#xff1a;元宇宙-秩沅 &#x1f468;‍&#x1f4bb; hallo 欢迎 点赞&#x1f44d; 收藏⭐ 留言&#x1f4dd; 加关注✅! &#x1f468;‍&#x1f4bb; 本文由 秩沅 原创 &#x1f468;‍&#x1f4bb; 收录于专栏&#xff1a;Uni…
阅读更多...
提升企业文档处理效率，尽在Readiris PDF Corporate下载

提升企业文档处理效率，尽在Readiris PDF Corporate下载

在现代企业中&#xff0c;大量的文档处理工作是不可避免的。然而&#xff0c;传统的文档处理方法往往效率低下&#xff0c;浪费了企业宝贵的时间和资源。为了帮助企业提升文档处理效率&#xff0c;我们推荐使用Readiris PDF Corporate软件。 Readiris PDF Corporate是一款功能…
阅读更多...
UE4/UE5 雾

UE4/UE5 雾

雾 UE4/UE5 雾平面雾材质效果图&#xff1a; 3D雾区材质效果图&#xff1a; UE4/UE5 雾 平面雾 做好将材质放在Plane上就行 材质 效果图&#xff1a; 3D雾区 做好将材质放在3D模型上就行 材质 效果图&#xff1a;
阅读更多...
反转链表的三种写法

反转链表的三种写法

题目链接&#xff1a;https://leetcode.cn/problems/reverse-linked-list/ 方法一&#xff1a;循环&#xff0c;维护好两个节点一个前一个后 class Solution {public ListNode reverseList(ListNode head) {ListNode pre null;ListNode local head;while(local ! null){List…
阅读更多...
信奥编程 1168：大整数加法

信奥编程 1168：大整数加法

解析&#xff1a;在c中需要考虑这么几个问题&#xff0c;第一个是大数据的输入&#xff0c;第二个是大数据的存储&#xff0c;第三是大数据的计算方式&#xff0c;最后是输出。 针对上述几个问题&#xff0c;第一个问题&#xff0c;采用字符串的方式或者数组加循环的方式接收输…
阅读更多...
Typora+PicGo+Minio搭建博客图床

Typora+PicGo+Minio搭建博客图床

文章目录 TyporaPicGoMinio搭建博客图床前言什么是图床?为什么需要图床?准备工作一、Typora二、Picgo1. 下载Picgo2. 下载node.js3. 下载minio插件 三、服务器端配置1. 添加端口到安全组2. 使用Docker安装minio3. 配置minio image-20231127175530696四、minio插件配置五、Typ…
阅读更多...
c++_继承

c++_继承

&#x1f3f7;如被何实现一个不能被继承的类&#xff08;或是继承无意义的类&#xff09; 将构造函数定义成私有的就行了&#xff0c;即&#xff1a;私有化父类的构造函数 c 11 新增关键字final 修饰父类直接不能被继承 class A final {........ }&#x1f3f7;继承与有元 有…
阅读更多...
Vue CLI 初体验之如何创建一个项目并打开，以及组件的简单使用案例。

Vue CLI 初体验之如何创建一个项目并打开，以及组件的简单使用案例。

目录 什么是Vue CLI? 如何使用Vue CLI 创建一个项目 1.winr 打开cmd 输入vue create 1127(1127是文件名) 2.配置基础设置 选择Manually select features 选择Router和Vuex 选中vue版本&#xff08;我这里选vue3&#xff09; 剩下的看自己需要&#xff0c;如果不确定就一…
阅读更多...
zabbix 6.0 原理与部署

zabbix 6.0 原理与部署

一、zabbix简介&#xff1a; zabbix 是一个基于 Web 界面的提供分布式系统监视以及网络监视功能的企业级的开源解决方案。 zabbix 能监视各种网络参数&#xff0c;保证服务器系统的安全运营&#xff1b;并提供灵活的通知机制以让系统管理员快速定位/解决存在的各种问题。 zabbi…
阅读更多...
如何迁移数据到水经微图64位版？

如何迁移数据到水经微图64位版？

我们在《为什么要升级水经微图到64位&#xff1f;》一文中&#xff0c;为大家分享了升级水经微图到64位的原因。 这里&#xff0c;我们再为大家分享一下在哪些情况下升级需要迁移已标注的数据&#xff0c;以及如何迁移已标注绘制的数据到水经微图64位中。 哪些情况需要迁移数…
阅读更多...
Vue路由跳转页面刷新

Vue路由跳转页面刷新

案例使用映射路由 百度的时候各种操作就是没有注意keepAlive&#xff0c;发现那个为缓存开启之后前端有个小后台Vue生命周期函数失效。同一个页面刷新时这个keep Alive需要关闭。
阅读更多...
11 OAuth2.0实战：网关统一认证授权

11 OAuth2.0实战：网关统一认证授权

上一节介绍了认证中心，这节介绍下网关如何集成认证中心实现网关的统一认证授权。 木谷博客系统的整个认证授权架构设计如下图： 网关在这里的主要功能就是6-8这三步： 校验token：对令牌的过期时间、签名进行校验鉴权：对令牌的权限进行校验转发：解析令牌中的相关信息，通过…
阅读更多...
Proto3语法详解02

Proto3语法详解02

目录 1.默认值 2.更新消息 2.1更新规则 2.2保留字段reserved 2.2.1创建通讯录3.0版本---验证错误删除字段造成的数据损坏 2.3未知字段 2.3.1未知字段从哪获取 3.3.2升级通讯录3.1版本--验证未知字段 2.4前后兼容性 3.选项option 3.1选项分类 3.2常用选项列举 1.默认值…
阅读更多...
最新文章

Copyright @ 2022~2023

友情链接： 我的编程经验分享 一条长河网 尧图网站开发 尧图建网站