拼多多集成

2025-09-12 20:42:00 +08:00
commit e9361b4c87
25 changed files with 22234 additions and 0 deletions
--- a/static/js/get_uuid.js
+++ b/static/js/get_uuid.js
@@ -0,0 +1,77 @@
+function n(n, o) {
+    var r = {bw: 1707, bh: 924}
+        , a = "https://sz.jd.com/szweb/sz/view/productAnalysis/productDetail.html"
+        ,
+        d = "Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/104.0.0.0 Safari/537.36"
+        ,
+        c = "__jdv=122270672|direct|-|none|-|1692254561099; __jdu=1692254561098125451041; wlfstk_smdl=rn7jesxgevs0yntcfsrvjfjbf9aj2dsu; 3AB9D23F7A4B3C9B=BYLR4QCYOYVQIQXRCKH3XB4O527FC3NKDAZ5PPDA5IJXSVN4CP5EFUHUOGB5PH3EXMGZ22JDTYS4DYHMPBHQVEYMG4; TrackID=1PQ9rNMOyjMYOPORod42pcTTsm8qhbKU7seozK_5G2_kuSCeqHl8UUPY3sAceTY_7QTKUv5aNu389rgQyTIrARUZi05BEmI_p9bHTugk8-KU; pinId=MOUYfPJVXga1ffsfn98I-w; pin=%E4%B8%B8%E7%BE%8EIT; unick=%E4%B8%B8%E7%BE%8EIT; ceshi3.com=000; _tp=FSAH7V3VJiXcG2VMtstR1QteqtxBRgaiAg%2FWx4nnI2A%3D; b-sec=JFN3AQWC6KONG2C2JXN4V6Y3D5SHVFAJBDTEQIVPR3QXUB6C6YUBAQXVYUWZI4PW; is_sz_old_version=false; __jda=251704139.1692254561098125451041.1692254561.1692254561.1692254561.1; __jdc=251704139; __jdb=251704139.5.1692254561098125451041|1.1692254561"
+        , s = 1e9 * Math.random() << 0
+        , p = (new Date).getTime()
+        , m = t(e([r.bw + "" + r.bh, a, d, c, s, p, n].join("-"))).slice(20);
+    return o ? m : m + "-" + p.toString(16)
+}
+
+function t(n) {
+    for (var o = "", e = 0; e < n.length; e++) {
+        var t = n[e].toString(16);
+        o += t = 1 === t.length ? "0" + t : t
+    }
+    return o
+}
+
+
+function e(n) {
+    function o(n, o) {
+        return n << o | n >>> 32 - o
+    }
+
+    var e = [1518500249, 1859775393, 2400959708, 3395469782]
+        , t = [1732584193, 4023233417, 2562383102, 271733878, 3285377520];
+    if ("string" == typeof n) {
+        var i = unescape(encodeURIComponent(n));
+        n = new Array(i.length);
+        for (c = 0; c < i.length; c++)
+            n[c] = i.charCodeAt(c)
+    }
+    n.push(128);
+    for (var r = n.length / 4 + 2, a = Math.ceil(r / 16), d = new Array(a), c = 0; c < a; c++) {
+        d[c] = new Array(16);
+        for (var s = 0; s < 16; s++)
+            d[c][s] = n[64 * c + 4 * s] << 24 | n[64 * c + 4 * s + 1] << 16 | n[64 * c + 4 * s + 2] << 8 | n[64 * c + 4 * s + 3]
+    }
+    d[a - 1][14] = 8 * (n.length - 1) / Math.pow(2, 32),
+        d[a - 1][14] = Math.floor(d[a - 1][14]),
+        d[a - 1][15] = 8 * (n.length - 1) & 4294967295;
+    for (c = 0; c < a; c++) {
+        for (var p = new Array(80), m = 0; m < 16; m++)
+            p[m] = d[c][m];
+        for (m = 16; m < 80; m++)
+            p[m] = o(p[m - 3] ^ p[m - 8] ^ p[m - 14] ^ p[m - 16], 1);
+        for (var w = t[0], f = t[1], g = t[2], u = t[3], _ = t[4], m = 0; m < 80; m++) {
+            var h = Math.floor(m / 20)
+                , l = o(w, 5) + function (n, o, e, t) {
+                switch (n) {
+                    case 0:
+                        return o & e ^ ~o & t;
+                    case 1:
+                        return o ^ e ^ t;
+                    case 2:
+                        return o & e ^ o & t ^ e & t;
+                    case 3:
+                        return o ^ e ^ t
+                }
+            }(h, f, g, u) + _ + e[h] + p[m] >>> 0;
+            _ = u,
+                u = g,
+                g = o(f, 30) >>> 0,
+                f = w,
+                w = l
+        }
+        t[0] = t[0] + w >>> 0,
+            t[1] = t[1] + f >>> 0,
+            t[2] = t[2] + g >>> 0,
+            t[3] = t[3] + u >>> 0,
+            t[4] = t[4] + _ >>> 0
+    }
+    return [t[0] >> 24 & 255, t[0] >> 16 & 255, t[0] >> 8 & 255, 255 & t[0], t[1] >> 24 & 255, t[1] >> 16 & 255, t[1] >> 8 & 255, 255 & t[1], t[2] >> 24 & 255, t[2] >> 16 & 255, t[2] >> 8 & 255, 255 & t[2], t[3] >> 24 & 255, t[3] >> 16 & 255, t[3] >> 8 & 255, 255 & t[3], t[4] >> 24 & 255, t[4] >> 16 & 255, t[4] >> 8 & 255, 255 & t[4]]
+}