1.封装好的QRcode的js文件
!function() {
function r(r, o) {
var f;
r > o && (f = r, r = o, o = f), f = o, f *= o, f += o, f >>= 1, p[f += r] = 1;
}
function o(o, f) {
var e;
for (F[o + l * f] = 1, e = -2; e < 2; e++) F[o + e + l * (f - 2)] = 1, F[o - 2 + l * (f + e + 1)] = 1,
F[o + 2 + l * (f + e)] = 1, F[o + e + 1 + l * (f + 2)] = 1;
for (e = 0; e < 2; e++) r(o - 1, f + e), r(o + 1, f - e), r(o - e, f - 1), r(o + e, f + 1);
}
function f(r) {
for (;r >= 255; ) r = ((r -= 255) >> 8) + (255 & r);
return r;
}
function e(r, o, e, t) {
var a, n, i;
for (a = 0; a < t; a++) S[e + a] = 0;
for (a = 0; a < o; a++) {
if (255 != (i = m[S[r + a] ^ S[e]])) for (n = 1; n < t; n++) S[e + n - 1] = S[e + n] ^ w[f(i + M[t - n])]; else for (n = e; n < e + t; n++) S[n] = S[n + 1];
S[e + t - 1] = 255 == i ? 0 : w[f(i + M[0])];
}
}
function t(r, o) {
var f;
return r > o && (f = r, r = o, o = f), f = o, f += o * o, f >>= 1, p[f += r];
}
function a(r) {
var o, f, e, a;
switch (r) {
case 0:
for (f = 0; f < l; f++) for (o = 0; o < l; o++) o + f & 1 || t(o, f) || (F[o + f * l] ^= 1);
break;
case 1:
for (f = 0; f < l; f++) for (o = 0; o < l; o++) 1 & f || t(o, f) || (F[o + f * l] ^= 1);
break;
case 2:
for (f = 0; f < l; f++) for (e = 0, o = 0; o < l; o++, e++) 3 == e && (e = 0), e || t(o, f) || (F[o + f * l] ^= 1);
break;
case 3:
for (a = 0, f = 0; f < l; f++, a++) for (3 == a && (a = 0), e = a, o = 0; o < l; o++,
e++) 3 == e && (e = 0), e || t(o, f) || (F[o + f * l] ^= 1);
break;
case 4:
for (f = 0; f < l; f++) for (e = 0, a = f >> 1 & 1, o = 0; o < l; o++, e++) 3 == e && (e = 0,
a = !a), a || t(o, f) || (F[o + f * l] ^= 1);
break;
case 5:
for (a = 0, f = 0; f < l; f++, a++) for (3 == a && (a = 0), e = 0, o = 0; o < l; o++,
e++) 3 == e && (e = 0), (o & f & 1) + !(!e | !a) || t(o, f) || (F[o + f * l] ^= 1);
break;
case 6:
for (a = 0, f = 0; f < l; f++, a++) for (3 == a && (a = 0), e = 0, o = 0; o < l; o++,
e++) 3 == e && (e = 0), (o & f & 1) + (e && e == a) & 1 || t(o, f) || (F[o + f * l] ^= 1);
break;
case 7:
for (a = 0, f = 0; f < l; f++, a++) for (3 == a && (a = 0), e = 0, o = 0; o < l; o++,
e++) 3 == e && (e = 0), (e && e == a) + (o + f & 1) & 1 || t(o, f) || (F[o + f * l] ^= 1);
}
}
function n(r) {
var o, f = 0;
for (o = 0; o <= r; o++) x[o] >= 5 && (f += R + x[o] - 5);
for (o = 3; o < r - 1; o += 2) x[o - 2] == x[o + 2] && x[o + 2] == x[o - 1] && x[o - 1] == x[o + 1] && 3 * x[o - 1] == x[o] && (0 == x[o - 3] || o + 3 > r || 3 * x[o - 3] >= 4 * x[o] || 3 * x[o + 3] >= 4 * x[o]) && (f += _);
return f;
}
function i() {
var r, o, f, e, t, a = 0, i = 0;
for (o = 0; o < l - 1; o++) for (r = 0; r < l - 1; r++) (F[r + l * o] && F[r + 1 + l * o] && F[r + l * (o + 1)] && F[r + 1 + l * (o + 1)] || !(F[r + l * o] || F[r + 1 + l * o] || F[r + l * (o + 1)] || F[r + 1 + l * (o + 1)])) && (a += y);
for (o = 0; o < l; o++) {
for (x[0] = 0, f = e = r = 0; r < l; r++) (t = F[r + l * o]) == e ? x[f]++ : x[++f] = 1,
i += (e = t) ? 1 : -1;
a += n(f);
}
i < 0 && (i = -i);
var c = i, s = 0;
for (c += c << 2, c <<= 1; c > l * l; ) c -= l * l, s++;
for (a += s * N, r = 0; r < l; r++) {
for (x[0] = 0, f = e = o = 0; o < l; o++) (t = F[r + l * o]) == e ? x[f]++ : x[++f] = 1,
e = t;
a += n(f);
}
return a;
}
function c(n) {
var c, x, R, y, _, N, Q, j;
y = n.length, s = 0;
do {
if (s++, R = 4 * (A - 1) + 16 * (s - 1), u = k[R++], v = k[R++], h = k[R++], d = k[R],
y <= (R = h * (u + v) + v - 3 + (s <= 9))) break;
} while (s < 40);
for (l = 17 + 4 * s, _ = h + (h + d) * (u + v) + v, y = 0; y < _; y++) z[y] = 0;
for (S = n.slice(0), y = 0; y < l * l; y++) F[y] = 0;
for (y = 0; y < (l * (l + 1) + 1) / 2; y++) p[y] = 0;
for (y = 0; y < 3; y++) {
for (R = 0, x = 0, 1 == y && (R = l - 7), 2 == y && (x = l - 7), F[x + 3 + l * (R + 3)] = 1,
c = 0; c < 6; c++) F[x + c + l * R] = 1, F[x + l * (R + c + 1)] = 1, F[x + 6 + l * (R + c)] = 1,
F[x + c + 1 + l * (R + 6)] = 1;
for (c = 1; c < 5; c++) r(x + c, R + 1), r(x + 1, R + c + 1), r(x + 5, R + c), r(x + c + 1, R + 5);
for (c = 2; c < 4; c++) F[x + c + l * (R + 2)] = 1, F[x + 2 + l * (R + c + 1)] = 1,
F[x + 4 + l * (R + c)] = 1, F[x + c + 1 + l * (R + 4)] = 1;
}
if (s > 1) for (y = C[s], x = l - 7; ;) {
for (c = l - 7; c > y - 3 && (o(c, x), !(c < y)); ) c -= y;
if (x <= y + 9) break;
o(6, x -= y), o(x, 6);
}
for (F[8 + l * (l - 8)] = 1, x = 0; x < 7; x++) r(7, x), r(l - 8, x), r(7, x + l - 7);
for (c = 0; c < 8; c++) r(c, 7), r(c + l - 8, 7), r(c, l - 8);
for (c = 0; c < 9; c++) r(c, 8);
for (c = 0; c < 8; c++) r(c + l - 8, 8), r(8, c);
for (x = 0; x < 7; x++) r(8, x + l - 7);
for (c = 0; c < l - 14; c++) 1 & c ? (r(8 + c, 6), r(6, 8 + c)) : (F[8 + c + 6 * l] = 1,
F[6 + l * (8 + c)] = 1);
if (s > 6) for (y = g[s - 7], R = 17, c = 0; c < 6; c++) for (x = 0; x < 3; x++,
R--) 1 & (R > 11 ? s >> R - 12 : y >> R) ? (F[5 - c + l * (2 - x + l - 11)] = 1,
F[2 - x + l - 11 + l * (5 - c)] = 1) : (r(5 - c, 2 - x + l - 11), r(2 - x + l - 11, 5 - c));
for (x = 0; x < l; x++) for (c = 0; c <= x; c++) F[c + l * x] && r(c, x);
for (_ = S.length, N = 0; N < _; N++) z[N] = S.charCodeAt(N);
if (S = z.slice(0), _ >= (c = h * (u + v) + v) - 2 && (_ = c - 2, s > 9 && _--),
N = _, s > 9) {
for (S[N + 2] = 0, S[N + 3] = 0; N--; ) y = S[N], S[N + 3] |= 255 & y << 4, S[N + 2] = y >> 4;
S[2] |= 255 & _ << 4, S[1] = _ >> 4, S[0] = 64 | _ >> 12;
} else {
for (S[N + 1] = 0, S[N + 2] = 0; N--; ) y = S[N], S[N + 2] |= 255 & y << 4, S[N + 1] = y >> 4;
S[1] |= 255 & _ << 4, S[0] = 64 | _ >> 4;
}
for (N = _ + 3 - (s < 10); N < c; ) S[N++] = 236, S[N++] = 17;
for (M[0] = 1, N = 0; N < d; N++) {
for (M[N + 1] = 1, Q = N; Q > 0; Q--) M[Q] = M[Q] ? M[Q - 1] ^ w[f(m[M[Q]] + N)] : M[Q - 1];
M[0] = w[f(m[M[0]] + N)];
}
for (N = 0; N <= d; N++) M[N] = m[M[N]];
for (R = c, x = 0, N = 0; N < u; N++) e(x, h, R, d), x += h, R += d;
for (N = 0; N < v; N++) e(x, h + 1, R, d), x += h + 1, R += d;
for (x = 0, N = 0; N < h; N++) {
for (Q = 0; Q < u; Q++) z[x++] = S[N + Q * h];
for (Q = 0; Q < v; Q++) z[x++] = S[u * h + N + Q * (h + 1)];
}
for (Q = 0; Q < v; Q++) z[x++] = S[u * h + N + Q * (h + 1)];
for (N = 0; N < d; N++) for (Q = 0; Q < u + v; Q++) z[x++] = S[c + N + Q * d];
for (S = z, c = x = l - 1, R = _ = 1, j = (h + d) * (u + v) + v, N = 0; N < j; N++) for (y = S[N],
Q = 0; Q < 8; Q++, y <<= 1) {
128 & y && (F[c + l * x] = 1);
do {
_ ? c-- : (c++, R ? 0 != x ? x-- : (R = !R, 6 == (c -= 2) && (c--, x = 9)) : x != l - 1 ? x++ : (R = !R,
6 == (c -= 2) && (c--, x -= 8))), _ = !_;
} while (t(c, x));
}
for (S = F.slice(0), y = 0, x = 3e4, R = 0; R < 8 && (a(R), (c = i()) < x && (x = c,
y = R), 7 != y); R++) F = S.slice(0);
for (y != R && a(y), x = b[y + (A - 1 << 3)], R = 0; R < 8; R++, x >>= 1) 1 & x && (F[l - 1 - R + 8 * l] = 1,
R < 6 ? F[8 + l * R] = 1 : F[8 + l * (R + 1)] = 1);
for (R = 0; R < 7; R++, x >>= 1) 1 & x && (F[8 + l * (l - 7 + R)] = 1, R ? F[6 - R + 8 * l] = 1 : F[7 + 8 * l] = 1);
return F;
}
var s, l, u, v, h, d, C = [ 0, 11, 15, 19, 23, 27, 31, 16, 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 ], g = [ 3220, 1468, 2713, 1235, 3062, 1890, 2119, 1549, 2344, 2936, 1117, 2583, 1330, 2470, 1667, 2249, 2028, 3780, 481, 4011, 142, 3098, 831, 3445, 592, 2517, 1776, 2234, 1951, 2827, 1070, 2660, 1345, 3177 ], b = [ 30660, 29427, 32170, 30877, 26159, 25368, 27713, 26998, 21522, 20773, 24188, 23371, 17913, 16590, 20375, 19104, 13663, 12392, 16177, 14854, 9396, 8579, 11994, 11245, 5769, 5054, 7399, 6608, 1890, 597, 3340, 2107 ], k = [ 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 ], m = [ 255, 0, 1, 25, 2, 50, 26, 198, 3, 223, 51, 238, 27, 104, 199, 75, 4, 100, 224, 14, 52, 141, 239, 129, 28, 193, 105, 248, 200, 8, 76, 113, 5, 138, 101, 47, 225, 36, 15, 33, 53, 147, 142, 218, 240, 18, 130, 69, 29, 181, 194, 125, 106, 39, 249, 185, 201, 154, 9, 120, 77, 228, 114, 166, 6, 191, 139, 98, 102, 221, 48, 253, 226, 152, 37, 179, 16, 145, 34, 136, 54, 208, 148, 206, 143, 150, 219, 189, 241, 210, 19, 92, 131, 56, 70, 64, 30, 66, 182, 163, 195, 72, 126, 110, 107, 58, 40, 84, 250, 133, 186, 61, 202, 94, 155, 159, 10, 21, 121, 43, 78, 212, 229, 172, 115, 243, 167, 87, 7, 112, 192, 247, 140, 128, 99, 13, 103, 74, 222, 237, 49, 197, 254, 24, 227, 165, 153, 119, 38, 184, 180, 124, 17, 68, 146, 217, 35, 32, 137, 46, 55, 63, 209, 91, 149, 188, 207, 205, 144, 135, 151, 178, 220, 252, 190, 97, 242, 86, 211, 171, 20, 42, 93, 158, 132, 60, 57, 83, 71, 109, 65, 162, 31, 45, 67, 216, 183, 123, 164, 118, 196, 23, 73, 236, 127, 12, 111, 246, 108, 161, 59, 82, 41, 157, 85, 170, 251, 96, 134, 177, 187, 204, 62, 90, 203, 89, 95, 176, 156, 169, 160, 81, 11, 245, 22, 235, 122, 117, 44, 215, 79, 174, 213, 233, 230, 231, 173, 232, 116, 214, 244, 234, 168, 80, 88, 175 ], w = [ 1, 2, 4, 8, 16, 32, 64, 128, 29, 58, 116, 232, 205, 135, 19, 38, 76, 152, 45, 90, 180, 117, 234, 201, 143, 3, 6, 12, 24, 48, 96, 192, 157, 39, 78, 156, 37, 74, 148, 53, 106, 212, 181, 119, 238, 193, 159, 35, 70, 140, 5, 10, 20, 40, 80, 160, 93, 186, 105, 210, 185, 111, 222, 161, 95, 190, 97, 194, 153, 47, 94, 188, 101, 202, 137, 15, 30, 60, 120, 240, 253, 231, 211, 187, 107, 214, 177, 127, 254, 225, 223, 163, 91, 182, 113, 226, 217, 175, 67, 134, 17, 34, 68, 136, 13, 26, 52, 104, 208, 189, 103, 206, 129, 31, 62, 124, 248, 237, 199, 147, 59, 118, 236, 197, 151, 51, 102, 204, 133, 23, 46, 92, 184, 109, 218, 169, 79, 158, 33, 66, 132, 21, 42, 84, 168, 77, 154, 41, 82, 164, 85, 170, 73, 146, 57, 114, 228, 213, 183, 115, 230, 209, 191, 99, 198, 145, 63, 126, 252, 229, 215, 179, 123, 246, 241, 255, 227, 219, 171, 75, 150, 49, 98, 196, 149, 55, 110, 220, 165, 87, 174, 65, 130, 25, 50, 100, 200, 141, 7, 14, 28, 56, 112, 224, 221, 167, 83, 166, 81, 162, 89, 178, 121, 242, 249, 239, 195, 155, 43, 86, 172, 69, 138, 9, 18, 36, 72, 144, 61, 122, 244, 245, 247, 243, 251, 235, 203, 139, 11, 22, 44, 88, 176, 125, 250, 233, 207, 131, 27, 54, 108, 216, 173, 71, 142, 0 ], S = [], z = [], F = [], p = [], x = [], A = 2, M = [], R = 3, y = 3, _ = 40, N = 10, Q = null, j = {
get ecclevel() {
return A;
},
set ecclevel(r) {
A = r;
},
get size() {
return _size;
},
set size(r) {
_size = r;
},
get canvas() {
return Q;
},
set canvas(r) {
Q = r;
},
getFrame: function(r) {
return c(r);
},
utf16to8: function(r) {
var o, f, e, t;
for (o = "", e = r.length, f = 0; f < e; f++) (t = r.charCodeAt(f)) >= 1 && t <= 127 ? o += r.charAt(f) : t > 2047 ? (o += String.fromCharCode(224 | t >> 12 & 15),
o += String.fromCharCode(128 | t >> 6 & 63), o += String.fromCharCode(128 | t >> 0 & 63)) : (o += String.fromCharCode(192 | t >> 6 & 31),
o += String.fromCharCode(128 | t >> 0 & 63));
return o;
},
draw: function(r, o, f, e, t, a,x,y) {
console.log(r)
if (A = a || A, o = o || Q) {
var n = Math.min(f, e);
r = this.utf16to8(r);
var i = this.getFrame(r), c = wx.createCanvasContext(o, t), s = Math.round(n / (l + 8)), u = s * (l + 8), v = Math.floor((n - u) / 2);
n = u, c.setFillStyle(x), c.fillRect(0, 0, f, f), c.setFillStyle(y);
for (var h = 0; h < l; h++) for (var d = 0; d < l; d++) i[d * l + h] && c.fillRect(s * (4 + h) + v, s * (4 + d) + v, s, s);
c.draw();
} else console.warn("No canvas provided to draw QR code in!");
}
};
module.exports = {
api: j
};
}();2.在我们需要使用的页面的js文件中引入该文件
var drawQrcode = require("../../../common/js/qrCode")
效果如下：
3.首先在wxml中书写 canvas标签
// 一定要写canvasId 和宽高
<canvas canvasId="myCanvas" style="width: 686rpx;height: 686rpx;background:#f1f1f1;margin: 0 auto;"></canvas>4.先声明一个方法来解决中文乱码的问题
toUtf8(str) { //解决中文乱码的问题
var out, i, len, c;
out = "";
len = str.length; //文本域值的长度
for (i = 0; i < len; i++) {
c = str.charCodeAt(i); //返回值是UTF-16的代码单元值 0-65535之间的整数 参数：大于等于0（如果小于0或者等于大于字符串的长度 则返回nan）
// console.log('cc',c);
if ((c >= 0x0001) && (c <= 0x007F)) {
out += str.charAt(i); // 从一个字符串中返回指定的字符
// console.log('out',out); //就是文本域的值
} else if (c > 0x07FF) {
out += String.fromCharCode(0xE0 | ((c >> 12) & 0x0F));
out += String.fromCharCode(0x80 | ((c >> 6) & 0x3F));
out += String.fromCharCode(0x80 | ((c >> 0) & 0x3F));
} else {
out += String.fromCharCode(0xC0 | ((c >> 6) & 0x1F));
out += String.fromCharCode(0x80 | ((c >> 0) & 0x3F));
}
}
return out;
},5.当我们文本域的值发生改变时，也要渲染到视图层
// 文本域的值发生改变 声明了bindinput事件
txtChange(e) {
this.setData({
qrCode_url: this.toUtf8(e.detail.value), // 调用中文乱码的方法
txtAreaVal: e.detail.value // 文本域的值
})
},需求：
当我们文本框输入内容时，点击以下的生成二维码按钮，下方要显示生成二维码完成（二维码画布还可更换背景和前景颜色）默认的背景颜色是 #fff 前景颜色是 #000
1.1：点击生成二维码按钮事件
// 点击生成二维码
createQRCode() {
var that=this
//文本域的值
var txtVal=this.data.txtAreaVal
// console.log('url', this.data.qrCode_url);
// 第一步：
if (!txtVal.length) {
// 无文本域的值 显示弹框
wx.showToast({
title: '请输入字符串，可以是网址、文本等',
icon: "none"
})
} else {
// 有文本域的值 提示loading效果
wx.showLoading({
title: "生成中"
})
that.setData({
codeShow:false //canvas画布不隐藏 默认是隐藏
})
// 获取可使用宽高度
// 第二步：
let obj= this.getWindowWH()
// 调用创建画布的方法，传递参数
// 第三步：
that.drawCanvas(txtVal,"myCanvas",obj.w,obj.h)
setTimeout(()=>{
//调用 把当前画布内容导出生成指定大小的图片
// 第四步：
that.createImage()
},1000)
}
},1.2：声明 获取可使用屏幕的宽高度的方法（px）
// 获取可使用窗口的框高度
getWindowWH(){
var seeWH = {} // 往seeWH对象中新增窗口宽高度两个属性
try {
const res = wx.getSystemInfoSync()// 获取设备信息
// console.log(res.windowWidth / (750 / 686))
var w = res.windowWidth / (750 / 686) //可使用窗口的宽度
var h = res.windowWidth / (750 / 686) //可使用窗口的高度
seeWH.w = w
seeWH.h = h
} catch (e) {
// Do something when catch error
console.log('获取设备信息失败', e);
}
console.log(seeWH);
return seeWH
},1.3: 声明创建画布的方法文章来源：https://www.toymoban.com/news/detail-596965.html
// 创建画布 接收传递过来的几个实参
drawCanvas(e,n,t,i){
var that=this
// e:代表文本域的值
// n：canvasID
// t：可使用窗口的宽度
// i：可使用窗口的高度
// that.data.bgcVal：背景颜色
// that.data.QJbgcVal ：前景颜色
//这里的 drawQrcode.api.draw 是引入封装好的js文件进来里面 的 draw方法
drawQrcode.api.draw(e,n,t,i,"","",that.data.bgcVal,that.data.QJbgcVal)
},1.4： 声明 用画布内容区域生成导出一个指定的大小图片 的方法文章来源地址https://www.toymoban.com/news/detail-596965.html
createImage(){
wx.canvasToTempFilePath({
canvasId:"myCanvas", //必选
success(res){
// 生成好了关闭loading效果
wx.hideLoading()
console.log('ress',res.tempFilePath);
}
})
},到了这里，关于微信小程序实现输入内容生成二维码(canvas)的文章就介绍完了。如果您还想了解更多内容，请在右上角搜索TOY模板网以前的文章或继续浏览下面的相关文章，希望大家以后多多支持TOY模板网！
