微信小程序之条形码和二维码生成

1.首先在utils文件下创建barcode.js,qrcode.js与index.js三个文件

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(chr2));}else {if (currcs == CODESET.C) {//include next as wellresult.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 tapplymask(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代码如下

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, that) {barcode.code128(wx.createCanvasContext(id, that), code, convert_length(width), convert_length(height))
}function qrc(id, code, width, height, that) {qrcode.api.draw(code, {ctx: wx.createCanvasContext(id, that),width: convert_length(width),height: convert_length(height)})
}module.exports = {barcode: barc,qrcode: qrc
}

2.新建page index

index.xml代码如下

<view class="barcode margin-sm"><canvas canvas-id="barcode" /><view class="barnum">{{code}}</view>
</view>
<view class="qrcode margin-sm"><canvas canvas-id="qrcode" />
</view>

index.wxss

.barcode {display: flex;height: 200rpx;flex-direction: column;justify-content: center;align-items: center;
}
.margin-sm {margin:20rpx;
}
.barnum {width: 600rpx;background-color: #FFF;height: 30rpx;line-height: 30rpx;font-size: 34rpx;text-align: center;letter-spacing: 10rpx;white-space: nowrap;
}
.barcode > canvas {width: 600rpx;height: 200rpx;  
}
.qrcode{width: 340rpx;height: 340rpx; 
}

index.js

//引入js文件
const wxbarcode = require('../../utils/index.js');Page({/*** 页面的初始数据*/data: {code: '8744088'},/*** 生命周期函数--监听页面加载*/onLoad: function (options) {//创建条形码wxbarcode.barcode('barcode', 'http://baidu.com', 680, 200); //创建二维码wxbarcode.qrcode('qrcode', 'http://baidu.com', 340, 340);},
})

组件中调用时需传入对象如下所示

 

// pages/home/home.js
const app = new getApp();
import wxbarcode from '../../utils/index.js'
Component({//使用全局css样式options: {addGlobalClass: true,},data:{},lifetimes:{created:function(){//组件实例化,但节点树还未导入,因此这时不能用setData},attached:function(){//节点树完成,可以用setData渲染节点,但无法操作节点},ready:function(){//组件布局完成,这时可以获取节点信息,也可以操作节点this.createdBarcode();},},pageLifetimes:{// 组件所在页面的生命周期声明对象,目前仅支持页面的show和hide两个生命周期show:function(){},},methods:{createdBarcode(){wxbarcode.barcode('barcode', '8744089', 680, 200, this);},}
})

 

效果如图所示

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

如若内容造成侵权/违法违规/事实不符,请联系瞎胡闹网进行投诉反馈,一经查实,立即删除!

相关文章

如何生成二维码?生成二维码其实很简单

如何生成二维码&#xff1f;在日常的工作学习中我们总是会接触到各种各样的二维码&#xff0c;比如支付宝收款码、公众号主页码、广告宣传码等等。有一些二维码我们直接保存就可以&#xff0c;但是有一些二维码却需要我们自己进行制作。下面小编就来给大家分享二维码的生成小程…

微信小程序实现条形码,二维码生成和微信小程序扫码

一&#xff1a;条形码,二维码生成 在微信小程序中生成条形码和二维码需要使用到wxbarcode的npm包&#xff0c;wxbarcode的npm包地址&#xff1a;https://www.npmjs.com/package/wxbarcode 1&#xff1a;安装wxbarcode npm i wxbarcode -S --production 在微信小程序项目中使…

转载:在微信小程序中 生成二维码

目录 转载&#xff1a; weapp-qrcode-canvas-2d 仓库地址 测试环境 使用 安装方法1&#xff1a;直接引入 js 文件 安装方法2&#xff1a;npm安装 安装完成后调用 例子1&#xff1a;没有使用叠加图片 例子2&#xff1a;使用叠加图片(在二维码中加logo) 这里是API dr…

前端生成二维码 微信小程序

1&#xff0c;在微信开发者工具里面引入npm命令“ npm install weapp-qrcode --save ”&#xff1b; 2&#xff0c;将 dist 目录下的weapp.qrcode.esm.js 复制到项目的utils目录中&#xff1b; 3&#xff0c;在所需的index.js页面引入weapp.qrcode文件。并调用drawQrcode()方法…

微信小程序生成自定义参数二维码

微信小程序生成自定义参数二维码 前言实现尾巴 前言 最近项目中要用到二维码分享功能&#xff0c;需要封装一些自定义的参数通过二维码分享。查看官方文档&#xff0c;发现系统提供了生成二维码的功能&#xff0c;但是细看才发现官方提供的接口其实是生成小程序二维码&#xf…

微信小程序内,生成自定义二维码

最近在开发中&#xff0c;需要生成自定义的二维码&#xff0c;于是做了一个包出来&#xff0c;分享给大家一起使用。适用于微信小程序的二维码生成器&#xff0c;基于Canvas生成&#xff0c;支持中文的输入。可在原生小程序&#xff0c;mpvue&#xff0c;taro中使用。&#xff…

微信小程序实战教程1503---生成二维码

在微信小程序中&#xff0c;如果我们可以自己将指定内容生成二维码&#xff0c;出示给别人&#xff0c;将是一个比较有用的功能。但是微信小程序API中&#xff0c;目前暂时还没有这个功能&#xff0c;但是我们可以通过变通的方法&#xff0c;来实现这一功能。 本文所提到的方法…

记一次 Android 源码编译刷机过程

0 背景 为了能在开发设备上运行 adb root 命令得到 root 权限&#xff0c;获得更加强大的调试能力、开发体验&#xff0c;方便以后阅读源码时 Debug 跟踪、进行定制化开发&#xff0c;需要编译 Android 源码 userdebug 版本并刷入手机当中。 1 准备 1.1 硬盘 首先 Android 源…

JavaScript 基础 DOM (四)

正则表达式正则表达式 正则基本使用 定义规则 const reg /表达式/其中/ /是正则表达式字面量正则表达式也是对象 使用正则 test()方法 用来查看正则表达式与指定的字符串是否匹配 如果正则表达式与指定的字符串匹配 &#xff0c;返回true&#xff0c;否则false reg.test(…

苹果id怎么注册?老果粉教你创建新的Apple ID

苹果ID怎么注册&#xff1f;苹果ID又叫做Apple ID&#xff0c;这是我们用来访问Apple服务的账号&#xff0c;包括iCloud、App Store在内的苹果手机自带应用都需要我们登陆Apple ID才可以正常使用。该账号不仅仅只是一个登录账号&#xff0c;其中包含了我们大量的隐私信息&#…

如何重新设置苹果id密码_ios游戏apple账号分享韩国苹果id密码大全

韩区id申请注册流程和在国内申请注册账号流程不一样&#xff0c;所选地区和填写信息要求不一样&#xff0c;现在很多游戏或者其他软件只能在日本地区发行&#xff0c;想要下载这些软件就必须要注册日本地区的id账号就能下载。 申请注册韩区id除了要注意选择地区之外&#xff0c…

苹果注册会员账号

下面介绍个人开发者账号申请流程 1.1首先打开苹果开发者中心 如果已经注册过apple id&#xff0c;跳过注册&#xff0c;直接看后面步骤登录开发者中心申请&#xff01; 点击立即创建您的apple id 2、跳转到apple id申请页面填写相关信息 名字用汉字或者拼音写上去&#xff08;注…

苹果开发者公司账号注册流程注册新的苹果Apple Id并双重验证步骤

大概分为几个步骤&#xff1a; 1.需要一个未注册过开发者的苹果Apple Id &#xff08;如果没有重新注册详见下文&#xff09; 2.Apple Id需要开通双重验证 &#xff08;详见下文&#xff09; 3.申请公司的邓白氏码 申请流程&#xff1a;https://www.jianshu.com/p/31b7aa616…

Apple ID 的申请流程

Apple ID 申请可以在通过PC端申请也可以在IOS系统的手机上申请。本节就说说在PC端的申请流程。 1、打开苹果帐户注册网站&#xff1a;appleid.apple.com/cn&#xff0c;然后点击右上角的“创建 Apple ID” 2、按照提示填写对应的信息 回答的问题注意字符要大于等于3 然后…

苹果礼品卡导致Apple ID被封,怎么避免?

下载外区的苹果App常常需要买外区对应国家的礼品卡&#xff0c;尤其是玩游戏&#xff0c;我们游戏工会里面时不时有人的Apple ID被封&#xff0c;经历多了经验也就慢慢丰富了&#xff0c;后来在群里就专门强调几点注意事项&#xff0c;经过一年验证完全有效&#xff0c;基本上杜…

此apple id尚未用于App Store(如需帮助,请联系iTunes支持,网址www.apple.com/support/itunes/ww/)

使用MacBook Pro做开发&#xff0c;结果新注册的Apple ID在登录App Store的时候出现此apple id尚未用于App Store 填写相关信息时出现如需帮助&#xff0c;请联系iTunes支持&#xff0c;网址www.apple.com/support/itunes/ww/&#xff0c;如图&#xff1a; 解决办法&#x…

最新Apple苹果开发者账号AppleID注册流程

1、登陆开发者官网&#xff1a; https://developer.apple.com/ 2、如果有苹果设备&#xff0c;可以直接使用你设备的appleID&#xff0c;后面的步骤一样的&#xff0c;这是少了这个注册过程。下面说说没有appleID的注册流程。 点击开发者官网右上角account,进入开发者登陆页…

python加密算法

首先加密算法要引入hashlib模块&#xff0c;在python中用import hashlib引入 接下来如果要对一串数字进行加密操作如下 这里用a变量来接接收&#xff0c;md5里的数字就是要加密的内容 然后再内容后面加上.encode&#xff08;“utf-8”&#xff09;因为hashlib是对二进制进行…

python 代码加密

Python代码加密步骤 1、准备文件 main.py为要加密的主脚本import sys from PyQt5.QtWidgets import QApplication, QWidgetdef show_w():显示窗口app QApplication(sys.argv) # 所有的PyQt5应用必须创建一个应用&#xff08;Application&#xff09;对象。# sys.argv参数是一个…

python 加密-对exe加密

Python 是一种面向对象的解释型计算机程序设计语言&#xff0c;Python 语言写的程序不需要编译成二进制代码&#xff0c;可以直接从源代码运行程序。 在计算机内部&#xff0c;Python解释器把源代码转换成称为字节的中间形式&#xff0c;然后再它翻译计算机使用的机器语言并运行…