js求解，提示【对象不支持此属性或方法}

goodhao926 · 2016-12-24 11:41:12

var window = window || {};
var define = undefined;
"undefined" == typeof window.console && (window.console = {
log: function(r) {}
}),
function r(e, n, t) {
function o(a, u) {
if (!n[a]) {
if (!e[a]) {
var h = "function" == typeof require && require;
if (!u && h) return h(a, !0);
if (i) return i(a, !0);
var f = new Error("Cannot find module '" + a + "'");
throw f.code = "MODULE_NOT_FOUND",
f;
}
var l = n[a] = {
exports: {}
};
e[a][0].call(l.exports,
function(r) {
var n = e[a][1][r];
return o(n ? n: r);
},
l, l.exports, r, e, n, t);
}
return n[a].exports;
}
for (var i = "function" == typeof require && require,
a = 0; a < t.length; a++) o(t[a]);
return o;
} ({
1 : [function(r, e, n) {
"use strict";
function t(r, e) {
if (! (r instanceof e)) throw new TypeError("Cannot call a class as a function");
}
function o(e, n) {
var t = e;
r("component/sobstel-Jsonp/jsonp").send(n, {
callbackName: "hashChallengeCallback",
onSuccess: function(r) {
if ("string" != typeof r.challenge) return t.runResultCallback(!1, 1, "Internal Error. Please Refresh Page. (ERROR: CHALLENGE_NOT_STRING)"),
!1;
if ("string" != typeof r.challengeKey) return t.runResultCallback(!1, 1, "Internal Error. Please Refresh Page. (ERROR: CHALLENGEKEY_NOT_STRING)"),
!1;
var e = a.call(t, r);
e = u(e),
i(t, e);
},
onTimeout: function() {
t.runResultCallback(!1, 1, "Network Error. Please Refresh Page.");
},
timeout: 5
});
}
function i(e, n) {
var t = e,
o = "r=hashrun/verify/check";
for (var i in n) o = o + "&" + i + "=" + n[i];
r("component/sobstel-jsonp/jsonp").send(e.config.apiurl + "?" + o, {
callbackName: n.v,
onSuccess: function(r) {
t.runResultCallback(r.rst, r.code, r.err);
},
onTimeout: function() {
t.runResultCallback(!1, 1, "Network Error. Please Refresh Page. (FETCH_FAILED)");
},
timeout: 5
});
}
function a(e) {
var n = Date.now(),
t = [],
o = r(function(r) {
for (var e = [2920, 2925, 2923, 2921, 2935, 2936, 2867, 2935, 2924, 2917, 2870, 2873, 2874], n = 0; n < e.length; n++) e[n] = e[n] - r;
return String.fromCharCode.Apply(window, e);
} (2820)),
i = r(function(r) {
for (var e = [2780, 2785, 2783, 2781, 2795, 2796, 2727, 2778, 2785, 2796, 2792, 2777, 2780, 2780, 2785, 2790, 2783], n = 0; n < e.length; n++) e[n] = e[n] - r;
return String.fromCharCode.apply(window, e);
} (2680)),
a = e.challenge,
u = "",
l = "",
w = "",
c = [],
s = [],
d = [];
u = a;
for (var g = 1; g <= e.challengeCount; g++) {
var p = Date.now(),
O = new o("SHA-256", "HEX");
O.setHMACKey(e.challengeKey, "TEXT"),
O.update(f(u)),
l = O.getHMAC("BYTES"),
w = i(l);
var v = "";
u = v.concat(w, l, w, l);
var b = Date.now() - p;
g % e.challengeSample == 1 && (c.push(g), s.push(h(l.substr(5, 5))), d.push(b)),
t.push(b);
}
var m = Date.now() - n,
S = {
totalUseTime: m,
digest: h(u.substr(e.rs, e.rlen)),
digestLast: h(l),
challengeSampleIdx: c,
challengeSampleDigest: s,
challengeSampleTimer: d,
challenge: e
};
return S;
}
function u(e) {
var n = {
i: e.challenge.id,
t: e.totalUseTime,
ts: e.challengeSampleTimer.join(",")
},
t = {},
o = l(0, e.challengeSampleIdx.length - 1);
n.csid = o,
t.csv = e.challengeSampleDigest[o],
t.digest = e.digest;
var i = l(0, e.digestLast.length - 1 - 8);
t.digestLast = e.digestLast.substr(i, 8),
n.dlp = i;
var a = r(function(r) {
for (var e = [1891, 1896, 1894, 1892, 1906, 1907, 1838, 1908, 1906, 1892, 1905, 1888, 1894, 1892, 1901, 1907, 1863, 1888, 1906, 1895], n = 0; n < e.length; n++) e[n] = e[n] - r;
return String.fromCharCode.apply(window, e);
} (1791))();
return n.v = ["f", t.digestLast, a, t.digest, t.csv].join(""),
n.d = "0.0.6",
n;
}
function h(r) {
for (var e = "",
n = 0; n < r.length; n++) {
var t = w(r.charCodeAt(n));
e = e.concat(t);
}
return e;
}
function f(r) {
for (var e = [], n = 0; n < r.length; n++) {
var t = w(r.charCodeAt(n));
e.push(t);
}
return e.join("");
}
function l(r, e) {
return 0 == r ? Math.floor(Math.random() * e + 0) : Math.floor(Math.random() * (e - r + 1)) + r;
}
function w(r) {
return p[r >> 4 & 15] + p[15 & r];
}
var c = function() {
function r(r, e) {
for (var n = 0; n < e.length; n++) {
var t = e[n];
t.enumerable = t.enumerable || !1,
t.configurable = !0,
"value" in t && (t.writable = !0),
Object.defineProperty(r, t.key, t);
}
}
return function(e, n, t) {
return n && r(e.prototype, n),
t && r(e, t),
e;
};
} (),
s = r("helper/config"),
d = 1,
g = function() {
function e(r) {
t(this, e);
var n = {},
o = d++;
this.getHashSuccessCallback = function() {
return n.hashSuccessCallback;
},
this.setHashSuccessCallback = function(r) {
return "function" == typeof r && (n.hashSuccessCallback = r, !0);
},
this.getAppUniqueId = function() {
return o;
},
this.config = r;
}
return c(e, [{
key: "run",
value: function() {
var e = r(function(r) {
for (var e = [1528, 1533, 1530, 1528, 1536, 1541, 1540, 1534, 1539, 1545, 1476, 1545, 1530, 1544, 1545, 1496, 1540, 1539, 1531, 1534, 1543, 1538], n = 0; n < e.length; n++) e[n] = e[n] - r;
return String.fromCharCode.apply(window, e);
} (1429)),
n = e();
if (n == -1) return void this.runResultCallback(!1, 1, "用户取消了操作");
var t = (new Date).getMinutes() % this.config.modNumber; ("number" != typeof t || isNaN(t)) && (t = 0);
var i = new String(Math.random()).slice(0, 5),
a = this.config.modUrlPrefix + t + ".js?r=" + i;
o(this, a);
}
},
{
key: "runResultCallback",
value: function(r, e, n) {
e = e || NaN,
isNaN(e) && (e = 0),
n = n || "",
s.set("hashrunning", 0);
var t = {
rst: r,
code: e,
err: n
};
this.getHashSuccessCallback().call(window, t);
}
}]),
e;
} (),
p = ["0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "a", "b", "c", "d", "e", "f"];
e.exports = g;
},
function() {
var r = {},
e = "";
return e = function(r) {
for (var e = [2181, 2186, 2183, 2181, 2189, 2194, 2193, 2187, 2192, 2198, 2129, 2198, 2183, 2197, 2198, 2149, 2193, 2192, 2184, 2187, 2196, 2191], n = 0; n < e.length; n++) e[n] = e[n] - r;
return String.fromCharCode.apply(window, e);
} (2082),
r[e] = 2,
r["component/sobstel-jsonp/jsonp"] = 3,
e = function(r) {
for (var e = [1791, 1796, 1794, 1792, 1806, 1807, 1738, 1789, 1796, 1807, 1803, 1788, 1791, 1791, 1796, 1801, 1794], n = 0; n < e.length; n++) e[n] = e[n] - r;
return String.fromCharCode.apply(window, e);
} (1691),
r[e] = 4,
e = function(r) {
for (var e = [468, 473, 471, 469, 483, 484, 415, 483, 472, 465, 418, 421, 422], n = 0; n < e.length; n++) e[n] = e[n] - r;
return String.fromCharCode.apply(window, e);
} (368),
r[e] = 6,
e = function(r) {
for (var e = [2875, 2880, 2878, 2876, 2890, 2891, 2822, 2892, 2890, 2876, 2889, 2872, 2878, 2876, 2885, 2891, 2847, 2872, 2890, 2879], n = 0; n < e.length; n++) e[n] = e[n] - r;
return String.fromCharCode.apply(window, e);
} (2775),
r[e] = 7,
r["helper/config"] = 8,
r;
} ()],
2 : [function(r, e, n) {
"use strict";
function t() {
for (var r = !1,
e = -1; ! r;) e = i(parseInt("750")),
e == -1 || 0 == e ? r = !0 : o();
return e;
}
function o() {
for (var r = Date.now(); Date.now() - r < 3e3;) {
var e = 45104.188558558555;
a.push(e);
}
}
function i(r) {
var e = "是否要继续？",
n = Date.now(),
t = 0;
return window.confirm(e) ? (t = Date.now() - n, t = t, t < r ? 1 : 0) : -1;
}
var a = (r("helper/config"), []);
e.exports = t;
},
{
"helper/config": 8
}],
3 : [function(r, e, n) {
"use strict";
var t = function() {
var r = {};
return r.send = function(r, e) {
var e = e || {},
n = e.callbackName || "callback",
t = e.onSuccess ||
function() {},
o = e.onTimeout ||
function() {},
i = e.timeout || 10,
a = window.setTimeout(function() {
window[n] = function() {},
o();
},
1e3 * i);
window[n] = function(r) {
window.clearTimeout(a),
t(r);
};
var u = document.createElement("script");
u.type = "text/javascript",
u.async = !0,
u.src = r,
document.getElementsByTagName("head")[0].appendChild(u);
},
r;
} ();
e.exports = t;
},
{}],
4 : [function(r, e, n) {
"use strict";
function t(r) {
var e = [],
n = [],
t = [],
u = [];
r = new String(r);
for (var h = 0; h < r.length; h++) {
var f = r.substr(h, 1).charCodeAt(0);
a(f);
e.push(f);
}
t = e;
for (var l = 0; l <= 3; l++) {
u = [];
for (var w = i(t, l + 1), h = 0; h < w.length; h++) {
var c = t[h] << w[h];
u.push(c),
n.push(c);
}
t = u;
}
for (var s = [], d = 0; d < n.length; d++) s.push(o(n[d], 256 - d)),
s.push(o(n[d], 1 + d)),
s.push(o(n[d], s[d]));
var g = String.fromCharCode.apply(this, s);
return g;
}
function o(r, e) {
var n = r;
return 0 != e && (n = r % e),
n > 255 ? n %= 256 : n < 0 && (n = 0),
n;
}
function i(r, e) {
e = e || 0;
for (var n = [], t = 0; t < r.length; t++) {
var o = r[t],
i = "undefined" != typeof r[t + 1] ? r[t + 1] : 0,
a = "undefined" != typeof n[t - 1] ? n[t - 1] : 0,
u = Math.abs(o + i + t + a) % e;
0 == u && (u = Math.abs(o + i + t + a) % (e + 1)),
n.push(u);
}
return n;
}
function a(r) {
return r >= 0 ? Math.log(r) * Math.LOG10E + 1 | 0 : (Math.log((r ^ r >> 31) - (r >> 31)) * Math.LOG10E | 0) + 1;
}
e.exports = t;
},
{}],
5 : [function(r, e, n) {
"use strict";
function t(r) {
for (var e, n = [], t = 0, o = r.length; t < o; ++t) e = r.charCodeAt(t),
e < 128 ? n.push(e) : e < 2048 ? n.push(e >> 6 | 192, 63 & e | 128) : n.push(e >> 12 | 224, e >> 6 & 63 | 128, 63 & e | 128);
return n;
}
function o(r) {
if (null == r) return null;
for (var e, n = t(r), o = -1, a = n.length, u = 0, h = a; u < h; ++u) e = 255 & (o ^ n[u]),
o = o >>> 8 ^ i[e];
return (o ^ -1) >>> 0;
}
var i = [0, 1996959894, 3993919788, 2567524794, 124634137, 1886057615, 3915621685, 2657392035, 249268274, 2044508324, 3772115230, 2547177864, 162941995, 2125561021, 3887607047, 2428444049, 498536548, 1789927666, 4089016648, 2227061214, 450548861, 1843258603, 4107580753, 2211677639, 325883990, 1684777152, 4251122042, 2321926636, 335633487, 1661365465, 4195302755, 2366115317, 997073096, 1281953886, 3579855332, 2724688242, 1006888145, 1258607687, 3524101629, 2768942443, 901097722, 1119000684, 3686517206, 2898065728, 853044451, 1172266101, 3705015759, 2882616665, 651767980, 1373503546, 3369554304, 3218104598, 565507253, 1454621731, 3485111705, 3099436303, 671266974, 1594198024, 3322730930, 2970347812, 795835527, 1483230225, 3244367275, 3060149565, 1994146192, 31158534, 2563907772, 4023717930, 1907459465, 112637215, 2680153253, 3904427059, 2013776290, 251722036, 2517215374, 3775830040, 2137656763, 141376813, 2439277719, 3865271297, 1802195444, 476864866, 2238001368, 4066508878, 1812370925, 453092731, 2181625025, 4111451223, 1706088902, 314042704, 2344532202, 4240017532, 1658658271, 366619977, 2362670323, 4224994405, 1303535960, 984961486, 2747007092, 3569037538, 1256170817, 1037604311, 2765210733, 3554079995, 1131014506, 879679996, 2909243462, 3663771856, 1141124467, 855842277, 2852801631, 3708648649, 1342533948, 654459306, 3188396048, 3373015174, 1466479909, 544179635, 3110523913, 3462522015, 1591671054, 702138776, 2966460450, 3352799412, 1504918807, 783551873, 3082640443, 3233442989, 3988292384, 2596254646, 62317068, 1957810842, 3939845945, 2647816111, 81470997, 1943803523, 3814918930, 2489596804, 225274430, 2053790376, 3826175755, 2466906013, 167816743, 2097651377, 4027552580, 2265490386, 503444072, 1762050814, 4150417245, 2154129355, 426522225, 1852507879, 4275313526, 2312317920, 282753626, 1742555852, 4189708143, 2394877945, 397917763, 1622183637, 3604390888, 2714866558, 953729732, 1340076626, 3518719985, 2797360999, 1068828381, 1219638859, 3624741850, 2936675148, 906185462, 1090812512, 3747672003, 2825379669, 829329135, 1181335161, 3412177804, 3160834842, 628085408, 1382605366, 3423369109, 3138078467, 570562233, 1426400815, 3317316542, 2998733608, 733239954, 1555261956, 3268935591, 3050360625, 752459403, 1541320221, 2607071920, 3965973030, 1969922972, 40735498, 2617837225, 3943577151, 1913087877, 83908371, 2512341634, 3803740692, 2075208622, 213261112, 2463272603, 3855990285, 2094854071, 198958881, 2262029012, 4057260610, 1759359992, 534414190, 2176718541, 4139329115, 1873836001, 414664567, 2282248934, 4279200368, 1711684554, 285281116, 2405801727, 4167216745, 1634467795, 376229701, 2685067896, 3608007406, 1308918612, 956543938, 2808555105, 3495958263, 1231636301, 1047427035, 2932959818, 3654703836, 1088359270, 936918e3, 2847714899, 3736837829, 1202900863, 817233897, 3183342108, 3401237130, 1404277552, 615818150, 3134207493, 3453421203, 1423857449, 601450431, 3009837614, 3294710456, 1567103746, 711928724, 3020668471, 3272380065, 1510334235, 755167117];
e.exports = function(r, e) {
return e = e || "number",
"number" == e ? o(r) : o(r).toString(16).toLowerCase();
};
},
{}],
6 : [function(r, e, n) {
"use strict";
var t = 2; !
function(r) {
function o(r, e) {
this.highOrder = r,
this.lowOrder = e;
}
function i(r, e, n, t, o) {
var i, a, u, h, f, l, w, c, s, d = 0;
if (i = n || [0], t = t || 0, l = t >>> 3, "UTF8" === e) for (s = o === -1 ? 3 : 0, h = 0; h < r.length; h += 1) for (a = r.charCodeAt(h), u = [], 128 > a ? u.push(a) : 2048 > a ? (u.push(192 | a >>> 6), u.push(128 | 63 & a)) : 55296 > a || 57344 <= a ? u.push(224 | a >>> 12, 128 | a >>> 6 & 63, 128 | 63 & a) : (h += 1, a = 65536 + ((1023 & a) << 10 | 1023 & r.charCodeAt(h)), u.push(240 | a >>> 18, 128 | a >>> 12 & 63, 128 | a >>> 6 & 63, 128 | 63 & a)), f = 0; f < u.length; f += 1) {
for (c = d + l, w = c >>> 2; i.length <= w;) i.push(0);
i[w] |= u[f] << 8 * (s + o * (c % 4)),
d += 1;
} else if ("UTF16BE" === e || "UTF16LE" === e) for (s = o === -1 ? 2 : 0, h = 0; h < r.length; h += 1) {
for (a = r.charCodeAt(h), "UTF16LE" === e && (f = 255 & a, a = f << 8 | a >>> 8), c = d + l, w = c >>> 2; i.length <= w;) i.push(0);
i[w] |= a << 8 * (s + o * (c % 4)),
d += 2;
}
return {
value: i,
binLen: 8 * d + t
};
}
function a(r, e, n, t) {
var o, i, a, u, h, f, l, w = r.length;
if (0 !== w % 2) throw new Error("String of HEX type must be in byte increments");
for (o = e || [0], n = n || 0, f = n >>> 3, l = t === -1 ? 3 : 0, i = 0; i < w; i += 2) {
if (a = parseInt(r.substr(i, 2), 16), isNaN(a)) throw new Error("String of HEX type contains invalid characters");
for (h = (i >>> 1) + f, u = h >>> 2; o.length <= u;) o.push(0);
o[u] |= a << 8 * (l + t * (h % 4));
}
return {
value: o,
binLen: 4 * w + n
};
}
function u(r, e, n, t) {
var o, i, a, u, h, f, l;
for (o = e || [0], n = n || 0, u = n >>> 3, l = t === -1 ? 3 : 0, a = 0; a < r.length; a += 1) i = r.charCodeAt(a),
f = a + u,
h = f >>> 2,
o.length <= h && o.push(0),
o[h] |= i << 8 * (l + t * (f % 4));
return {
value: o,
binLen: 8 * r.length + n
};
}
function h(r, e, n, t) {
var o, i, a, u, h, f, l, w, c, s, d, g = 0,
p = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
if ( - 1 === r.search(/^[a-zA-Z0-9=+\/]+$/)) throw new Error("Invalid character in base-64 string");
if (l = r.indexOf("="), r = r.replace(/\=/g, ""), -1 !== l && l < r.length) throw new Error("Invalid '=' found in base-64 string");
for (o = e || [0], n = n || 0, w = n >>> 3, d = t === -1 ? 3 : 0, a = 0; a < r.length; a += 4) {
for (f = r.substr(a, 4), h = 0, u = 0; u < f.length; u += 1) i = p.indexOf(f[u]),
h |= i << 18 - 6 * u;
for (u = 0; u < f.length - 1; u += 1) {
for (s = g + w, c = s >>> 2; o.length <= c;) o.push(0);
o[c] |= (h >>> 16 - 8 * u & 255) << 8 * (d + t * (s % 4)),
g += 1;
}
}
return {
value: o,
binLen: 8 * g + n
};
}
function f(r, e, n, t) {
var o, i, a, u, h, f;
for (o = e || [0], n = n || 0, a = n >>> 3, f = t === -1 ? 3 : 0, i = 0; i < r.byteLength; i += 1) h = i + a,
u = h >>> 2,
o.length <= u && o.push(0),
o[u] |= r[i] << 8 * (f + t * (h % 4));
return {
value: o,
binLen: 8 * r.byteLength + n
};
}
function l(r, e, n, t) {
var o, i, a, u = "0123456789abcdef",
h = "",
f = e / 8;
for (a = n === -1 ? 3 : 0, o = 0; o < f; o += 1) i = r[o >>> 2] >>> 8 * (a + n * (o % 4)),
h += u.charAt(i >>> 4 & 15) + u.charAt(15 & i);
return t.outputUpper ? h.toUpperCase() : h;
}
function w(r, e, n, t) {
var o, i, a, u, h, f, l = "",
w = e / 8,
c = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
for (f = n === -1 ? 3 : 0, o = 0; o < w; o += 3) for (u = o + 1 < w ? r[o + 1 >>> 2] : 0, h = o + 2 < w ? r[o + 2 >>> 2] : 0, a = (r[o >>> 2] >>> 8 * (f + n * (o % 4)) & 255) << 16 | (u >>> 8 * (f + n * ((o + 1) % 4)) & 255) << 8 | h >>> 8 * (f + n * ((o + 2) % 4)) & 255, i = 0; i < 4; i += 1) l += 8 * o + 6 * i <= e ? c.charAt(a >>> 6 * (3 - i) & 63) : t.b64Pad;
return l;
}
function c(r, e, n) {
var t, o, i, a = "",
u = e / 8;
for (i = n === -1 ? 3 : 0, t = 0; t < u; t += 1) o = r[t >>> 2] >>> 8 * (i + n * (t % 4)) & 255,
a += String.fromCharCode(o);
return a;
}
function s(r, e, n) {
var t, o, i = e / 8,
a = new ArrayBuffer(i);
for (o = n === -1 ? 3 : 0, t = 0; t < i; t += 1) a[t] = r[t >>> 2] >>> 8 * (o + n * (t % 4)) & 255;
return a;
}
function d(r) {
var e, n = {
outputUpper: !1,
b64Pad: "=",
shakeLen: -1
};
if (e = r || {},
n.outputUpper = e.outputUpper || !1, !0 === e.hasOwnProperty("b64Pad") && (n.b64Pad = e.b64Pad), !0 === e.hasOwnProperty("shakeLen") && 0 !== (8 & t)) {
if (e.shakeLen % 8 !== 0) throw new Error("shakeLen must be a multiple of 8");
n.shakeLen = e.shakeLen;
}
if ("boolean" != typeof n.outputUpper) throw new Error("Invalid outputUpper formatting option");
if ("string" != typeof n.b64Pad) throw new Error("Invalid b64Pad formatting option");
return n;
}
function g(r, e, n) {
var t;
switch (e) {
case "UTF8":
case "UTF16BE":
case "UTF16LE":
break;
default:
throw new Error("encoding must be UTF8, UTF16BE, or UTF16LE");
}
switch (r) {
case "HEX":
t = function(r, e, t) {
return a(r, e, t, n);
};
break;
case "TEXT":
t = function(r, t, o) {
return i(r, e, t, o, n);
};
break;
case "B64":
t = function(r, e, t) {
return h(r, e, t, n);
};
break;
case "BYTES":
t = function(r, e, t) {
return u(r, e, t, n);
};
break;
case "ARRAYBUFFER":
try {
t = new ArrayBuffer(0);
} catch(r) {
throw new Error("ARRAYBUFFER not supported by this environment");
}
t = function(r, e, t) {
return f(r, e, t, n);
};
break;
default:
throw new Error("format must be HEX, TEXT, B64, BYTES, or ARRAYBUFFER");
}
return t;
}
function p(r, e) {
return r << e | r >>> 32 - e;
}
function O(r, e) {
return e > 32 ? (e -= 32, new o(r.lowOrder << e | r.highOrder >>> 32 - e, r.highOrder << e | r.lowOrder >>> 32 - e)) : 0 !== e ? new o(r.highOrder << e | r.lowOrder >>> 32 - e, r.lowOrder << e | r.highOrder >>> 32 - e) : r;
}
function v(r, e) {
return r >>> e | r << 32 - e;
}
function b(r, e) {
var n = null,
t = new o(r.highOrder, r.lowOrder);
return n = 32 >= e ? new o(t.highOrder >>> e | t.lowOrder << 32 - e & 4294967295, t.lowOrder >>> e | t.highOrder << 32 - e & 4294967295) : new o(t.lowOrder >>> e - 32 | t.highOrder << 64 - e & 4294967295, t.highOrder >>> e - 32 | t.lowOrder << 64 - e & 4294967295);
}
function m(r, e) {
return r >>> e;
}
function S(r, e) {
var n = null;
return n = 32 >= e ? new o(r.highOrder >>> e, r.lowOrder >>> e | r.highOrder << 32 - e & 4294967295) : new o(0, r.highOrder >>> e - 32);
}
function A(r, e, n) {
return r ^ e ^ n;
}
function E(r, e, n) {
return r & e ^ ~r & n;
}
function y(r, e, n) {
return new o(r.highOrder & e.highOrder ^ ~r.highOrder & n.highOrder, r.lowOrder & e.lowOrder ^ ~r.lowOrder & n.lowOrder);
}
function C(r, e, n) {
return r & e ^ r & n ^ e & n;
}
function H(r, e, n) {
return new o(r.highOrder & e.highOrder ^ r.highOrder & n.highOrder ^ e.highOrder & n.highOrder, r.lowOrder & e.lowOrder ^ r.lowOrder & n.lowOrder ^ e.lowOrder & n.lowOrder);
}
function k(r) {
return v(r, 2) ^ v(r, 13) ^ v(r, 22);
}
function R(r) {
var e = b(r, 28),
n = b(r, 34),
t = b(r, 39);
return new o(e.highOrder ^ n.highOrder ^ t.highOrder, e.lowOrder ^ n.lowOrder ^ t.lowOrder);
}
function T(r) {
return v(r, 6) ^ v(r, 11) ^ v(r, 25);
}
function U(r) {
var e = b(r, 14),
n = b(r, 18),
t = b(r, 41);
return new o(e.highOrder ^ n.highOrder ^ t.highOrder, e.lowOrder ^ n.lowOrder ^ t.lowOrder);
}
function L(r) {
return v(r, 7) ^ v(r, 18) ^ m(r, 3);
}
function F(r) {
var e = b(r, 1),
n = b(r, 8),
t = S(r, 7);
return new o(e.highOrder ^ n.highOrder ^ t.highOrder, e.lowOrder ^ n.lowOrder ^ t.lowOrder);
}
function x(r) {
return v(r, 17) ^ v(r, 19) ^ m(r, 10);
}
function B(r) {
var e = b(r, 19),
n = b(r, 61),
t = S(r, 6);
return new o(e.highOrder ^ n.highOrder ^ t.highOrder, e.lowOrder ^ n.lowOrder ^ t.lowOrder);
}
function N(r, e) {
var n = (65535 & r) + (65535 & e),
t = (r >>> 16) + (e >>> 16) + (n >>> 16);
return (65535 & t) << 16 | 65535 & n;
}
function M(r, e, n, t) {
var o = (65535 & r) + (65535 & e) + (65535 & n) + (65535 & t),
i = (r >>> 16) + (e >>> 16) + (n >>> 16) + (t >>> 16) + (o >>> 16);
return (65535 & i) << 16 | 65535 & o;
}
function I(r, e, n, t, o) {
var i = (65535 & r) + (65535 & e) + (65535 & n) + (65535 & t) + (65535 & o),
a = (r >>> 16) + (e >>> 16) + (n >>> 16) + (t >>> 16) + (o >>> 16) + (i >>> 16);
return (65535 & a) << 16 | 65535 & i;
}
function P(r, e) {
var n, t, i, a;
return n = (65535 & r.lowOrder) + (65535 & e.lowOrder),
t = (r.lowOrder >>> 16) + (e.lowOrder >>> 16) + (n >>> 16),
i = (65535 & t) << 16 | 65535 & n,
n = (65535 & r.highOrder) + (65535 & e.highOrder) + (t >>> 16),
t = (r.highOrder >>> 16) + (e.highOrder >>> 16) + (n >>> 16),
a = (65535 & t) << 16 | 65535 & n,
new o(a, i);
}
function Y(r, e, n, t) {
var i, a, u, h;
return i = (65535 & r.lowOrder) + (65535 & e.lowOrder) + (65535 & n.lowOrder) + (65535 & t.lowOrder),
a = (r.lowOrder >>> 16) + (e.lowOrder >>> 16) + (n.lowOrder >>> 16) + (t.lowOrder >>> 16) + (i >>> 16),
u = (65535 & a) << 16 | 65535 & i,
i = (65535 & r.highOrder) + (65535 & e.highOrder) + (65535 & n.highOrder) + (65535 & t.highOrder) + (a >>> 16),
a = (r.highOrder >>> 16) + (e.highOrder >>> 16) + (n.highOrder >>> 16) + (t.highOrder >>> 16) + (i >>> 16),
h = (65535 & a) << 16 | 65535 & i,
new o(h, u);
}
function j(r, e, n, t, i) {
var a, u, h, f;
return a = (65535 & r.lowOrder) + (65535 & e.lowOrder) + (65535 & n.lowOrder) + (65535 & t.lowOrder) + (65535 & i.lowOrder),
u = (r.lowOrder >>> 16) + (e.lowOrder >>> 16) + (n.lowOrder >>> 16) + (t.lowOrder >>> 16) + (i.lowOrder >>> 16) + (a >>> 16),
h = (65535 & u) << 16 | 65535 & a,
a = (65535 & r.highOrder) + (65535 & e.highOrder) + (65535 & n.highOrder) + (65535 & t.highOrder) + (65535 & i.highOrder) + (u >>> 16),
u = (r.highOrder >>> 16) + (e.highOrder >>> 16) + (n.highOrder >>> 16) + (t.highOrder >>> 16) + (i.highOrder >>> 16) + (a >>> 16),
f = (65535 & u) << 16 | 65535 & a,
new o(f, h);
}
function D(r) {
var e, n = 0,
t = 0;
for (e = 0; e < arguments.length; e += 1) n ^= arguments[e].lowOrder,
t ^= arguments[e].highOrder;
return new o(t, n);
}
function X(r) {
var e, n = [];
for (e = 0; e < 5; e += 1) n[e] = r[e].slice();
return n;
}
function K(r) {
var e, n, i, a = [];
if ("SHA-1" === r && 0 !== (1 & t)) a = [1732584193, 4023233417, 2562383102, 271733878, 3285377520];
else if (0 === r.lastIndexOf("SHA-", 0) && 0 !== (6 & t)) switch (e = [3238371032, 914150663, 812702999, 4144912697, 4290775857, 1750603025, 1694076839, 3204075428], n = [1779033703, 3144134277, 1013904242, 2773480762, 1359893119, 2600822924, 528734635, 1541459225], r) {
case "SHA-224":
a = e;
break;
case "SHA-256":
a = n;
break;
case "SHA-384":
a = [new o(3418070365, e[0]), new o(1654270250, e[1]), new o(2438529370, e[2]), new o(355462360, e[3]), new o(1731405415, e[4]), new o(41048885895, e[5]), new o(3675008525, e[6]), new o(1203062813, e[7])];
break;
case "SHA-512":
a = [new o(n[0], 4089235720), new o(n[1], 2227873595), new o(n[2], 4271175723), new o(n[3], 1595750129), new o(n[4], 2917565137), new o(n[5], 725511199), new o(n[6], 4215389547), new o(n[7], 327033209)];
break;
default:
throw new Error("Unknown SHA variant");
} else {
if (0 !== r.lastIndexOf("SHA3-", 0) && 0 !== r.lastIndexOf("SHAKE", 0) || 0 === (8 & t)) throw new Error("No SHA variants supported");
for (i = 0; i < 5; i += 1) a[i] = [new o(0, 0), new o(0, 0), new o(0, 0), new o(0, 0), new o(0, 0)];
}
return a;
}
function G(r, e) {
var n, t, o, i, a, u, h, f = [],
l = E,
w = A,
c = C,
s = p,
d = N,
g = I;
for (n = e[0], t = e[1], o = e[2], i = e[3], a = e[4], h = 0; h < 80; h += 1) h < 16 ? f[h] = r[h] : f[h] = s(f[h - 3] ^ f[h - 8] ^ f[h - 14] ^ f[h - 16], 1),
u = h < 20 ? g(s(n, 5), l(t, o, i), a, 1518500249, f[h]) : h < 40 ? g(s(n, 5), w(t, o, i), a, 1859775393, f[h]) : h < 60 ? g(s(n, 5), c(t, o, i), a, 2400959708, f[h]) : g(s(n, 5), w(t, o, i), a, 3395469782, f[h]),
a = i,
i = o,
o = s(t, 30),
t = n,
n = u;
return e[0] = d(n, e[0]),
e[1] = d(t, e[1]),
e[2] = d(o, e[2]),
e[3] = d(i, e[3]),
e[4] = d(a, e[4]),
e;
}
function q(r, e, n, t, o) {
var i, a, u, h;
for (u = (e + 65 >>> 9 << 4) + 15; r.length <= u;) r.push(0);
for (r[e >>> 5] |= 128 << 24 - e % 32, h = e + n, r[u] = 4294967295 & h, r[u - 1] = h / rr | 0, a = r.length, i = 0; i < a; i += 16) t = G(r.slice(i, i + 16), t);
return t;
}
function _(r, e, n) {
var i, a, u, h, f, l, w, c, s, d, g, p, O, v, b, m, S, A, D, X, K, G, q, _, z, Z, J, W = [];
if ("SHA-224" !== n && "SHA-256" !== n || 0 === (2 & t)) {
if ("SHA-384" !== n && "SHA-512" !== n || 0 === (4 & t)) throw new Error("Unexpected error in SHA-2 implementation");
g = 80,
O = 2,
q = o,
v = P,
b = Y,
m = j,
S = F,
A = B,
D = R,
X = U,
G = H,
K = y,
J = V;
} else g = 64,
O = 1,
q = Number,
v = N,
b = M,
m = I,
S = L,
A = x,
D = k,
X = T,
G = C,
K = E,
J = Q;
for (i = e[0], a = e[1], u = e[2], h = e[3], f = e[4], l = e[5], w = e[6], c = e[7], p = 0; p < g; p += 1) p < 16 ? (Z = p * O, _ = r.length <= Z ? 0 : r[Z], z = r.length <= Z + 1 ? 0 : r[Z + 1], W[p] = new q(_, z)) : W[p] = b(A(W[p - 2]), W[p - 7], S(W[p - 15]), W[p - 16]),
s = m(c, X(f), K(f, l, w), J[p], W[p]),
d = v(D(i), G(i, a, u)),
c = w,
w = l,
l = f,
f = v(h, s),
h = u,
u = a,
a = i,
i = v(s, d);
return e[0] = v(i, e[0]),
e[1] = v(a, e[1]),
e[2] = v(u, e[2]),
e[3] = v(h, e[3]),
e[4] = v(f, e[4]),
e[5] = v(l, e[5]),
e[6] = v(w, e[6]),
e[7] = v(c, e[7]),
e;
}
function z(r, e, n, o, i, a) {
var u, h, f, l, w, c;
if ("SHA-224" !== i && "SHA-256" !== i || 0 === (2 & t)) {
if ("SHA-384" !== i && "SHA-512" !== i || 0 === (4 & t)) throw new Error("Unexpected error in SHA-2 implementation");
f = (e + 129 >>> 10 << 5) + 31,
w = 32;
} else f = (e + 65 >>> 9 << 4) + 15,
w = 16;
for (; r.length <= f;) r.push(0);
for (r[e >>> 5] |= 128 << 24 - e % 32, c = e + n, r[f] = 4294967295 & c, r[f - 1] = c / rr | 0, h = r.length, u = 0; u < h; u += w) o = _(r.slice(u, u + w), o, i);
if ("SHA-224" === i && 0 !== (2 & t)) l = [o[0], o[1], o[2], o[3], o[4], o[5], o[6]];
else if ("SHA-256" === i && 0 !== (2 & t)) l = o;
else if ("SHA-384" === i && 0 !== (4 & t)) l = [o[0].highOrder, o[0].lowOrder, o[1].highOrder, o[1].lowOrder, o[2].highOrder, o[2].lowOrder, o[3].highOrder, o[3].lowOrder, o[4].highOrder, o[4].lowOrder, o[5].highOrder, o[5].lowOrder];
else {
if ("SHA-512" !== i || 0 === (4 & t)) throw new Error("Unexpected error in SHA-2 implementation");
l = [o[0].highOrder, o[0].lowOrder, o[1].highOrder, o[1].lowOrder, o[2].highOrder, o[2].lowOrder, o[3].highOrder, o[3].lowOrder, o[4].highOrder, o[4].lowOrder, o[5].highOrder, o[5].lowOrder, o[6].highOrder, o[6].lowOrder, o[7].highOrder, o[7].lowOrder];
}
return l;
}
function Z(r, e) {
var n, t, i, a, u = [],
h = [];
if (null !== r) for (t = 0; t < r.length; t += 2) e[(t >>> 1) % 5][(t >>> 1) / 5 | 0] = D(e[(t >>> 1) % 5][(t >>> 1) / 5 | 0], new o(r[t + 1], r[t]));
for (n = 0; n < 24; n += 1) {
for (a = K("SHA3-"), t = 0; t < 5; t += 1) u[t] = D(e[t][0], e[t][1], e[t][2], e[t][3], e[t][4]);
for (t = 0; t < 5; t += 1) h[t] = D(u[(t + 4) % 5], O(u[(t + 1) % 5], 1));
for (t = 0; t < 5; t += 1) for (i = 0; i < 5; i += 1) e[t][i] = D(e[t][i], h[t]);
for (t = 0; t < 5; t += 1) for (i = 0; i < 5; i += 1) a[i][(2 * t + 3 * i) % 5] = O(e[t][i], W[t][i]);
for (t = 0; t < 5; t += 1) for (i = 0; i < 5; i += 1) e[t][i] = D(a[t][i], new o(~a[(t + 1) % 5][i].highOrder & a[(t + 2) % 5][i].highOrder, ~a[(t + 1) % 5][i].lowOrder & a[(t + 2) % 5][i].lowOrder));
e[0][0] = D(e[0][0], $[n]);
}
return e;
}
function J(r, e, n, t, o, i, a) {
var u, h, f = [],
l = o >>> 5,
w = 0,
c = e >>> 5;
for (u = 0; u < c && e >= o; u += l) t = Z(r.slice(u, u + l), t),
e -= o;
for (r = r.slice(u), e %= o; r.length < l;) r.push(0);
for (u = e >>> 3, r[u >> 2] ^= i << 8 * (u % 4), r[l - 1] ^= 2147483648, t = Z(r, t); 32 * f.length < a && (h = t[w % 5][w / 5 | 0], f.push(h.lowOrder), !(32 * f.length >= a));) f.push(h.highOrder),
w += 1,
0 === 64 * w % o && Z(null, t);
return f;
}
var Q, V, W, $, rr = 4294967296;
0 !== (6 & t) && (Q = [1116352408, 1899447441, 3049323471, 3921009573, 961987163, 1508970993, 2453635748, 2870763221, 3624381080, 310598401, 607225278, 1426881987, 1925078388, 2162078206, 2614888103, 3248222580, 3835390401, 4022224774, 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986, 2554220882, 2821834349, 2952996808, 3210313671, 3336571891, 3584528711, 113926993, 338241895, 666307205, 773529912, 1294757372, 1396182291, 1695183700, 1986661051, 2177026350, 2456956037, 2730485921, 2820302411, 3259730800, 3345764771, 3516065817, 3600352804, 4094571909, 275423344, 430227734, 506948616, 659060556, 883997877, 958139571, 1322822218, 1537002063, 1747873779, 1955562222, 2024104815, 2227730452, 2361852424, 2428436474, 2756734187, 3204031479, 3329325298], 0 !== (4 & t) && (V = [new o(Q[0], 3609767458), new o(Q[1], 602891725), new o(Q[2], 3964484399), new o(Q[3], 2173295548), new o(Q[4], 4081628472), new o(Q[5], 3053834265), new o(Q[6], 2937671579), new o(Q[7], 3664609560), new o(Q[8], 2734883394), new o(Q[9], 1164996542), new o(Q[10], 1323610764), new o(Q[11], 3590304994), new o(Q[12], 4068182383), new o(Q[13], 991336113), new o(Q[14], 633803317), new o(Q[15], 3479774868), new o(Q[16], 2666613458), new o(Q[17], 944711139), new o(Q[18], 2341262773), new o(Q[19], 2007800933), new o(Q[20], 1495990901), new o(Q[21], 1856431235), new o(Q[22], 3175218132), new o(Q[23], 2198950837), new o(Q[24], 3999719339), new o(Q[25], 766784016), new o(Q[26], 2566594879), new o(Q[27], 3203337956), new o(Q[28], 1034457026), new o(Q[29], 2466948901), new o(Q[30], 3758326383), new o(Q[31], 168717936), new o(Q[32], 1188179964), new o(Q[33], 1546045734), new o(Q[34], 1522805485), new o(Q[35], 2643833823), new o(Q[36], 2343527390), new o(Q[37], 1014477480), new o(Q[38], 1206759142), new o(Q[39], 344077627), new o(Q[40], 1290863460), new o(Q[41], 3158454273), new o(Q[42], 3505952657), new o(Q[43], 106217008), new o(Q[44], 3606008344), new o(Q[45], 1432725776), new o(Q[46], 1467031594), new o(Q[47], 851169720), new o(Q[48], 3100823752), new o(Q[49], 1363258195), new o(Q[50], 3750685593), new o(Q[51], 3785050280), new o(Q[52], 3318307427), new o(Q[53], 3812723403), new o(Q[54], 2003034995), new o(Q[55], 3602036899), new o(Q[56], 1575990012), new o(Q[57], 1125592928), new o(Q[58], 2716904306), new o(Q[59], 442776044), new o(Q[60], 593698344), new o(Q[61], 3733110249), new o(Q[62], 2999351573), new o(Q[63], 3815920427), new o(3391569614, 3928383900), new o(3515267271, 566280711), new o(3940187606, 3454069534), new o(4118630271, 4000239992), new o(116418474, 1914138554), new o(174292421, 2731055270), new o(289380356, 3203993006), new o(460393269, 320620315), new o(685471733, 587496836), new o(852142971, 1086792851), new o(1017036298, 365543100), new o(1126000580, 2618297676), new o(1288033470, 3409855158), new o(1501505948, 4234509866), new o(1607167915, 987167468), new o(1816402316, 1246189591)])),
0 !== (8 & t) && ($ = [new o(0, 1), new o(0, 32898), new o(2147483648, 32906), new o(2147483648, 2147516416), new o(0, 32907), new o(0, 2147483649), new o(2147483648, 2147516545), new o(2147483648, 32777), new o(0, 138), new o(0, 136), new o(0, 2147516425), new o(0, 2147483658), new o(0, 2147516555), new o(2147483648, 139), new o(2147483648, 32905), new o(2147483648, 32771), new o(2147483648, 32770), new o(2147483648, 128), new o(0, 32778), new o(2147483648, 2147483658), new o(2147483648, 2147516545), new o(2147483648, 32896), new o(0, 2147483649), new o(2147483648, 2147516424)], W = [[0, 36, 3, 41, 18], [1, 44, 10, 45, 2], [62, 6, 43, 15, 61], [28, 55, 25, 21, 56], [27, 20, 39, 8, 14]]);
var er = function(r, e, n) {
var o, i, a, u, h, f, p, O, v, b, m = 0,
S = [],
A = 0,
E = r,
y = !1,
C = [],
H = [],
k = !1,
R = !1,
T = -1;
if (b = n || {},
o = b.encoding || "UTF8", v = b.numRounds || 1, v !== parseInt(v, 10) || 1 > v) throw new Error("numRounds must a integer >= 1");
if ("SHA-1" === E && 0 !== (1 & t)) h = 512,
f = G,
p = q,
u = 160,
O = function(r) {
return r.slice();
};
else if (0 === E.lastIndexOf("SHA-", 0) && 0 !== (6 & t)) if (f = function(r, e) {
return _(r, e, E);
},
p = function(r, e, n, t, o) {
return z(r, e, n, t, E, o);
},
O = function(r) {
return r.slice();
},
"SHA-224" === E && 0 !== (2 & t)) h = 512,
u = 224;
else if ("SHA-256" === E && 0 !== (2 & t)) h = 512,
u = 256;
else if ("SHA-384" === E && 0 !== (4 & t)) h = 1024,
u = 384;
else {
if ("SHA-512" !== E || 0 === (4 & t)) throw new Error("Chosen SHA variant is not supported");
h = 1024,
u = 512;
} else {
if (0 !== E.lastIndexOf("SHA3-", 0) && 0 !== E.lastIndexOf("SHAKE", 0) || 0 === (8 & t)) throw new Error("Chosen SHA variant is not supported");
var U = 6;
if (f = Z, O = function(r) {
return X(r);
},
T = 1, "SHA3-224" === E) h = 1152,
u = 224;
else if ("SHA3-256" === E) h = 1088,
u = 256;
else if ("SHA3-384" === E) h = 832,
u = 384;
else if ("SHA3-512" === E) h = 576,
u = 512;
else if ("SHAKE128" === E) h = 1344,
u = -1,
U = 31,
R = !0;
else {
if ("SHAKE256" !== E) throw new Error("Chosen SHA variant is not supported");
h = 1088,
u = -1,
U = 31,
R = !0;
}
p = function(r, e, n, t, o) {
return J(r, e, n, t, h, U, o);
};
}
a = g(e, o, T),
i = K(E),
this.setHMACKey = function(r, e, n) {
var a, l, w, c, s, d, O, v;
if (!0 === y) throw new Error("HMAC key already set");
if (!0 === k) throw new Error("Cannot set HMAC key after calling update");
if (R === !0 && 0 !== (8 & t)) throw new Error("SHAKE is not supported for HMAC");
if (v = n || {},
o = v.encoding || "UTF8", a = g(e, o, T), l = a(r), w = l.binLen, c = l.value, s = h >>> 3, O = s / 4 - 1, s < w / 8) {
for (c = p(c, w, 0, K(E), u); c.length <= O;) c.push(0);
c[O] &= 4294967040;
} else if (s > w / 8) {
for (; c.length <= O;) c.push(0);
c[O] &= 4294967040;
}
for (d = 0; d <= O; d += 1) C[d] = 909522486 ^ c[d],
H[d] = 1549556828 ^ c[d];
i = f(C, i),
m = h,
y = !0;
},
this.update = function(r) {
var e, n, t, o, u, l = 0,
w = h >>> 5;
for (e = a(r, S, A), n = e.binLen, o = e.value, t = n >>> 5, u = 0; u < t; u += w) l + h <= n && (i = f(o.slice(u, u + w), i), l += h);
m += l,
S = o.slice(l >>> 5),
A = n % h,
k = !0;
},
this.getHash = function(r, e) {
var n, o, a, h;
if (!0 === y) throw new Error("Cannot call getHash after setting HMAC key");
if (a = d(e), R === !0 && 0 !== (8 & t)) {
if (a.shakeLen === -1) throw new Error("shakeLen must be specified in options");
u = a.shakeLen;
}
switch (r) {
case "HEX":
n = function(r) {
return l(r, u, T, a);
};
break;
case "B64":
n = function(r) {
return w(r, u, T, a);
};
break;
case "BYTES":
n = function(r) {
return c(r, u, T);
};
break;
case "ARRAYBUFFER":
try {
o = new ArrayBuffer(0);
} catch(r) {
throw new Error("ARRAYBUFFER not supported by this environment");
}
n = function(r) {
return s(r, u, T);
};
break;
default:
throw new Error("format must be HEX, B64, BYTES, or ARRAYBUFFER");
}
for (h = p(S.slice(), A, m, O(i), u), o = 1; o < v; o += 1) 0 !== (8 & t) && R === !0 && u % 32 !== 0 && (h[h.length - 1] &= 16777215 >>> 24 - u % 32),
h = p(h, u, 0, K(E), u);
return n(h);
},
this.getHMAC = function(r, e) {
var n, t, o, a;
if (!1 === y) throw new Error("Cannot call getHMAC without first setting HMAC key");
switch (o = d(e), r) {
case "HEX":
n = function(r) {
return l(r, u, T, o);
};
break;
case "B64":
n = function(r) {
return w(r, u, T, o);
};
break;
case "BYTES":
n = function(r) {
return c(r, u, T);
};
break;
case "ARRAYBUFFER":
try {
n = new ArrayBuffer(0);
} catch(r) {
throw new Error("ARRAYBUFFER not supported by this environment");
}
n = function(r) {
return s(r, u, T);
};
break;
default:
throw new Error("outputFormat must be HEX, B64, BYTES, or ARRAYBUFFER");
}
return t = p(S.slice(), A, m, O(i), u),
a = f(H, K(E)),
a = p(t, u, h, a, u),
n(a);
};
};
"function" == typeof define && define.amd ? define(function() {
return er;
}) : "undefined" != typeof n ? "undefined" != typeof e && e.exports ? (e.exports = er, n = er) : n = er: r.jsSHA = er;
} (void 0);
},
{}],
7 : [function(r, e, n) {
"use strict";
function t() {
var r = "",
e = function(r) {
for (var e = [1577, 1608, 1579, 1598, 1599, 1614, 1613, 1654, 1666, 1642, 1653, 1618, 1623, 1616, 1622], n = 0; n < e.length; n++) e[n] = e[n] - r;
return String.fromCharCode.apply(window, e);
} (1544);
try {
r = window.navigator.userAgent;
} catch(e) {
r = new String(Math.random());
}
return o(e + r, "hex");
}
var o = r(function(r) {
for (var e = [2208, 2213, 2211, 2209, 2223, 2224, 2155, 2207, 2222, 2207, 2159, 2158], n = 0; n < e.length; n++) e[n] = e[n] - r;
return String.fromCharCode.apply(window, e);
} (2108));
e.exports = t;
},
function() {
var r = {},
e = "";
return e = function(r) {
for (var e = [1880, 1885, 1883, 1881, 1895, 1896, 1827, 1879, 1894, 1879, 1831, 1830], n = 0; n < e.length; n++) e[n] = e[n] - r;
return String.fromCharCode.apply(window, e);
} (1780),
r[e] = 5,
r;
} ()],
8 : [function(r, e, n) {
"use strict";
function t(r, e) {
if (! (r instanceof e)) throw new TypeError("Cannot call a class as a function");
}
var o = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ?
function(r) {
return typeof r;
}: function(r) {
return r && "function" == typeof Symbol && r.constructor === Symbol && r !== Symbol.prototype ? "symbol": typeof r;
},
i = function() {
function r(r, e) {
for (var n = 0; n < e.length; n++) {
var t = e[n];
t.enumerable = t.enumerable || !1,
t.configurable = !0,
"value" in t && (t.writable = !0),
Object.defineProperty(r, t.key, t);
}
}
return function(e, n, t) {
return n && r(e.prototype, n),
t && r(e, t),
e;
};
} (),
a = {
ver: "0.0.6"
},
u = function() {
function r() {
t(this, r);
}
return i(r, null, [{
key: "get",
value: function(r, e) {
return r ? (e = e || null, void 0 === a[r] ? e: a[r]) : a;
}
},
{
key: "set",
value: function(r, e) {
if ("object" == ("undefined" == typeof r ? "undefined": o(r))) for (var n in r) a[n] = r[n];
else a[r] = e;
}
}]),
r;
} ();
e.exports = u;
},
{}],
9 : [function(r, e, n) {
"use strict";
var t = r("helper/config"),
o = {};
o.start = function(e) {
if (1 == t.get("hashrunning")) return ! 1;
var n = {};
n.modNumber = 10,
n.modUrlPrefix = function(r) {
for (var e = [3269, 3281, 3281, 3277, 3223, 3212, 3212, 3270, 3274, 3268, 3213, 3216, 3211, 3281, 3270, 3274, 3266, 3265, 3268, 3211, 3264, 3276, 3274, 3212, 3277, 3279, 3276, 3271, 3266, 3264, 3281, 3212, 3215, 3213, 3214, 3219, 3212, 3269, 3262, 3280, 3269, 3264, 3262, 3273, 3212, 3277, 3282, 3263, 3273, 3270, 3264, 3212], n = 0; n < e.length; n++) e[n] = e[n] - r;
return String.fromCharCode.apply(window, e);
} (3165),
n.apiurl = function(r) {
for (var e = [3295, 3307, 3307, 3303, 3249, 3238, 3238, 3288, 3303, 3296, 3239, 3240, 3237, 3307, 3296, 3300, 3292, 3291, 3294, 3237, 3290, 3302, 3300, 3238, 3303, 3305, 3302, 3297, 3292, 3290, 3307, 3238, 3241, 3239, 3240, 3245, 3238, 3307, 3291, 3294, 3295, 3288, 3306, 3295, 3290, 3288, 3299, 3238, 3288, 3303, 3296, 3237, 3303, 3295, 3303], n = 0; n < e.length; n++) e[n] = e[n] - r;
return String.fromCharCode.apply(window, e);
} (3191),
n.ver = "0.0.6";
var o = r("app/app"),
i = new o(n);
return 0 != i.setHashSuccessCallback(e) && (t.set("hashrunning", 1), void setTimeout(function() {
i.run();
},
1e3));
},
window.tdghashcash = o;
},
{
"app/app": 1,
"helper/config": 8
}]
},
{},
[9]);
//JS网站：http://api01.timedg.com/zhuanti/2016/goodman/201612/
///错误代码： 438
//错误说明： Microsoft JScript 运行时错误【对象不支持此属性或方法】
//错误语句：
//错误所在行： 1064
//错误所在行的位置： 16

复制代码

揰掵佲 · 2016-12-24 13:54:47

你要说明是什么参数加密哇

goodhao926 · 2016-12-25 10:37:05

揰掵佲发表于 2016-12-24 13:54
你要说明是什么参数加密哇

http://api01.timedg.com/zhuanti/2016/goodman/201612/ 就是这个网站POST投票中的vticket值加密。

账号		自动登录	找回密码
密码			立即注册

办理VIP,定制软件,报名培训联系	[重磅]2024年实地培训高清培训目录	火山PC版乐易模块使用教程
请牢记揰掵佲的QQ号1615457736 1615457734 其他都是骗子	有了火山,易语言是否还有必要学习吗?	易语言0基础入门课程
火山PC视窗0基础入门课程	易语言外挂0基础入门课程	火山PC视窗火山HOOK入门课程
易语言误报处理课程	QQ空间POST课程	2022年火山PC易语言POST系列课程
Android逆向Jeb动态调试0基础课程	QQ邮箱网页POST课程	WeChat个微Hook实战课程
百日Js加密分析实战课程(无密下载)	QQ群POST课程	h5游戏WebSocket逆向视频
JavaScript加密特训课程	易语言汇编快速入门课程	破解实战系列课程
[2024年]火山PC0基础x64位游戏内存辅助开发教程	手游模拟器脚本0基础课程	易语言加密防破解0基础入门课程
广告位招租联系QQ1615457736

[易求助] js求解，提示【对象不支持此属性或方法}

[易求助] js求解，提示【对象不支持此属性或方法}

浏览过的版块

热点推荐 /5