demo文件目录

index.js文件

//index.js
var wxbarcode = require('../../utils/index.js');Page({data: {code: 'https://www.baidu.com/s?wd=%E6%A1%A3%E6%A1%88&rsv_spt=1&rsv_iqid=0xb7b9fdca000a183f&issp=1&f=3&rsv_bp=0&rsv_idx=2&ie=utf-8&tn=baiduhome_pg&rsv_enter=1&rsv_sug3=1&rsv_sug1=1&rsv_sug7=001&rsv_sug2=1&rsp=0&rsv_sug9=es_2_1&rsv_sug4=1457&rsv_sug=6'},onLoad: function () {wxbarcode.barcode('barcode', '123456799', 680, 200);wxbarcode.qrcode('qrcode', 'https://www.baidu.com/s?wd=%E6%A1%A3%E6%A1%88&rsv_spt=1&rsv_iqid=0xb7b9fdca000a183f&issp=1&f=3&rsv_bp=0&rsv_idx=2&ie=utf-8&tn=baiduhome_pg&rsv_enter=1&rsv_sug3=1&rsv_sug1=1&rsv_sug7=001&rsv_sug2=1&rsp=0&rsv_sug9=es_2_1&rsv_sug4=1457&rsv_sug=6', 420, 420);}
})

index.wxml文件

<!--index.wxml-->
<view class="container page"><view class="panel"><view class="header"></view><view class="barcode"><view class="barnum">{{code}}</view><canvas canvas-id="barcode" /></view><view class="qrcode"><canvas canvas-id="qrcode" /></view></view>
</view>

index.wxss文件

/**index.wxss**/
page {background-color: #439057;
}.page {display: flex;flex-direction: column;justify-content: center;align-items: center;
}.container {padding-bottom: 10rpx;
}.panel {display: flex;flex-direction: column;justify-content: space-between;align-items: stretch;box-sizing: border-box;width: 710rpx;margin-top: 40rpx;border-radius: 10rpx;background-color: #fff;
}.header {height: 140rpx;background-color: #f0f0f0;border-radius: 10rpx 10rpx 0 0;
}.barcode {display: flex;height: 320rpx;flex-direction: column;justify-content: center;align-items: center;
}.barnum {width: 670rpx;height: 100rpx;line-height: 100rpx;font-size: 38rpx;font-weight: bold;text-align: center;letter-spacing: 10rpx;white-space: nowrap;
}.barcode > canvas {width: 680rpx;height: 200rpx;
}.qrcode {height: 420rpx;display: flex;flex-direction: column;justify-content: flex-end;align-items: center;
}.qrcode > canvas {width: 420rpx;height: 420rpx;
}

接下来是重点!

utils文件

barcode.js文件生成条形码

