-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsign.js
118 lines (114 loc) · 2.9 KB
/
sign.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
var i = "320305.131321201"
function a(r) {
if (Array.isArray(r)) {
for (var o = 0, t = Array(r.length); o < r.length; o++) t[o] = r[o];
return t;
}
return Array.from(r);
}
function n(r, o) {
for (var t = 0; t < o.length - 2; t += 3) {
var a = o.charAt(t + 2);
(a = a >= "a" ? a.charCodeAt(0) - 87 : Number(a)),
(a = "+" === o.charAt(t + 1) ? r >>> a : r << a),
(r = "+" === o.charAt(t) ? (r + a) & 4294967295 : r ^ a);
}
return r;
}
function e(r) {
var o = r.match(/[\uD800-\uDBFF][\uDC00-\uDFFF]/g);
if (null === o) {
var t = r.length;
t > 30 &&
(r =
"" +
r.substr(0, 10) +
r.substr(Math.floor(t / 2) - 5, 10) +
r.substr(-10, 10));
} else {
for (
var e = r.split(/[\uD800-\uDBFF][\uDC00-\uDFFF]/),
C = 0,
h = e.length,
f = [];
h > C;
C++
)
"" !== e[C] && f.push.apply(f, a(e[C].split(""))),
C !== h - 1 && f.push(o[C]);
var g = f.length;
g > 30 &&
(r =
f.slice(0, 10).join("") +
f.slice(Math.floor(g / 2) - 5, Math.floor(g / 2) + 5).join("") +
f.slice(-10).join(""));
}
var u = void 0,
l =
"" +
String.fromCharCode(103) +
String.fromCharCode(116) +
String.fromCharCode(107);
u = null !== i ? i : (i = window[l] || "") || "";
for (
var d = u.split("."),
m = Number(d[0]) || 0,
s = Number(d[1]) || 0,
S = [],
c = 0,
v = 0;
v < r.length;
v++
) {
var A = r.charCodeAt(v);
128 > A
? (S[c++] = A)
: (2048 > A
? (S[c++] = (A >> 6) | 192)
: (55296 === (64512 & A) &&
v + 1 < r.length &&
56320 === (64512 & r.charCodeAt(v + 1))
? ((A = 65536 + ((1023 & A) << 10) + (1023 & r.charCodeAt(++v))),
(S[c++] = (A >> 18) | 240),
(S[c++] = ((A >> 12) & 63) | 128))
: (S[c++] = (A >> 12) | 224),
(S[c++] = ((A >> 6) & 63) | 128)),
(S[c++] = (63 & A) | 128));
}
for (
var p = m,
F =
"" +
String.fromCharCode(43) +
String.fromCharCode(45) +
String.fromCharCode(97) +
("" +
String.fromCharCode(94) +
String.fromCharCode(43) +
String.fromCharCode(54)),
D =
"" +
String.fromCharCode(43) +
String.fromCharCode(45) +
String.fromCharCode(51) +
("" +
String.fromCharCode(94) +
String.fromCharCode(43) +
String.fromCharCode(98)) +
("" +
String.fromCharCode(43) +
String.fromCharCode(45) +
String.fromCharCode(102)),
b = 0;
b < S.length;
b++
)
(p += S[b]), (p = n(p, F));
return (
(p = n(p, D)),
(p ^= s),
0 > p && (p = (2147483647 & p) + 2147483648),
(p %= 1e6),
p.toString() + "." + (p ^ m)
);
}