☰

ConfigDecoder.Prod

ConfigDecoder use for the spider on Bookwalker.jp

此腳本不應該直接安裝，它是一個供其他腳本使用的函式庫。欲使用本函式庫，請在腳本 metadata 寫上： // @require https://update.gf.qytechs.cn/scripts/431367/963923/ConfigDecoderProd.js 

  1. var ConfigDecoder = function (e) {
  2.   var t = {};
  3.  
  4.   function r(a) {
  5.     if (t[a]) return t[a].exports;
  6.     var n = t[a] = {
  7.       i: a,
  8.       l: !1,
  9.       exports: {}
  10.     };
  11.     return e[a].call(n.exports, n, n.exports, r), n.l = !0, n.exports
  12.   }
  13.   return r.m = e, r.c = t, r.d = function (e, t, a) {
  14.     r.o(e, t) || Object.defineProperty(e, t, {
  15.       configurable: !1,
  16.       enumerable: !0,
  17.       get: a
  18.     })
  19.   }, r.r = function (e) {
  20.     Object.defineProperty(e, "__esModule", {
  21.       value: !0
  22.     })
  23.   }, r.n = function (e) {
  24.     var t = e && e.__esModule ? function () {
  25.       return e.default
  26.     } : function () {
  27.       return e
  28.     };
  29.     return r.d(t, "a", t), t
  30.   }, r.o = function (e, t) {
  31.     return Object.prototype.hasOwnProperty.call(e, t)
  32.   }, r.p = "", r(r.s = 17)
  33. }([function (e, t, r) {
  34.   "use strict";
  35.   this && this.__awaiter, this && this.__generator;
  36.   var a = this && this.__spreadArray || function (e, t) {
  37.     for (var r = 0, a = t.length, n = e.length; r < a; r++, n++) e[n] = t[r];
  38.     return e
  39.   };
  40.   t.__esModule = !0, t.readJsonFile = t.createTA8jResult = t.isEqual = t.arraySum = t.v_smi = t.v_qmi = t.v_ifi = void 0;
  41.   var n = r(3),
  42.     u = r(11);
  43.   t.v_ifi = function (e) {
  44.     for (;;) {
  45.       var t = e();
  46.       if (void 0 !== t) return t
  47.     }
  48.   }, t.v_qmi = function (e, t, r) {
  49.     return n.default(a(a(a([], e), t), r))
  50.   }, t.v_smi = function (e, t, r, n) {
  51.     return u.default(e, a(a(a([], t), r), n))
  52.   };
  53.   t.arraySum = function (e) {
  54.     return e.reduce(function (e, t) {
  55.       return void 0 === e && (e = 0), e + t
  56.     })
  57.   }, t.createTA8jResult = function (e) {
  58.     return [new Uint8Array(e[0]), e[1], e[2].slice(0, e[2].length), e[3].slice(0, e[3].length), e[4].slice(0, e[4].length)]
  59.   }
  60. }, function (e, t, r) {
  61.   "use strict";
  62.   t.__esModule = !0, t.default = function (e, t, r) {
  63.     var a = e[t];
  64.     e[t] = e[r], e[r] = a
  65.   }
  66. }, function (e, t, r) {
  67.   "use strict";
  68.   t.__esModule = !0, t.step = void 0;
  69.   var a = r(1);
  70.  
  71.   function n(e, t, r, n, u) {
  72.     return t = (t + n[e = (e + 1) % 256]) % 256, a.default(n, e, t), u[r] ^= n[(n[e] + n[t]) % 256], [e, t]
  73.   }
  74.   t.default = function (e, t, r) {
  75.     for (var a, u = e[0], f = e[1], i = e[2], o = e[3], s = e[4], c = 0, d = 0; r >= 0; r -= 2) c = (a = n(c, d, r, t, u))[0], d = a[1];
  76.     return [u, f, i, o, s]
  77.   }, t.step = n
  78. }, function (e, t, r) {
  79.   "use strict";
  80.   t.__esModule = !0;
  81.   var a = r(1);
  82.   t.default = function (e) {
  83.     for (var t = new Array(256).fill(0).map(function (e, t) {
  84.         return t
  85.       }), r = "string" == typeof e ? e.charCodeAt.bind(e) : function (t) {
  86.         return e[t]
  87.       }, n = 0, u = 0; u < 256; u++) {
  88.       var f = u % e.length;
  89.       n = (n + t[u] + r(f)) % 256, a.default(t, u, n)
  90.     }
  91.     return t
  92.   }
  93. }, function (e, t, r) {
  94.   "use strict";
  95.   t.__esModule = !0;
  96.   var a = r(0),
  97.     n = r(2);
  98.   t.default = function (e, t) {
  99.     for (var r, u = t[0], f = t[1], i = t[2], o = t[3], s = t[4], c = a.v_qmi(s, o, e), d = 0, l = 0, v = 0; d < f; d++) l = (r = n.step(l, v, d, c, u))[0], v = r[1];
  100.     return [u, f, i, o, s]
  101.   }
  102. }, function (e, t, r) {
  103.   "use strict";
  104.   t.__esModule = !0, t.default = function (e) {
  105.     for (var t = [], r = 0; r < e.length;) {
  106.       var a = e.charCodeAt(r++);
  107.       a < 128 ? t.push(a) : (a < 2048 ? t.push(192 | a >> 6) : (a < 55296 || a >= 57344 || r === e.length ? t.push(224 | a >> 12) : (a = (1023 & a) << 10, a |= 1023 & e.charCodeAt(r++), a += 65536, t.push(240 | a >> 18), t.push(128 | a >> 12 & 63)), t.push(128 | a >> 6 & 63)), t.push(128 | 63 & a))
  108.     }
  109.     return t
  110.   }
  111. }, function (e, t, r) {
  112.   "use strict";
  113.   t.__esModule = !0;
  114.   var a = r(0);
  115.   t.default = function (e, t) {
  116.     for (var r = t[0], n = t[1], u = t[2], f = t[3], i = t[4], o = a.v_qmi(f, e, i), s = 0, c = 0; s < n; c %= 256) r[s++] ^= o[c++];
  117.     return [r, n, u, f, i]
  118.   }
  119. }, function (e, t, r) {
  120.   "use strict";
  121.   t.__esModule = !0;
  122.   var a = r(0);
  123.   t.default = function (e, t) {
  124.     var r = t[0],
  125.       n = t[1],
  126.       u = t[2],
  127.       f = t[3],
  128.       i = t[4];
  129.     return i = a.v_smi(i, f, u, e), f = a.v_smi(f, u, e, i), [r, n, u = a.v_smi(u, e, i, f), f, i]
  130.   }
  131. }, function (e, t, r) {
  132.   "use strict";
  133.   t.__esModule = !0;
  134.   for (var a = ["A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L", "M", "N", "O", "P", "Q", "R", "S", "T", "U", "V", "W", "X", "Y", "Z", "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z", "0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "+", "/"], n = [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, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 43, 47], u = [], f = [], i = [], o = [], s = [], c = [], d = [], l = [], v = 0; v < 64; v++) {
  135.     var h = n[v];
  136.     u[v] = a[v], f[h] = v, i[h] = v << 2, o[h] = v << 4 & 255, s[h] = v << 6 & 255, c[h] = v >> 2, d[h] = v >> 4, l[h] = !0
  137.   }
  138.   var _ = [f, i, o, s, c, d, l];
  139.   t.default = _
  140. }, function (e, t, r) {
  141.   "use strict";
  142.   t.__esModule = !0;
  143.   var a = r(8);
  144.   t.default = function (e, t, r) {
  145.     var n = t + 128,
  146.       u = r - n;
  147.     if (3 & u) throw new Error;
  148.     for (var f = new Array(32), i = new Array(32), o = new Array(32), s = t, c = f, d = 0; s < n;) {
  149.       var l = e.charCodeAt(s++),
  150.         v = e.charCodeAt(s++),
  151.         h = e.charCodeAt(s++),
  152.         _ = e.charCodeAt(s++);
  153.       if (!(a.default[6][l] && a.default[6][v] && a.default[6][h] && a.default[6][_])) throw new Error;
  154.       c[d++] = a.default[1][l] | a.default[5][v], s === t + 88 && (c = o, d = 0), c[d++] = a.default[2][v] | a.default[4][h], s === t + 44 && (c = i, d = 0), c[d++] = a.default[3][h] | a.default[0][_]
  155.     }
  156.     if (0 === u) return [new Uint8Array(0), 0, f, i, o];
  157.     var p = 3 * u >> 2;
  158.     61 === e.charCodeAt(r - 2) ? p -= 2 : 61 === e.charCodeAt(r - 1) && (p -= 1);
  159.     for (var b = new Uint8Array(p), w = n, A = 0; w < r - 4;) {
  160.       var k = e.charCodeAt(w++),
  161.         y = e.charCodeAt(w++),
  162.         M = e.charCodeAt(w++),
  163.         m = e.charCodeAt(w++);
  164.       if (!(a.default[6][k] && a.default[6][y] && a.default[6][M] && a.default[6][m])) throw new Error;
  165.       b[A++] = a.default[1][k] | a.default[5][y], b[A++] = a.default[2][y] | a.default[4][M], b[A++] = a.default[3][M] | a.default[0][m]
  166.     }
  167.     var C = e.charCodeAt(w++),
  168.       g = e.charCodeAt(w++),
  169.       O = e.charCodeAt(w++),
  170.       E = e.charCodeAt(w++);
  171.     if (!a.default[6][C] || !a.default[6][g]) throw new Error;
  172.     if (b[A++] = a.default[1][C] | a.default[5][g], a.default[6][O]) {
  173.       if (b[A++] = a.default[2][g] | a.default[4][O], a.default[6][E]) b[A++] = a.default[3][O] | a.default[0][E];
  174.       else if (61 !== E) throw new Error
  175.     } else if (61 !== O || 61 !== E) throw new Error;
  176.     return [b, p, f, i, o]
  177.   }
  178. }, function (e, t, r) {
  179.   "use strict";
  180.   t.__esModule = !0;
  181.   var a = r(0),
  182.     n = r(2);
  183.   t.default = function (e, t) {
  184.     var r = t[0],
  185.       u = t[1],
  186.       f = t[2],
  187.       i = t[3],
  188.       o = t[4],
  189.       s = (1 | u) - 2,
  190.       c = a.v_qmi(e, f, i);
  191.     return n.default([r, u, f, i, o], c, s)
  192.   }
  193. }, function (e, t, r) {
  194.   "use strict";
  195.   t.__esModule = !0;
  196.   var a = r(1),
  197.     n = r(3);
  198.   t.default = function (e, t) {
  199.     for (var r = [], u = n.default(t), f = 0, i = 0, o = 0; f < e.length; f++) {
  200.       o = (o + u[i = (i + 1) % 256]) % 256, a.default(u, i, o);
  201.       var s = (u[i] + u[o]) % 256;
  202.       r.push(e[f] ^ u[s])
  203.     }
  204.     return r
  205.   }
  206. }, function (e, t, r) {
  207.   "use strict";
  208.   t.__esModule = !0;
  209.   var a = r(0),
  210.     n = r(2);
  211.   t.default = function (e, t) {
  212.     var r = t[0],
  213.       u = t[1],
  214.       f = t[2],
  215.       i = t[3],
  216.       o = t[4],
  217.       s = u - 1 & -2,
  218.       c = a.v_qmi(o, e, f);
  219.     return n.default([r, u, f, i, o], c, s)
  220.   }
  221. }, function (e, t, r) {
  222.   "use strict";
  223.  
  224.   function a(e) {
  225.     for (var t = new Array(64), r = 0, a = 0; r < 32; r++) t[a++] = n(e[r] >>> 4), t[a++] = n(15 & e[r]);
  226.     return String.fromCharCode.apply(String, t)
  227.   }
  228.  
  229.   function n(e) {
  230.     return (e < 10 ? 48 : 87) + e
  231.   }
  232.   t.__esModule = !0, t.keyToStr = void 0, t.default = function (e) {
  233.     for (var t = e[0], r = e[1], n = e[2], f = e[3], i = e[4], o = [], s = 0; s < r;) {
  234.       var c = t[s++];
  235.       if (c < 128) o.push(c);
  236.       else {
  237.         var d = t[s];
  238.         if (s >= r || c < 194 || c > 244 || !u(d) || 224 === c && d < 160 || 237 === c && d >= 160 || 240 === c && d < 144 || 244 === c && d >= 144) o.push(65533);
  239.         else if (s++, c < 224) o.push(63 & d | (31 & c) << 6);
  240.         else {
  241.           var l = t[s];
  242.           if (s >= r || !u(l)) o.push(65533);
  243.           else if (s++, c < 240) o.push(63 & l | (63 & d) << 6 | (15 & c) << 12);
  244.           else {
  245.             var v = t[s];
  246.             if (s >= r || !u(v)) o.push(65533);
  247.             else {
  248.               s++;
  249.               var h = (48 & l) >> 4 | (63 & d) << 2 | (7 & c) << 8,
  250.                 _ = 63 & v | (15 & l) << 6;
  251.               o.push(55232 + h), o.push(56320 + _)
  252.             }
  253.           }
  254.         }
  255.       }
  256.     }
  257.     return [o.map(function (e) {
  258.       return String.fromCharCode(e)
  259.     }).join(""), a(n), a(f), a(i), n, f, i]
  260.   }, t.keyToStr = a;
  261.   var u = function (e) {
  262.     return 128 == (192 & e)
  263.   }
  264. }, function (e, t, r) {
  265.   "use strict";
  266.   t.__esModule = !0;
  267.   var a = r(1);
  268.  
  269.   function n(e, t, r) {
  270.     for (var a = 0; a < 32; a++) e = e + r[a] & 255, t ^= r[a];
  271.     return [e, t]
  272.   }
  273.  
  274.   function u(e, t, r) {
  275.     for (var n = e; t > e; t--, n--) a.default(r, t, n)
  276.   }
  277.   t.default = function (e, t) {
  278.     var r, a, i = t[0],
  279.       o = t[1],
  280.       s = t[2],
  281.       c = t[3],
  282.       d = t[4],
  283.       l = [],
  284.       v = 0,
  285.       h = [],
  286.       _ = [],
  287.       p = [];
  288.     switch (e) {
  289.       case 3:
  290.         l = s, v = 32, 32, h = c, _ = d, p = null;
  291.         break;
  292.       case 2:
  293.         l = c, v = 32, 32, h = s, _ = d, p = null;
  294.         break;
  295.       case 1:
  296.         l = d, v = 32, 32, h = s, _ = c, p = null;
  297.         break;
  298.       case 0:
  299.         l = i, v = o, 65536, h = s, _ = c, p = d
  300.     }
  301.     var b = n(0, 0, h),
  302.       w = b[0],
  303.       A = b[1];
  304.     w = (r = n(w, A, _))[0], A = r[1], p && (w = (a = n(w, A, p))[0], A = a[1]);
  305.     for (var k = !f(w, 2), y = !f(w, 4), M = !f(w, 8), m = A >>> 5, C = 8 - m, g = 0, O = [], E = g + 32, S = void 0, j = void 0, x = void 0, q = void 0, T = void 0, P = void 0, U = void 0, J = void 0; g < v;) {
  306.       for ((S = (E = g + 32) > v) ? j = (E = v) - g : j = 32, P = w, U = A, q = 0, T = g; q < j;) x = l[T++], k && (x = (85 & x) << 1 | x >>> 1 & 85), y && (x = (51 & x) << 2 | x >>> 2 & 51), M && (x = (15 & x) << 4 | x >>> 4 & 15), O[q++] = x, P = P + x & 255, U ^= x;
  307.       for (var K = 0; K < j; K++)
  308.         for (var R = 1; R <= 6; R++) {
  309.           var D = Math.pow(2, R);
  310.           if (!f(K, D - 1)) break;
  311.           f(P, D) || u(K - Math.pow(2, R - 1), K, O)
  312.         }
  313.       if (J = U >>> 3, S ? J %= j : J &= 31, 0 === m)
  314.         for (R = g, K = j - J; R < E;) K === j && (K = 0), l[R++] = O[K++];
  315.       else
  316.         for (R = g, K = j - J - 1; R < E;) x = O[K] << C, ++K === j && (K = 0), x |= O[K] >>> m, l[R++] = 255 & x;
  317.       g = E
  318.     }
  319.     return [i, o, s, c, d]
  320.   };
  321.   var f = function (e, t) {
  322.     return (e & t) === t
  323.   }
  324. }, function (e, t, r) {
  325.   "use strict";
  326.   t.__esModule = !0, t.default = function (e) {
  327.     for (var t, r, a = e[0], n = e[1], u = e[2], f = e[3], i = e[4], o = Math.min(32, n), s = 0; s < o; s++) {
  328.       var c = a[s] ^ u[s] ^ f[s] ^ i[s];
  329.       switch (12 & c) {
  330.         case 0:
  331.           t = u[s];
  332.           break;
  333.         case 4:
  334.           t = f[s];
  335.           break;
  336.         case 8:
  337.           t = i[s];
  338.           break;
  339.         case 12:
  340.           t = a[s]
  341.       }
  342.       switch (3 & c) {
  343.         case 0:
  344.           r = u[s], u[s] = t;
  345.           break;
  346.         case 1:
  347.           r = f[s], f[s] = t;
  348.           break;
  349.         case 2:
  350.           r = i[s], i[s] = t;
  351.           break;
  352.         case 3:
  353.           r = a[s], a[s] = t
  354.       }
  355.       switch (12 & c) {
  356.         case 0:
  357.           u[s] = r;
  358.           break;
  359.         case 4:
  360.           f[s] = r;
  361.           break;
  362.         case 8:
  363.           i[s] = r;
  364.           break;
  365.         case 12:
  366.           a[s] = r
  367.       }
  368.       switch (192 & c) {
  369.         case 0:
  370.           t = u[s];
  371.           break;
  372.         case 64:
  373.           t = f[s];
  374.           break;
  375.         case 128:
  376.           t = i[s];
  377.           break;
  378.         case 192:
  379.           t = a[s]
  380.       }
  381.       switch (48 & c) {
  382.         case 0:
  383.           r = u[s], u[s] = t;
  384.           break;
  385.         case 16:
  386.           r = f[s], f[s] = t;
  387.           break;
  388.         case 32:
  389.           r = i[s], i[s] = t;
  390.           break;
  391.         case 48:
  392.           r = a[s], a[s] = t
  393.       }
  394.       switch (192 & c) {
  395.         case 0:
  396.           u[s] = r;
  397.           break;
  398.         case 64:
  399.           f[s] = r;
  400.           break;
  401.         case 128:
  402.           i[s] = r;
  403.           break;
  404.         case 192:
  405.           a[s] = r
  406.       }
  407.     }
  408.     return [a, n, u, f, i]
  409.   }
  410. }, function (e, t, r) {
  411.   "use strict";
  412.   t.__esModule = !0;
  413.   var a = r(15),
  414.     n = r(14),
  415.     u = r(13),
  416.     f = r(12),
  417.     i = r(10),
  418.     o = r(9),
  419.     s = r(7),
  420.     c = r(6),
  421.     d = r(5),
  422.     l = r(4),
  423.     v = '"data":"',
  424.     h = function () {
  425.       function e(e, t) {
  426.         if (void 0 === t && (t = "configuration_pack.json"), this.content = e, this.dataOffset = e.indexOf(v) + v.length, this.dataEndOffset = e.indexOf('"', this.dataOffset), this.dataEndOffset - this.dataOffset < 128) throw new Error;
  427.         this.filenameKey = d.default(t)
  428.       }
  429.       return e.prototype.decode = function () {
  430.         var e = this.createScript(this.filenameKey).reduce(function (e, t) {
  431.             return t(e)
  432.           }, o.default(this.content, this.dataOffset, this.dataEndOffset)),
  433.           t = u.default(e);
  434.         return t[0] = JSON.parse(t[0]), t
  435.       }, e.prototype.createScript = function (e) {
  436.         return [n.default.bind(null, 0), c.default.bind(null, e), i.default.bind(null, e), f.default.bind(null, e), a.default, s.default.bind(null, e), n.default.bind(null, 1), n.default.bind(null, 2), n.default.bind(null, 3), l.default.bind(null, e)]
  437.       }, e
  438.     }();
  439.   t.default = h
  440. }, function (e, t, r) {
  441.   const a = r(16);
  442.   t.__esModule = !0, e.exports = {
  443.     decode: function (e) {
  444.       return new a.default(e, "configuration_pack.json").decode()
  445.     }
  446.   }
  447. }]);

欢迎访问Greasy Fork镜像

土豆服务器，请按需使用

镜像地址随时可能被墙，建议加群获取最新地址

加入Q群

QingJ © 2025

镜像随时可能失效，请加Q群300939539或关注我们的公众号极客氢云获取最新地址