var CHAR_TILDE = 126;
var CODE_FNC1 = 102;var SET_STARTA = 103;
var SET_STARTB = 104;
var SET_STARTC = 105;
var SET_SHIFT = 98;
var SET_CODEA = 101;
var SET_CODEB = 100;
var SET_STOP = 106;var REPLACE_CODES = {CHAR_TILDE: CODE_FNC1 //~ corresponds to FNC1 in GS1-128 standard
}var CODESET = {ANY: 1,AB: 2,A: 3,B: 4,C: 5
};function getBytes(str) {var bytes = [];for (var i = 0; i < str.length; i++) {bytes.push(str.charCodeAt(i));}return bytes;
}exports.code128 = function (ctx, text, width, height) {width = parseInt(width);height = parseInt(height);var codes = stringToCode128(text);var g = new Graphics(ctx, width, height);var barWeight = g.area.width / ((codes.length - 3) * 11 + 35);var x = g.area.left;var y = g.area.top;for (var i = 0; i < codes.length; i++) {var c = codes[i];//two bars at a time: 1 black and 1 whitefor (var bar = 0; bar < 8; bar += 2) {var barW = PATTERNS[c][bar] * barWeight;// var barH = height - y - this.border;var barH = height - y;var spcW = PATTERNS[c][bar + 1] * barWeight;//no need to draw if 0 widthif (barW > 0) {g.fillFgRect(x, y, barW, barH);}x += barW + spcW;}}ctx.draw();
}function stringToCode128(text) {var barc = {currcs: CODESET.C};var bytes = getBytes(text);//decide starting codesetvar index = bytes[0] == CHAR_TILDE ? 1 : 0;var csa1 = bytes.length > 0 ? codeSetAllowedFor(bytes[index++]) : CODESET.AB;var csa2 = bytes.length > 0 ? codeSetAllowedFor(bytes[index++]) : CODESET.AB;barc.currcs = getBestStartSet(csa1, csa2);barc.currcs = perhapsCodeC(bytes, barc.currcs);//if no codeset changes this will end up with bytes.length+3//start, checksum and stopvar codes = new Array();switch (barc.currcs) {case CODESET.A:codes.push(SET_STARTA);break;case CODESET.B:codes.push(SET_STARTB);break;default:codes.push(SET_STARTC);break;}for (var i = 0; i < bytes.length; i++) {var b1 = bytes[i]; //get the first of a pair//should we translate/replaceif (b1 in REPLACE_CODES) {codes.push(REPLACE_CODES[b1]);i++ //jump to nextb1 = bytes[i];}//get the next in the pair if possiblevar b2 = bytes.length > (i + 1) ? bytes[i + 1] : -1;codes = codes.concat(codesForChar(b1, b2, barc.currcs));//code C takes 2 chars each timeif (barc.currcs == CODESET.C) i++;}//calculate checksum according to Code 128 standardsvar checksum = codes[0];for (var weight = 1; weight < codes.length; weight++) {checksum += (weight * codes[weight]);}codes.push(checksum % 103);codes.push(SET_STOP);//encoding should now be completereturn codes;function getBestStartSet(csa1, csa2) {//tries to figure out the best codeset//to start with to get the most compact codevar vote = 0;vote += csa1 == CODESET.A ? 1 : 0;vote += csa1 == CODESET.B ? -1 : 0;vote += csa2 == CODESET.A ? 1 : 0;vote += csa2 == CODESET.B ? -1 : 0;//tie goes to B due to my own predudicesreturn vote > 0 ? CODESET.A : CODESET.B;}function perhapsCodeC(bytes, codeset) {for (var i = 0; i < bytes.length; i++) {var b = bytes[i]if ((b < 48 || b > 57) && b != CHAR_TILDE)return codeset;}return CODESET.C;}//chr1 is current byte//chr2 is the next byte to process. looks ahead.function codesForChar(chr1, chr2, currcs) {var result = [];var shifter = -1;if (charCompatible(chr1, currcs)) {if (currcs == CODESET.C) {if (chr2 == -1) {shifter = SET_CODEB;currcs = CODESET.B;}else if ((chr2 != -1) && !charCompatible(chr2, currcs)) {//need to check ahead as wellif (charCompatible(chr2, CODESET.A)) {shifter = SET_CODEA;currcs = CODESET.A;}else {shifter = SET_CODEB;currcs = CODESET.B;}}}}else {//if there is a next char AND that next char is also not compatibleif ((chr2 != -1) && !charCompatible(chr2, currcs)) {//need to switch code setsswitch (currcs) {case CODESET.A:shifter = SET_CODEB;currcs = CODESET.B;break;case CODESET.B:shifter = SET_CODEA;currcs = CODESET.A;break;}}else {//no need to shift code sets, a temporary SHIFT will sufficeshifter = SET_SHIFT;}}//ok some type of shift is nessecaryif (shifter != -1) {result.push(shifter);result.push(codeValue(chr1));}else {if (currcs == CODESET.C) {//include next as well
                result.push(codeValue(chr1, chr2));}else {result.push(codeValue(chr1));}}barc.currcs = currcs;return result;}
}//reduce the ascii code to fit into the Code128 char table
function codeValue(chr1, chr2) {if (typeof chr2 == "undefined") {return chr1 >= 32 ? chr1 - 32 : chr1 + 64;}else {return parseInt(String.fromCharCode(chr1) + String.fromCharCode(chr2));}
}function charCompatible(chr, codeset) {var csa = codeSetAllowedFor(chr);if (csa == CODESET.ANY) return true;//if we need to change from currentif (csa == CODESET.AB) return true;if (csa == CODESET.A && codeset == CODESET.A) return true;if (csa == CODESET.B && codeset == CODESET.B) return true;return false;
}function codeSetAllowedFor(chr) {if (chr >= 48 && chr <= 57) {//0-9return CODESET.ANY;}else if (chr >= 32 && chr <= 95) {//0-9 A-Zreturn CODESET.AB;}else {//if non printablereturn chr < 32 ? CODESET.A : CODESET.B;}
}var Graphics = function(ctx, width, height) {this.width = width;this.height = height;this.quiet = Math.round(this.width / 40);this.border_size   = 0;this.padding_width = 0;this.area = {width : width - this.padding_width * 2 - this.quiet * 2,height: height - this.border_size * 2,top   : this.border_size - 4,left  : this.padding_width + this.quiet};this.ctx = ctx;this.fg = "#000000";this.bg = "#ffffff";// fill backgroundthis.fillBgRect(0,0, width, height);// fill center to create borderthis.fillBgRect(0, this.border_size, width, height - this.border_size * 2);
}//use native color
Graphics.prototype._fillRect = function(x, y, width, height, color) {this.ctx.setFillStyle(color)this.ctx.fillRect(x, y, width, height)
}Graphics.prototype.fillFgRect = function(x,y, width, height) {this._fillRect(x, y, width, height, this.fg);
}Graphics.prototype.fillBgRect = function(x,y, width, height) {this._fillRect(x, y, width, height, this.bg);
}var PATTERNS = [[2, 1, 2, 2, 2, 2, 0, 0],  // 0[2, 2, 2, 1, 2, 2, 0, 0],  // 1[2, 2, 2, 2, 2, 1, 0, 0],  // 2[1, 2, 1, 2, 2, 3, 0, 0],  // 3[1, 2, 1, 3, 2, 2, 0, 0],  // 4[1, 3, 1, 2, 2, 2, 0, 0],  // 5[1, 2, 2, 2, 1, 3, 0, 0],  // 6[1, 2, 2, 3, 1, 2, 0, 0],  // 7[1, 3, 2, 2, 1, 2, 0, 0],  // 8[2, 2, 1, 2, 1, 3, 0, 0],  // 9[2, 2, 1, 3, 1, 2, 0, 0],  // 10[2, 3, 1, 2, 1, 2, 0, 0],  // 11[1, 1, 2, 2, 3, 2, 0, 0],  // 12[1, 2, 2, 1, 3, 2, 0, 0],  // 13[1, 2, 2, 2, 3, 1, 0, 0],  // 14[1, 1, 3, 2, 2, 2, 0, 0],  // 15[1, 2, 3, 1, 2, 2, 0, 0],  // 16[1, 2, 3, 2, 2, 1, 0, 0],  // 17[2, 2, 3, 2, 1, 1, 0, 0],  // 18[2, 2, 1, 1, 3, 2, 0, 0],  // 19[2, 2, 1, 2, 3, 1, 0, 0],  // 20[2, 1, 3, 2, 1, 2, 0, 0],  // 21[2, 2, 3, 1, 1, 2, 0, 0],  // 22[3, 1, 2, 1, 3, 1, 0, 0],  // 23[3, 1, 1, 2, 2, 2, 0, 0],  // 24[3, 2, 1, 1, 2, 2, 0, 0],  // 25[3, 2, 1, 2, 2, 1, 0, 0],  // 26[3, 1, 2, 2, 1, 2, 0, 0],  // 27[3, 2, 2, 1, 1, 2, 0, 0],  // 28[3, 2, 2, 2, 1, 1, 0, 0],  // 29[2, 1, 2, 1, 2, 3, 0, 0],  // 30[2, 1, 2, 3, 2, 1, 0, 0],  // 31[2, 3, 2, 1, 2, 1, 0, 0],  // 32[1, 1, 1, 3, 2, 3, 0, 0],  // 33[1, 3, 1, 1, 2, 3, 0, 0],  // 34[1, 3, 1, 3, 2, 1, 0, 0],  // 35[1, 1, 2, 3, 1, 3, 0, 0],  // 36[1, 3, 2, 1, 1, 3, 0, 0],  // 37[1, 3, 2, 3, 1, 1, 0, 0],  // 38[2, 1, 1, 3, 1, 3, 0, 0],  // 39[2, 3, 1, 1, 1, 3, 0, 0],  // 40[2, 3, 1, 3, 1, 1, 0, 0],  // 41[1, 1, 2, 1, 3, 3, 0, 0],  // 42[1, 1, 2, 3, 3, 1, 0, 0],  // 43[1, 3, 2, 1, 3, 1, 0, 0],  // 44[1, 1, 3, 1, 2, 3, 0, 0],  // 45[1, 1, 3, 3, 2, 1, 0, 0],  // 46[1, 3, 3, 1, 2, 1, 0, 0],  // 47[3, 1, 3, 1, 2, 1, 0, 0],  // 48[2, 1, 1, 3, 3, 1, 0, 0],  // 49[2, 3, 1, 1, 3, 1, 0, 0],  // 50[2, 1, 3, 1, 1, 3, 0, 0],  // 51[2, 1, 3, 3, 1, 1, 0, 0],  // 52[2, 1, 3, 1, 3, 1, 0, 0],  // 53[3, 1, 1, 1, 2, 3, 0, 0],  // 54[3, 1, 1, 3, 2, 1, 0, 0],  // 55[3, 3, 1, 1, 2, 1, 0, 0],  // 56[3, 1, 2, 1, 1, 3, 0, 0],  // 57[3, 1, 2, 3, 1, 1, 0, 0],  // 58[3, 3, 2, 1, 1, 1, 0, 0],  // 59[3, 1, 4, 1, 1, 1, 0, 0],  // 60[2, 2, 1, 4, 1, 1, 0, 0],  // 61[4, 3, 1, 1, 1, 1, 0, 0],  // 62[1, 1, 1, 2, 2, 4, 0, 0],  // 63[1, 1, 1, 4, 2, 2, 0, 0],  // 64[1, 2, 1, 1, 2, 4, 0, 0],  // 65[1, 2, 1, 4, 2, 1, 0, 0],  // 66[1, 4, 1, 1, 2, 2, 0, 0],  // 67[1, 4, 1, 2, 2, 1, 0, 0],  // 68[1, 1, 2, 2, 1, 4, 0, 0],  // 69[1, 1, 2, 4, 1, 2, 0, 0],  // 70[1, 2, 2, 1, 1, 4, 0, 0],  // 71[1, 2, 2, 4, 1, 1, 0, 0],  // 72[1, 4, 2, 1, 1, 2, 0, 0],  // 73[1, 4, 2, 2, 1, 1, 0, 0],  // 74[2, 4, 1, 2, 1, 1, 0, 0],  // 75[2, 2, 1, 1, 1, 4, 0, 0],  // 76[4, 1, 3, 1, 1, 1, 0, 0],  // 77[2, 4, 1, 1, 1, 2, 0, 0],  // 78[1, 3, 4, 1, 1, 1, 0, 0],  // 79[1, 1, 1, 2, 4, 2, 0, 0],  // 80[1, 2, 1, 1, 4, 2, 0, 0],  // 81[1, 2, 1, 2, 4, 1, 0, 0],  // 82[1, 1, 4, 2, 1, 2, 0, 0],  // 83[1, 2, 4, 1, 1, 2, 0, 0],  // 84[1, 2, 4, 2, 1, 1, 0, 0],  // 85[4, 1, 1, 2, 1, 2, 0, 0],  // 86[4, 2, 1, 1, 1, 2, 0, 0],  // 87[4, 2, 1, 2, 1, 1, 0, 0],  // 88[2, 1, 2, 1, 4, 1, 0, 0],  // 89[2, 1, 4, 1, 2, 1, 0, 0],  // 90[4, 1, 2, 1, 2, 1, 0, 0],  // 91[1, 1, 1, 1, 4, 3, 0, 0],  // 92[1, 1, 1, 3, 4, 1, 0, 0],  // 93[1, 3, 1, 1, 4, 1, 0, 0],  // 94[1, 1, 4, 1, 1, 3, 0, 0],  // 95[1, 1, 4, 3, 1, 1, 0, 0],  // 96[4, 1, 1, 1, 1, 3, 0, 0],  // 97[4, 1, 1, 3, 1, 1, 0, 0],  // 98[1, 1, 3, 1, 4, 1, 0, 0],  // 99[1, 1, 4, 1, 3, 1, 0, 0],  // 100[3, 1, 1, 1, 4, 1, 0, 0],  // 101[4, 1, 1, 1, 3, 1, 0, 0],  // 102[2, 1, 1, 4, 1, 2, 0, 0],  // 103[2, 1, 1, 2, 1, 4, 0, 0],  // 104[2, 1, 1, 2, 3, 2, 0, 0],  // 105[2, 3, 3, 1, 1, 1, 2, 0]   // 106
]

qrcode.js文件生成二维码

var QR = (function () {// alignment patternvar adelta = [0, 11, 15, 19, 23, 27, 31, // force 1 pat16, 18, 20, 22, 24, 26, 28, 20, 22, 24, 24, 26, 28, 28, 22, 24, 24,26, 26, 28, 28, 24, 24, 26, 26, 26, 28, 28, 24, 26, 26, 26, 28, 28];// version blockvar vpat = [0xc94, 0x5bc, 0xa99, 0x4d3, 0xbf6, 0x762, 0x847, 0x60d,0x928, 0xb78, 0x45d, 0xa17, 0x532, 0x9a6, 0x683, 0x8c9,0x7ec, 0xec4, 0x1e1, 0xfab, 0x08e, 0xc1a, 0x33f, 0xd75,0x250, 0x9d5, 0x6f0, 0x8ba, 0x79f, 0xb0b, 0x42e, 0xa64,0x541, 0xc69];// final format bits with mask: level << 3 | maskvar fmtword = [0x77c4, 0x72f3, 0x7daa, 0x789d, 0x662f, 0x6318, 0x6c41, 0x6976,    //L0x5412, 0x5125, 0x5e7c, 0x5b4b, 0x45f9, 0x40ce, 0x4f97, 0x4aa0,    //M0x355f, 0x3068, 0x3f31, 0x3a06, 0x24b4, 0x2183, 0x2eda, 0x2bed,    //Q0x1689, 0x13be, 0x1ce7, 0x19d0, 0x0762, 0x0255, 0x0d0c, 0x083b    //H
    ];// 4 per version: number of blocks 1,2; data width; ecc widthvar eccblocks = [1, 0, 19, 7, 1, 0, 16, 10, 1, 0, 13, 13, 1, 0, 9, 17,1, 0, 34, 10, 1, 0, 28, 16, 1, 0, 22, 22, 1, 0, 16, 28,1, 0, 55, 15, 1, 0, 44, 26, 2, 0, 17, 18, 2, 0, 13, 22,1, 0, 80, 20, 2, 0, 32, 18, 2, 0, 24, 26, 4, 0, 9, 16,1, 0, 108, 26, 2, 0, 43, 24, 2, 2, 15, 18, 2, 2, 11, 22,2, 0, 68, 18, 4, 0, 27, 16, 4, 0, 19, 24, 4, 0, 15, 28,2, 0, 78, 20, 4, 0, 31, 18, 2, 4, 14, 18, 4, 1, 13, 26,2, 0, 97, 24, 2, 2, 38, 22, 4, 2, 18, 22, 4, 2, 14, 26,2, 0, 116, 30, 3, 2, 36, 22, 4, 4, 16, 20, 4, 4, 12, 24,2, 2, 68, 18, 4, 1, 43, 26, 6, 2, 19, 24, 6, 2, 15, 28,4, 0, 81, 20, 1, 4, 50, 30, 4, 4, 22, 28, 3, 8, 12, 24,2, 2, 92, 24, 6, 2, 36, 22, 4, 6, 20, 26, 7, 4, 14, 28,4, 0, 107, 26, 8, 1, 37, 22, 8, 4, 20, 24, 12, 4, 11, 22,3, 1, 115, 30, 4, 5, 40, 24, 11, 5, 16, 20, 11, 5, 12, 24,5, 1, 87, 22, 5, 5, 41, 24, 5, 7, 24, 30, 11, 7, 12, 24,5, 1, 98, 24, 7, 3, 45, 28, 15, 2, 19, 24, 3, 13, 15, 30,1, 5, 107, 28, 10, 1, 46, 28, 1, 15, 22, 28, 2, 17, 14, 28,5, 1, 120, 30, 9, 4, 43, 26, 17, 1, 22, 28, 2, 19, 14, 28,3, 4, 113, 28, 3, 11, 44, 26, 17, 4, 21, 26, 9, 16, 13, 26,3, 5, 107, 28, 3, 13, 41, 26, 15, 5, 24, 30, 15, 10, 15, 28,4, 4, 116, 28, 17, 0, 42, 26, 17, 6, 22, 28, 19, 6, 16, 30,2, 7, 111, 28, 17, 0, 46, 28, 7, 16, 24, 30, 34, 0, 13, 24,4, 5, 121, 30, 4, 14, 47, 28, 11, 14, 24, 30, 16, 14, 15, 30,6, 4, 117, 30, 6, 14, 45, 28, 11, 16, 24, 30, 30, 2, 16, 30,8, 4, 106, 26, 8, 13, 47, 28, 7, 22, 24, 30, 22, 13, 15, 30,10, 2, 114, 28, 19, 4, 46, 28, 28, 6, 22, 28, 33, 4, 16, 30,8, 4, 122, 30, 22, 3, 45, 28, 8, 26, 23, 30, 12, 28, 15, 30,3, 10, 117, 30, 3, 23, 45, 28, 4, 31, 24, 30, 11, 31, 15, 30,7, 7, 116, 30, 21, 7, 45, 28, 1, 37, 23, 30, 19, 26, 15, 30,5, 10, 115, 30, 19, 10, 47, 28, 15, 25, 24, 30, 23, 25, 15, 30,13, 3, 115, 30, 2, 29, 46, 28, 42, 1, 24, 30, 23, 28, 15, 30,17, 0, 115, 30, 10, 23, 46, 28, 10, 35, 24, 30, 19, 35, 15, 30,17, 1, 115, 30, 14, 21, 46, 28, 29, 19, 24, 30, 11, 46, 15, 30,13, 6, 115, 30, 14, 23, 46, 28, 44, 7, 24, 30, 59, 1, 16, 30,12, 7, 121, 30, 12, 26, 47, 28, 39, 14, 24, 30, 22, 41, 15, 30,6, 14, 121, 30, 6, 34, 47, 28, 46, 10, 24, 30, 2, 64, 15, 30,17, 4, 122, 30, 29, 14, 46, 28, 49, 10, 24, 30, 24, 46, 15, 30,4, 18, 122, 30, 13, 32, 46, 28, 48, 14, 24, 30, 42, 32, 15, 30,20, 4, 117, 30, 40, 7, 47, 28, 43, 22, 24, 30, 10, 67, 15, 30,19, 6, 118, 30, 18, 31, 47, 28, 34, 34, 24, 30, 20, 61, 15, 30];// Galois field log tablevar glog = [0xff, 0x00, 0x01, 0x19, 0x02, 0x32, 0x1a, 0xc6, 0x03, 0xdf, 0x33, 0xee, 0x1b, 0x68, 0xc7, 0x4b,0x04, 0x64, 0xe0, 0x0e, 0x34, 0x8d, 0xef, 0x81, 0x1c, 0xc1, 0x69, 0xf8, 0xc8, 0x08, 0x4c, 0x71,0x05, 0x8a, 0x65, 0x2f, 0xe1, 0x24, 0x0f, 0x21, 0x35, 0x93, 0x8e, 0xda, 0xf0, 0x12, 0x82, 0x45,0x1d, 0xb5, 0xc2, 0x7d, 0x6a, 0x27, 0xf9, 0xb9, 0xc9, 0x9a, 0x09, 0x78, 0x4d, 0xe4, 0x72, 0xa6,0x06, 0xbf, 0x8b, 0x62, 0x66, 0xdd, 0x30, 0xfd, 0xe2, 0x98, 0x25, 0xb3, 0x10, 0x91, 0x22, 0x88,0x36, 0xd0, 0x94, 0xce, 0x8f, 0x96, 0xdb, 0xbd, 0xf1, 0xd2, 0x13, 0x5c, 0x83, 0x38, 0x46, 0x40,0x1e, 0x42, 0xb6, 0xa3, 0xc3, 0x48, 0x7e, 0x6e, 0x6b, 0x3a, 0x28, 0x54, 0xfa, 0x85, 0xba, 0x3d,0xca, 0x5e, 0x9b, 0x9f, 0x0a, 0x15, 0x79, 0x2b, 0x4e, 0xd4, 0xe5, 0xac, 0x73, 0xf3, 0xa7, 0x57,0x07, 0x70, 0xc0, 0xf7, 0x8c, 0x80, 0x63, 0x0d, 0x67, 0x4a, 0xde, 0xed, 0x31, 0xc5, 0xfe, 0x18,0xe3, 0xa5, 0x99, 0x77, 0x26, 0xb8, 0xb4, 0x7c, 0x11, 0x44, 0x92, 0xd9, 0x23, 0x20, 0x89, 0x2e,0x37, 0x3f, 0xd1, 0x5b, 0x95, 0xbc, 0xcf, 0xcd, 0x90, 0x87, 0x97, 0xb2, 0xdc, 0xfc, 0xbe, 0x61,0xf2, 0x56, 0xd3, 0xab, 0x14, 0x2a, 0x5d, 0x9e, 0x84, 0x3c, 0x39, 0x53, 0x47, 0x6d, 0x41, 0xa2,0x1f, 0x2d, 0x43, 0xd8, 0xb7, 0x7b, 0xa4, 0x76, 0xc4, 0x17, 0x49, 0xec, 0x7f, 0x0c, 0x6f, 0xf6,0x6c, 0xa1, 0x3b, 0x52, 0x29, 0x9d, 0x55, 0xaa, 0xfb, 0x60, 0x86, 0xb1, 0xbb, 0xcc, 0x3e, 0x5a,0xcb, 0x59, 0x5f, 0xb0, 0x9c, 0xa9, 0xa0, 0x51, 0x0b, 0xf5, 0x16, 0xeb, 0x7a, 0x75, 0x2c, 0xd7,0x4f, 0xae, 0xd5, 0xe9, 0xe6, 0xe7, 0xad, 0xe8, 0x74, 0xd6, 0xf4, 0xea, 0xa8, 0x50, 0x58, 0xaf];// Galios field exponent tablevar gexp = [0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1d, 0x3a, 0x74, 0xe8, 0xcd, 0x87, 0x13, 0x26,0x4c, 0x98, 0x2d, 0x5a, 0xb4, 0x75, 0xea, 0xc9, 0x8f, 0x03, 0x06, 0x0c, 0x18, 0x30, 0x60, 0xc0,0x9d, 0x27, 0x4e, 0x9c, 0x25, 0x4a, 0x94, 0x35, 0x6a, 0xd4, 0xb5, 0x77, 0xee, 0xc1, 0x9f, 0x23,0x46, 0x8c, 0x05, 0x0a, 0x14, 0x28, 0x50, 0xa0, 0x5d, 0xba, 0x69, 0xd2, 0xb9, 0x6f, 0xde, 0xa1,0x5f, 0xbe, 0x61, 0xc2, 0x99, 0x2f, 0x5e, 0xbc, 0x65, 0xca, 0x89, 0x0f, 0x1e, 0x3c, 0x78, 0xf0,0xfd, 0xe7, 0xd3, 0xbb, 0x6b, 0xd6, 0xb1, 0x7f, 0xfe, 0xe1, 0xdf, 0xa3, 0x5b, 0xb6, 0x71, 0xe2,0xd9, 0xaf, 0x43, 0x86, 0x11, 0x22, 0x44, 0x88, 0x0d, 0x1a, 0x34, 0x68, 0xd0, 0xbd, 0x67, 0xce,0x81, 0x1f, 0x3e, 0x7c, 0xf8, 0xed, 0xc7, 0x93, 0x3b, 0x76, 0xec, 0xc5, 0x97, 0x33, 0x66, 0xcc,0x85, 0x17, 0x2e, 0x5c, 0xb8, 0x6d, 0xda, 0xa9, 0x4f, 0x9e, 0x21, 0x42, 0x84, 0x15, 0x2a, 0x54,0xa8, 0x4d, 0x9a, 0x29, 0x52, 0xa4, 0x55, 0xaa, 0x49, 0x92, 0x39, 0x72, 0xe4, 0xd5, 0xb7, 0x73,0xe6, 0xd1, 0xbf, 0x63, 0xc6, 0x91, 0x3f, 0x7e, 0xfc, 0xe5, 0xd7, 0xb3, 0x7b, 0xf6, 0xf1, 0xff,0xe3, 0xdb, 0xab, 0x4b, 0x96, 0x31, 0x62, 0xc4, 0x95, 0x37, 0x6e, 0xdc, 0xa5, 0x57, 0xae, 0x41,0x82, 0x19, 0x32, 0x64, 0xc8, 0x8d, 0x07, 0x0e, 0x1c, 0x38, 0x70, 0xe0, 0xdd, 0xa7, 0x53, 0xa6,0x51, 0xa2, 0x59, 0xb2, 0x79, 0xf2, 0xf9, 0xef, 0xc3, 0x9b, 0x2b, 0x56, 0xac, 0x45, 0x8a, 0x09,0x12, 0x24, 0x48, 0x90, 0x3d, 0x7a, 0xf4, 0xf5, 0xf7, 0xf3, 0xfb, 0xeb, 0xcb, 0x8b, 0x0b, 0x16,0x2c, 0x58, 0xb0, 0x7d, 0xfa, 0xe9, 0xcf, 0x83, 0x1b, 0x36, 0x6c, 0xd8, 0xad, 0x47, 0x8e, 0x00];// Working buffers:// data input and ecc append, image working buffer, fixed part of image, run lengths for badnessvar strinbuf=[], eccbuf=[], qrframe=[], framask=[], rlens=[]; // Control values - width is based on version, last 4 are from table.var version, width, neccblk1, neccblk2, datablkw, eccblkwid;var ecclevel = 2;// set bit to indicate cell in qrframe is immutable.  symmetric around diagonalfunction setmask(x, y){var bt;if (x > y) {bt = x;x = y;y = bt;}// y*y = 1+3+5...bt = y;bt *= y;bt += y;bt >>= 1;bt += x;framask[bt] = 1;}// enter alignment pattern - black to qrframe, white to mask (later black frame merged to mask)function putalign(x, y){var j;qrframe[x + width * y] = 1;for (j = -2; j < 2; j++) {qrframe[(x + j) + width * (y - 2)] = 1;qrframe[(x - 2) + width * (y + j + 1)] = 1;qrframe[(x + 2) + width * (y + j)] = 1;qrframe[(x + j + 1) + width * (y + 2)] = 1;}for (j = 0; j < 2; j++) {setmask(x - 1, y + j);setmask(x + 1, y - j);setmask(x - j, y - 1);setmask(x + j, y + 1);}}//========================================================================// Reed Solomon error correction// exponentiation mod Nfunction modnn(x){while (x >= 255) {x -= 255;x = (x >> 8) + (x & 255);}return x;}var genpoly = [];// Calculate and append ECC data to data block.  Block is in strinbuf, indexes to buffers given.function appendrs(data, dlen, ecbuf, eclen){var i, j, fb;for (i = 0; i < eclen; i++)strinbuf[ecbuf + i] = 0;for (i = 0; i < dlen; i++) {fb = glog[strinbuf[data + i] ^ strinbuf[ecbuf]];if (fb != 255)     /* fb term is non-zero */for (j = 1; j < eclen; j++)strinbuf[ecbuf + j - 1] = strinbuf[ecbuf + j] ^ gexp[modnn(fb + genpoly[eclen - j])];elsefor( j = ecbuf ; j < ecbuf + eclen; j++ )strinbuf[j] = strinbuf[j + 1];strinbuf[ ecbuf + eclen - 1] = fb == 255 ? 0 : gexp[modnn(fb + genpoly[0])];}}//========================================================================// Frame data insert following the path rules// check mask - since symmetrical use half.function ismasked(x, y){var bt;if (x > y) {bt = x;x = y;y = bt;}bt = y;bt += y * y;bt >>= 1;bt += x;return framask[bt];}//========================================================================//  Apply the selected mask out of the 8.function  applymask(m){var x, y, r3x, r3y;switch (m) {case 0:for (y = 0; y < width; y++)for (x = 0; x < width; x++)if (!((x + y) & 1) && !ismasked(x, y))qrframe[x + y * width] ^= 1;break;case 1:for (y = 0; y < width; y++)for (x = 0; x < width; x++)if (!(y & 1) && !ismasked(x, y))qrframe[x + y * width] ^= 1;break;case 2:for (y = 0; y < width; y++)for (r3x = 0, x = 0; x < width; x++, r3x++) {if (r3x == 3)r3x = 0;if (!r3x && !ismasked(x, y))qrframe[x + y * width] ^= 1;}break;case 3:for (r3y = 0, y = 0; y < width; y++, r3y++) {if (r3y == 3)r3y = 0;for (r3x = r3y, x = 0; x < width; x++, r3x++) {if (r3x == 3)r3x = 0;if (!r3x && !ismasked(x, y))qrframe[x + y * width] ^= 1;}}break;case 4:for (y = 0; y < width; y++)for (r3x = 0, r3y = ((y >> 1) & 1), x = 0; x < width; x++, r3x++) {if (r3x == 3) {r3x = 0;r3y = !r3y;}if (!r3y && !ismasked(x, y))qrframe[x + y * width] ^= 1;}break;case 5:for (r3y = 0, y = 0; y < width; y++, r3y++) {if (r3y == 3)r3y = 0;for (r3x = 0, x = 0; x < width; x++, r3x++) {if (r3x == 3)r3x = 0;if (!((x & y & 1) + !(!r3x | !r3y)) && !ismasked(x, y))qrframe[x + y * width] ^= 1;}}break;case 6:for (r3y = 0, y = 0; y < width; y++, r3y++) {if (r3y == 3)r3y = 0;for (r3x = 0, x = 0; x < width; x++, r3x++) {if (r3x == 3)r3x = 0;if (!(((x & y & 1) + (r3x && (r3x == r3y))) & 1) && !ismasked(x, y))qrframe[x + y * width] ^= 1;}}break;case 7:for (r3y = 0, y = 0; y < width; y++, r3y++) {if (r3y == 3)r3y = 0;for (r3x = 0, x = 0; x < width; x++, r3x++) {if (r3x == 3)r3x = 0;if (!(((r3x && (r3x == r3y)) + ((x + y) & 1)) & 1) && !ismasked(x, y))qrframe[x + y * width] ^= 1;}}break;}return;}// Badness coefficients.var N1 = 3, N2 = 3, N3 = 40, N4 = 10;// Using the table of the length of each run, calculate the amount of bad image // - long runs or those that look like finders; called twice, once each for X and Yfunction badruns(length){var i;var runsbad = 0;for (i = 0; i <= length; i++)if (rlens[i] >= 5)runsbad += N1 + rlens[i] - 5;// BwBBBwB as in finderfor (i = 3; i < length - 1; i += 2)if (rlens[i - 2] == rlens[i + 2]&& rlens[i + 2] == rlens[i - 1]&& rlens[i - 1] == rlens[i + 1]&& rlens[i - 1] * 3 == rlens[i]// white around the black pattern? Not part of spec&& (rlens[i - 3] == 0 // beginning|| i + 3 > length  // end|| rlens[i - 3] * 3 >= rlens[i] * 4 || rlens[i + 3] * 3 >= rlens[i] * 4))runsbad += N3;return runsbad;}// Calculate how bad the masked image is - blocks, imbalance, runs, or finders.function badcheck(){var x, y, h, b, b1;var thisbad = 0;var bw = 0;// blocks of same color.for (y = 0; y < width - 1; y++)for (x = 0; x < width - 1; x++)if ((qrframe[x + width * y] && qrframe[(x + 1) + width * y]&& qrframe[x + width * (y + 1)] && qrframe[(x + 1) + width * (y + 1)]) // all black|| !(qrframe[x + width * y] || qrframe[(x + 1) + width * y]|| qrframe[x + width * (y + 1)] || qrframe[(x + 1) + width * (y + 1)])) // all whitethisbad += N2;// X runsfor (y = 0; y < width; y++) {rlens[0] = 0;for (h = b = x = 0; x < width; x++) {if ((b1 = qrframe[x + width * y]) == b)rlens[h]++;elserlens[++h] = 1;b = b1;bw += b ? 1 : -1;}thisbad += badruns(h);}// black/white imbalanceif (bw < 0)bw = -bw;var big = bw;var count = 0;big += big << 2;big <<= 1;while (big > width * width)big -= width * width, count++;thisbad += count * N4;// Y runsfor (x = 0; x < width; x++) {rlens[0] = 0;for (h = b = y = 0; y < width; y++) {if ((b1 = qrframe[x + width * y]) == b)rlens[h]++;elserlens[++h] = 1;b = b1;}thisbad += badruns(h);}return thisbad;}function genframe(instring){var x, y, k, t, v, i, j, m;// find the smallest version that fits the stringt = instring.length;version = 0;do {version++;k = (ecclevel - 1) * 4 + (version - 1) * 16;neccblk1 = eccblocks[k++];neccblk2 = eccblocks[k++];datablkw = eccblocks[k++];eccblkwid = eccblocks[k];k = datablkw * (neccblk1 + neccblk2) + neccblk2 - 3 + (version <= 9);if (t <= k)break;} while (version < 40);// FIXME - insure that it fits insted of being truncatedwidth = 17 + 4 * version;// allocate, clear and setup data structuresv = datablkw + (datablkw + eccblkwid) * (neccblk1 + neccblk2) + neccblk2;for( t = 0; t < v; t++ )eccbuf[t] = 0;strinbuf = instring.slice(0);for( t = 0; t < width * width; t++ )qrframe[t] = 0;for( t = 0 ; t < (width * (width + 1) + 1) / 2; t++)framask[t] = 0;// insert finders - black to frame, white to maskfor (t = 0; t < 3; t++) {k = 0;y = 0;if (t == 1)k = (width - 7);if (t == 2)y = (width - 7);qrframe[(y + 3) + width * (k + 3)] = 1;for (x = 0; x < 6; x++) {qrframe[(y + x) + width * k] = 1;qrframe[y + width * (k + x + 1)] = 1;qrframe[(y + 6) + width * (k + x)] = 1;qrframe[(y + x + 1) + width * (k + 6)] = 1;}for (x = 1; x < 5; x++) {setmask(y + x, k + 1);setmask(y + 1, k + x + 1);setmask(y + 5, k + x);setmask(y + x + 1, k + 5);}for (x = 2; x < 4; x++) {qrframe[(y + x) + width * (k + 2)] = 1;qrframe[(y + 2) + width * (k + x + 1)] = 1;qrframe[(y + 4) + width * (k + x)] = 1;qrframe[(y + x + 1) + width * (k + 4)] = 1;}}// alignment blocksif (version > 1) {t = adelta[version];y = width - 7;for (;;) {x = width - 7;while (x > t - 3) {putalign(x, y);if (x < t)break;x -= t;}if (y <= t + 9)break;y -= t;putalign(6, y);putalign(y, 6);}}// single blackqrframe[8 + width * (width - 8)] = 1;// timing gap - mask onlyfor (y = 0; y < 7; y++) {setmask(7, y);setmask(width - 8, y);setmask(7, y + width - 7);}for (x = 0; x < 8; x++) {setmask(x, 7);setmask(x + width - 8, 7);setmask(x, width - 8);}// reserve mask-format areafor (x = 0; x < 9; x++)setmask(x, 8);for (x = 0; x < 8; x++) {setmask(x + width - 8, 8);setmask(8, x);}for (y = 0; y < 7; y++)setmask(8, y + width - 7);// timing row/colfor (x = 0; x < width - 14; x++)if (x & 1) {setmask(8 + x, 6);setmask(6, 8 + x);}else {qrframe[(8 + x) + width * 6] = 1;qrframe[6 + width * (8 + x)] = 1;}// version blockif (version > 6) {t = vpat[version - 7];k = 17;for (x = 0; x < 6; x++)for (y = 0; y < 3; y++, k--)if (1 & (k > 11 ? version >> (k - 12) : t >> k)) {qrframe[(5 - x) + width * (2 - y + width - 11)] = 1;qrframe[(2 - y + width - 11) + width * (5 - x)] = 1;}else {setmask(5 - x, 2 - y + width - 11);setmask(2 - y + width - 11, 5 - x);}}// sync mask bits - only set above for white spaces, so add in black bitsfor (y = 0; y < width; y++)for (x = 0; x <= y; x++)if (qrframe[x + width * y])setmask(x, y);// convert string to bitstream// 8 bit data to QR-coded 8 bit data (numeric or alphanum, or kanji not supported)v = strinbuf.length;// string to arrayfor( i = 0 ; i < v; i++ )eccbuf[i] = strinbuf.charCodeAt(i);strinbuf = eccbuf.slice(0);// calculate max string lengthx = datablkw * (neccblk1 + neccblk2) + neccblk2;if (v >= x - 2) {v = x - 2;if (version > 9)v--;}// shift and repack to insert length prefixi = v;if (version > 9) {strinbuf[i + 2] = 0;strinbuf[i + 3] = 0;while (i--) {t = strinbuf[i];strinbuf[i + 3] |= 255 & (t << 4);strinbuf[i + 2] = t >> 4;}strinbuf[2] |= 255 & (v << 4);strinbuf[1] = v >> 4;strinbuf[0] = 0x40 | (v >> 12);}else {strinbuf[i + 1] = 0;strinbuf[i + 2] = 0;while (i--) {t = strinbuf[i];strinbuf[i + 2] |= 255 & (t << 4);strinbuf[i + 1] = t >> 4;}strinbuf[1] |= 255 & (v << 4);strinbuf[0] = 0x40 | (v >> 4);}// fill to end with pad patterni = v + 3 - (version < 10);while (i < x) {strinbuf[i++] = 0xec;// buffer has room    if (i == x)      break;strinbuf[i++] = 0x11;}// calculate and append ECC// calculate generator polynomialgenpoly[0] = 1;for (i = 0; i < eccblkwid; i++) {genpoly[i + 1] = 1;for (j = i; j > 0; j--)genpoly[j] = genpoly[j]? genpoly[j - 1] ^ gexp[modnn(glog[genpoly[j]] + i)] : genpoly[j - 1];genpoly[0] = gexp[modnn(glog[genpoly[0]] + i)];}for (i = 0; i <= eccblkwid; i++)genpoly[i] = glog[genpoly[i]]; // use logs for genpoly[] to save calc step// append ecc to data bufferk = x;y = 0;for (i = 0; i < neccblk1; i++) {appendrs(y, datablkw, k, eccblkwid);y += datablkw;k += eccblkwid;}for (i = 0; i < neccblk2; i++) {appendrs(y, datablkw + 1, k, eccblkwid);y += datablkw + 1;k += eccblkwid;}// interleave blocksy = 0;for (i = 0; i < datablkw; i++) {for (j = 0; j < neccblk1; j++)eccbuf[y++] = strinbuf[i + j * datablkw];for (j = 0; j < neccblk2; j++)eccbuf[y++] = strinbuf[(neccblk1 * datablkw) + i + (j * (datablkw + 1))];}for (j = 0; j < neccblk2; j++)eccbuf[y++] = strinbuf[(neccblk1 * datablkw) + i + (j * (datablkw + 1))];for (i = 0; i < eccblkwid; i++)for (j = 0; j < neccblk1 + neccblk2; j++)eccbuf[y++] = strinbuf[x + i + j * eccblkwid];strinbuf = eccbuf;// pack bits into frame avoiding masked area.x = y = width - 1;k = v = 1;         // up, minus/* inteleaved data and ecc codes */m = (datablkw + eccblkwid) * (neccblk1 + neccblk2) + neccblk2;for (i = 0; i < m; i++) {t = strinbuf[i];for (j = 0; j < 8; j++, t <<= 1) {if (0x80 & t)qrframe[x + width * y] = 1;do {        // find next fill positionif (v)x--;else {x++;if (k) {if (y != 0)y--;else {x -= 2;k = !k;if (x == 6) {x--;y = 9;}}}else {if (y != width - 1)y++;else {x -= 2;k = !k;if (x == 6) {x--;y -= 8;}}}}v = !v;} while (ismasked(x, y));}}// save pre-mask copy of framestrinbuf = qrframe.slice(0);t = 0;           // besty = 30000;         // demerit// for instead of while since in original arduino code// if an early mask was "good enough" it wouldn't try for a better one// since they get more complex and take longer.for (k = 0; k < 8; k++) {applymask(k);      // returns black-white imbalancex = badcheck();if (x < y) { // current mask better than previous best?y = x;t = k;}if (t == 7)break;       // don't increment i to a void redoing maskqrframe = strinbuf.slice(0); // reset for next pass
        }if (t != k)         // redo best mask - none good enough, last wasn't t
            applymask(t);// add in final mask/ecclevel bytesy = fmtword[t + ((ecclevel - 1) << 3)];// low bytefor (k = 0; k < 8; k++, y >>= 1)if (y & 1) {qrframe[(width - 1 - k) + width * 8] = 1;if (k < 6)qrframe[8 + width * k] = 1;elseqrframe[8 + width * (k + 1)] = 1;}// high bytefor (k = 0; k < 7; k++, y >>= 1)if (y & 1) {qrframe[8 + width * (width - 7 + k)] = 1;if (k)qrframe[(6 - k) + width * 8] = 1;elseqrframe[7 + width * 8] = 1;}// return imagereturn qrframe;}var _canvas = null,_size = null;var api = {get ecclevel () {return ecclevel;},set ecclevel (val) {ecclevel = val;},get size () {return _size;},set size (val) {_size = val},get canvas () {return _canvas;},set canvas (el) {_canvas = el;},getFrame: function (string) {return genframe(string);},draw: function (string, canvas, size, ecc) {ecclevel = ecc || ecclevel;canvas = canvas || _canvas;if (!canvas) {console.warn('No canvas provided to draw QR code in!')return;}size = size || _size || Math.min(canvas.width, canvas.height);var frame = genframe(string),ctx = canvas.ctx,px = Math.round(size / (width + 8));var roundedSize = px * (width + 8),offset = Math.floor((size - roundedSize) / 2);size = roundedSize;ctx.clearRect(0, 0, canvas.width, canvas.height);ctx.setFillStyle('#000000');for (var i = 0; i < width; i++) {for (var j = 0; j < width; j++) {if (frame[j * width + i]) {ctx.fillRect(px * (4 + i) + offset, px * (4 + j) + offset, px, px);}}}ctx.draw();}}module.exports = {api: api}})()

index.js文件:不是pages文件夹里面的哦,是在utils文件里面新建的index文件,去上面看看文件目录,方便调用生成条形码和二维码两个函数

var barcode = require('./barcode');
var qrcode = require('./qrcode');function convert_length(length) {return Math.round(wx.getSystemInfoSync().windowWidth * length / 750);
}function barc(id, code, width, height) {barcode.code128(wx.createCanvasContext(id), code, convert_length(width), convert_length(height))
}function qrc(id, code, width, height) {qrcode.api.draw(code, {ctx: wx.createCanvasContext(id),width: convert_length(width),height: convert_length(height)})
}module.exports = {barcode: barc,qrcode: qrc
}

参考网址:http://blog.csdn.net/wtdask/article/details/73776356

转载于:https://www.cnblogs.com/chen-lhx/p/8418321.html

微信小程序-携带参数的二维码条形码生成相关推荐

  1. 微信小程序生成携带参数的二维码

    当对需求的时候发现 要完成一个永久二维码直接进入微信小程序的对应页面+对应IID参数 不要慌 这篇文章解决 满足生成需要 微信官方提供生成微信二维码 可满足大部分功能 https://develope ...

  2. 微信小程序生成带参数的二维码以及小程序码

    微信小程序生成带参数的二维码 官方共给了三个接口调用,大家可以根据自己的实际情况来使用,我这里使用的是接口B和接口C. 官方文档地址 业务需求: 扫描二维码进入指定商品页面,需要的参数为商品id(go ...

  3. 微信小程序使用canvas绘制二维码实现跳转小程序

    开始接到这个需求的时候,我查阅文档获取小程序码 | 微信开放文档 发现两种途径 需要后端在服务器上调用接口拿到二维码,因为调用的 https://api.weixin.qq.com这个域名是不允许上白 ...

  4. 微信小程序生成带参数的二维码

    微信小程序生成带参数的二维码 //写一个图片来写路径,好让二维码显示出来 <image style="width:500rpx;height:500rpx;" src=&qu ...

  5. 微信小程序长按识别二维码,小程序相关问题总结

    微信小程序长按识别二维码,小程序相关问题总结 开发小程序中,长按识别二维码,小程序码跳转,已知问题整理: 小程序中,不支持长按识别二维码,和小程序码. 可利用小程序 图片预览功能识别 小程序码并进行跳 ...

  6. 『小程序开发』关于微信小程序扫普通链接二维码打开小程序的具体配置流程...

    前言: 对于扫普通链接二维码打开小程序的功能详解,官方api已经可以说是接近手把手的教学,咱们这里不做累述,直接上图走起...官方接入指南 功能介绍 扫二维码登录小程序...^_^ 限制 1.对于普通 ...

  7. 山东大学项目实训(四)—— 微信小程序扫描web端二维码实现web端登录

    效果 点击登录后,显示二维码→打开"探古"(本项目)微信小程序,扫描二维码确认登录→web端登录成功 主要流程 因为本人主要负责web前端的开发,所以本文仅介绍web前端的实现方法 ...

  8. uniapp 微信小程序长按识别二维码,跳转小程序、个人微信

    前言: 业务要求是小程序放一个二维码图片,长按可以识别二维码,进而识别出个人微信,添加个人微信:我们可以通过uni.previewImage(OBJECT)或者wx.previewImage(Obje ...

  9. 在微信小程序中识别付款二维码

    一.前言 由于微信小程序的规则限制,在小程序内部是无法直接识别二维码的,这样对于想通过微信小程序给微信公众号引流的想法大抵都被扼杀了,偶然间发现微信官方小程序"微保"竟然做到了,而 ...

  10. 【微信小程序使用canvas绘制二维码】

    1,在util文件夹中的common.js //引入 import drawQrcode from './qrcode.min.js'; import draw2dQrcode from './wea ...

最新文章

  1. 反射 -- 通过字符串操作对象中的成员
  2. java 总结几种线程异步转同步的方法
  3. 《网易编程题》下厨房
  4. SQLAlchemy 一些基本操作
  5. vista任务栏透明_增加Windows Vista任务栏预览大小的赏金(付费!)
  6. mysql 免费前端_MySQL
  7. 子网掩码相关教学 子网掩码快速算法 沉睡不醒blog
  8. netscreen 25配置外网到内网的Webserver实践
  9. failed to open stream :HTTP request failed 解决方法
  10. java 静态内部类 内部类_Java中内部类和静态内部类的区别
  11. 利用Python编程,分别使用梯度下降法和最小二乘法求解多元函数
  12. 山东财经大学燕山学院计算机王栋,选修课Photoshop王栋的群谁有
  13. 《机电传动控制》第六周学习笔记
  14. Visual Studio Code 基本操作 - Windows 版
  15. tongweb java_home_中间件 东方通tongweb的使用
  16. 算法:买卖股票最佳时机(c++)
  17. 曙光服务器bios开启vt虚拟化,VT开启教程 BIOS开启VT方法
  18. You have to use a classifier to attach supplemental artifacts to the project instead of replacing th
  19. 无任何编程基础的人,该怎么入门编程?
  20. Tofu Icecream and Tai-chi man

热门文章

  1. 广度(宽度)优先搜索学习笔记
  2. Python 的字符编码
  3. Android异步批量下载图片并缓存
  4. TFS集群间数据迁移任务总结
  5. MySql 安装 Win python3
  6. 多模态中预训练的演变史
  7. 资源过于硬核,8h删!这波福利....请笑纳~
  8. ICML2018对抗生成网络论文评述
  9. 20191202_2_识别偷税漏税人
  10. poj3276(Face The Right Way)反转(开关问题)