lookcommon_course/pages_tool/utils/qrcode.js

!(function () {
    var r;
    var o;
    var f;
    var e;
    var a;
    var t;
    var n = [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];
    var c = [
        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
    ];
    var i = [
        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
    ];
    var s = [
        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
    ];
    var l = [
        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
    ];
    var u = [
        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
    ];
    var v = [];
    var d = [];
    var h = [];
    var b = [];
    var k = [];
    var w = 2;
    function g(r, o) {
        var f;
        if (r > o) {
            f = r;
            r = o;
            o = f;
        }
        f = o;
        f *= o;
        f += o;
        f >>= 1;
        b[(f += r)] = 1;
    }
    function m(r, f) {
        var e;
        for (h[r + o * f] = 1, e = -2; e < 2; e++) {
            h[r + e + o * (f - 2)] = 1;
            h[r - 2 + o * (f + e + 1)] = 1;
            h[r + 2 + o * (f + e)] = 1;
            h[r + e + 1 + o * (f + 2)] = 1;
        }
        for (e = 0; e < 2; e++) {
            g(r - 1, f + e);
            g(r + 1, f - e);
            g(r - e, f - 1);
            g(r + e, f + 1);
        }
    }
    function x(r) {
        for (; r >= 255; ) {
            r = ((r -= 255) >> 8) + (255 & r);
        }
        return r;
    }
    var z = [];
    function p(r, o, f, e) {
        var a;
        var t;
        var n;
        for (a = 0; a < e; a++) {
            v[f + a] = 0;
        }
        for (a = 0; a < o; a++) {
            if (255 != (n = l[v[r + a] ^ v[f]])) {
                for (t = 1; t < e; t++) {
                    v[f + t - 1] = v[f + t] ^ u[x(n + z[e - t])];
                }
            } else {
                for (t = f; t < f + e; t++) {
                    v[t] = v[t + 1];
                }
            }
            v[f + e - 1] = 255 == n ? 0 : u[x(n + z[0])];
        }
    }
    function A(r, o) {
        var f;
        if (r > o) {
            f = r;
            r = o;
            o = f;
        }
        f = o;
        f += o * o;
        f >>= 1;
        return b[(f += r)];
    }
    function C(r) {
        var f;
        var e;
        var a;
        var t;
        switch (r) {
            case 0:
                for (e = 0; e < o; e++) {
                    for (f = 0; f < o; f++) {
                        (f + e) & 1 || A(f, e) || (h[f + e * o] ^= 1);
                    }
                }
                break;
            case 1:
                for (e = 0; e < o; e++) {
                    for (f = 0; f < o; f++) {
                        1 & e || A(f, e) || (h[f + e * o] ^= 1);
                    }
                }
                break;
            case 2:
                for (e = 0; e < o; e++) {
                    for (a = 0, f = 0; f < o; f++, a++) {
                        if (3 == a) {
                            a = 0;
                        }
                        a || A(f, e) || (h[f + e * o] ^= 1);
                    }
                }
                break;
            case 3:
                for (t = 0, e = 0; e < o; e++, t++) {
                    for (3 == t && (t = 0), a = t, f = 0; f < o; f++, a++) {
                        if (3 == a) {
                            a = 0;
                        }
                        a || A(f, e) || (h[f + e * o] ^= 1);
                    }
                }
                break;
            case 4:
                for (e = 0; e < o; e++) {
                    for (a = 0, t = (e >> 1) & 1, f = 0; f < o; f++, a++) {
                        if (3 == a) {
                            a = 0;
                            t = !t;
                        }
                        t || A(f, e) || (h[f + e * o] ^= 1);
                    }
                }
                break;
            case 5:
                for (t = 0, e = 0; e < o; e++, t++) {
                    for (3 == t && (t = 0), a = 0, f = 0; f < o; f++, a++) {
                        if (3 == a) {
                            a = 0;
                        }
                        (f & e & 1) + !(!a | !t) || A(f, e) || (h[f + e * o] ^= 1);
                    }
                }
                break;
            case 6:
                for (t = 0, e = 0; e < o; e++, t++) {
                    for (3 == t && (t = 0), a = 0, f = 0; f < o; f++, a++) {
                        if (3 == a) {
                            a = 0;
                        }
                        ((f & e & 1) + (a && a == t)) & 1 || A(f, e) || (h[f + e * o] ^= 1);
                    }
                }
                break;
            case 7:
                for (t = 0, e = 0; e < o; e++, t++) {
                    for (3 == t && (t = 0), a = 0, f = 0; f < o; f++, a++) {
                        if (3 == a) {
                            a = 0;
                        }
                        ((a && a == t) + ((f + e) & 1)) & 1 || A(f, e) || (h[f + e * o] ^= 1);
                    }
                }
        }
    }
    function F(r) {
        var o;
        var f = 0;
        for (o = 0; o <= r; o++) {
            if (k[o] >= 5) {
                f += 3 + k[o] - 5;
            }
        }
        for (o = 3; o < r - 1; o += 2) {
            if (
                k[o - 2] == k[o + 2] &&
                k[o + 2] == k[o - 1] &&
                k[o - 1] == k[o + 1] &&
                3 * k[o - 1] == k[o] &&
                (0 == k[o - 3] || o + 3 > r || 3 * k[o - 3] >= 4 * k[o] || 3 * k[o + 3] >= 4 * k[o])
            ) {
                f += 40;
            }
        }
        return f;
    }
    function M() {
        var r;
        var f;
        var e;
        var a;
        var t;
        var n = 0;
        var c = 0;
        for (f = 0; f < o - 1; f++) {
            for (r = 0; r < o - 1; r++) {
                if (
                    (h[r + o * f] && h[r + 1 + o * f] && h[r + o * (f + 1)] && h[r + 1 + o * (f + 1)]) ||
                    !(h[r + o * f] || h[r + 1 + o * f] || h[r + o * (f + 1)] || h[r + 1 + o * (f + 1)])
                ) {
                    n += 3;
                }
            }
        }
        for (f = 0; f < o; f++) {
            for (k[0] = 0, e = a = r = 0; r < o; r++) {
                (t = h[r + o * f]) == a ? k[e]++ : (k[++e] = 1);
                c += (a = t) ? 1 : -1;
            }
            n += F(e);
        }
        if (c < 0) {
            c = -c;
        }
        var i = c;
        var s = 0;
        for (i += i << 2, i <<= 1; i > o * o; ) {
            i -= o * o;
            s++;
        }
        for (n += 10 * s, r = 0; r < o; r++) {
            for (k[0] = 0, e = a = f = 0; f < o; f++) {
                (t = h[r + o * f]) == a ? k[e]++ : (k[++e] = 1);
                a = t;
            }
            n += F(e);
        }
        return n;
    }
    var R = null;
    var _ = {
        get ecclevel() {
            return w;
        },
        set ecclevel(r) {
            w = r;
        },
        get size() {
            return _size;
        },
        set size(r) {
            _size = r;
        },
        get canvas() {
            return R;
        },
        set canvas(r) {
            R = r;
        },
        getFrame: function (k) {
            return (function (k) {
                var F;
                var R;
                var _;
                var q;
                var y;
                var I;
                var N;
                var Q;
                q = k.length;
                r = 0;
                do {
                    r++;
                    _ = 4 * (w - 1) + 16 * (r - 1);
                    f = s[_++];
                    e = s[_++];
                    a = s[_++];
                    t = s[_];
                    if (q <= (_ = a * (f + e) + e - 3 + (r <= 9))) {
                        break;
                    }
                } while (r < 40);
                for (o = 17 + 4 * r, y = a + (a + t) * (f + e) + e, q = 0; q < y; q++) {
                    d[q] = 0;
                }
                for (v = k.slice(0), q = 0; q < o * o; q++) {
                    h[q] = 0;
                }
                for (q = 0; q < (o * (o + 1) + 1) / 2; q++) {
                    b[q] = 0;
                }
                for (q = 0; q < 3; q++) {
                    for (_ = 0, R = 0, 1 == q && (_ = o - 7), 2 == q && (R = o - 7), h[R + 3 + o * (_ + 3)] = 1, F = 0; F < 6; F++) {
                        h[R + F + o * _] = 1;
                        h[R + o * (_ + F + 1)] = 1;
                        h[R + 6 + o * (_ + F)] = 1;
                        h[R + F + 1 + o * (_ + 6)] = 1;
                    }
                    for (F = 1; F < 5; F++) {
                        g(R + F, _ + 1);
                        g(R + 1, _ + F + 1);
                        g(R + 5, _ + F);
                        g(R + F + 1, _ + 5);
                    }
                    for (F = 2; F < 4; F++) {
                        h[R + F + o * (_ + 2)] = 1;
                        h[R + 2 + o * (_ + F + 1)] = 1;
                        h[R + 4 + o * (_ + F)] = 1;
                        h[R + F + 1 + o * (_ + 4)] = 1;
                    }
                }
                if (r > 1) {
                    for (q = n[r], R = o - 7; ; ) {
                        for (F = o - 7; F > q - 3 && (m(F, R), !(F < q)); ) {
                            F -= q;
                        }
                        if (R <= q + 9) {
                            break;
                        }
                        m(6, (R -= q));
                        m(R, 6);
                    }
                }
                for (h[8 + o * (o - 8)] = 1, R = 0; R < 7; R++) {
                    g(7, R);
                    g(o - 8, R);
                    g(7, R + o - 7);
                }
                for (F = 0; F < 8; F++) {
                    g(F, 7);
                    g(F + o - 8, 7);
                    g(F, o - 8);
                }
                for (F = 0; F < 9; F++) {
                    g(F, 8);
                }
                for (F = 0; F < 8; F++) {
                    g(F + o - 8, 8);
                    g(8, F);
                }
                for (R = 0; R < 7; R++) {
                    g(8, R + o - 7);
                }
                for (F = 0; F < o - 14; F++) {
                    1 & F ? (g(8 + F, 6), g(6, 8 + F)) : ((h[8 + F + 6 * o] = 1), (h[6 + o * (8 + F)] = 1));
                }
                if (r > 6) {
                    for (q = c[r - 7], _ = 17, F = 0; F < 6; F++) {
                        for (R = 0; R < 3; R++, _--) {
                            1 & (_ > 11 ? r >> (_ - 12) : q >> _)
                                ? ((h[5 - F + o * (2 - R + o - 11)] = 1), (h[2 - R + o - 11 + o * (5 - F)] = 1))
                                : (g(5 - F, 2 - R + o - 11), g(2 - R + o - 11, 5 - F));
                        }
                    }
                }
                for (R = 0; R < o; R++) {
                    for (F = 0; F <= R; F++) {
                        if (h[F + o * R]) {
                            g(F, R);
                        }
                    }
                }
                for (y = v.length, I = 0; I < y; I++) {
                    d[I] = v.charCodeAt(I);
                }
                v = d.slice(0);
                if (y >= (F = a * (f + e) + e) - 2) {
                    y = F - 2;
                    if (r > 9) {
                        y--;
                    }
                }
                I = y;
                if (r > 9) {
                    for (v[I + 2] = 0, v[I + 3] = 0; I--; ) {
                        q = v[I];
                        v[I + 3] |= 255 & (q << 4);
                        v[I + 2] = q >> 4;
                    }
                    v[2] |= 255 & (y << 4);
                    v[1] = y >> 4;
                    v[0] = 64 | (y >> 12);
                } else {
                    for (v[I + 1] = 0, v[I + 2] = 0; I--; ) {
                        q = v[I];
                        v[I + 2] |= 255 & (q << 4);
                        v[I + 1] = q >> 4;
                    }
                    v[1] |= 255 & (y << 4);
                    v[0] = 64 | (y >> 4);
                }
                for (I = y + 3 - (r < 10); I < F; ) {
                    v[I++] = 236;
                    v[I++] = 17;
                }
                for (z[0] = 1, I = 0; I < t; I++) {
                    for (z[I + 1] = 1, N = I; N > 0; N--) {
                        z[N] = z[N] ? z[N - 1] ^ u[x(l[z[N]] + I)] : z[N - 1];
                    }
                    z[0] = u[x(l[z[0]] + I)];
                }
                for (I = 0; I <= t; I++) {
                    z[I] = l[z[I]];
                }
                for (_ = F, R = 0, I = 0; I < f; I++) {
                    p(R, a, _, t);
                    R += a;
                    _ += t;
                }
                for (I = 0; I < e; I++) {
                    p(R, a + 1, _, t);
                    R += a + 1;
                    _ += t;
                }
                for (R = 0, I = 0; I < a; I++) {
                    for (N = 0; N < f; N++) {
                        d[R++] = v[I + N * a];
                    }
                    for (N = 0; N < e; N++) {
                        d[R++] = v[f * a + I + N * (a + 1)];
                    }
                }
                for (N = 0; N < e; N++) {
                    d[R++] = v[f * a + I + N * (a + 1)];
                }
                for (I = 0; I < t; I++) {
                    for (N = 0; N < f + e; N++) {
                        d[R++] = v[F + I + N * t];
                    }
                }
                for (v = d, F = R = o - 1, _ = y = 1, Q = (a + t) * (f + e) + e, I = 0; I < Q; I++) {
                    for (q = v[I], N = 0; N < 8; N++, q <<= 1) {
                        if (128 & q) {
                            h[F + o * R] = 1;
                        }
                        do {
                            y ? F-- : (F++, _ ? (0 != R ? R-- : ((_ = !_), 6 == (F -= 2) && (F--, (R = 9)))) : R != o - 1 ? R++ : ((_ = !_), 6 == (F -= 2) && (F--, (R -= 8))));
                            y = !y;
                        } while (A(F, R));
                    }
                }
                for (v = h.slice(0), q = 0, R = 30000, _ = 0; _ < 8 && (C(_), (F = M()) < R && ((R = F), (q = _)), 7 != q); _++) {
                    h = v.slice(0);
                }
                for (q != _ && C(q), R = i[q + ((w - 1) << 3)], _ = 0; _ < 8; _++, R >>= 1) {
                    if (1 & R) {
                        h[o - 1 - _ + 8 * o] = 1;
                        _ < 6 ? (h[8 + o * _] = 1) : (h[8 + o * (_ + 1)] = 1);
                    }
                }
                for (_ = 0; _ < 7; _++, R >>= 1) {
                    if (1 & R) {
                        h[8 + o * (o - 7 + _)] = 1;
                        _ ? (h[6 - _ + 8 * o] = 1) : (h[7 + 8 * o] = 1);
                    }
                }
                return h;
            })(k);
        },
        draw: function (r, f, e, a, t) {
            w = t || w;
            if ((f = f || R)) {
                var n = Math.min(e, a);
                var c = this.getFrame(r);
                var i = uni.createContext();
                var s = Math.round(n / (o + 8));
                var l = s * (o + 8);
                var u = Math.floor((n - l) / 2);
                n = l;
                i.clearRect(0, 0, e, e);
                i.setFillStyle('#000000');
                for (var v = 0; v < o; v++) {
                    for (var d = 0; d < o; d++) {
                        if (c[d * o + v]) {
                            i.rect(s * (4 + v) + u, s * (4 + d) + u, s, s);
                        }
                    }
                }
                i.fill();
                uni.drawCanvas({
                    canvasId: f,
                    actions: i.getActions()
                });
            } else {
                console.warn('No canvas provided to draw QR code in!');
            }
        }
    };
    module.exports = {
        qrApi: _
    };
})();