@floating-live/bilibili 0.16.0 → 0.16.1

package/utils/fp2.d.ts

@@ -1,7 +0,0 @@
-export declare const x64Add: (m: any[], n: any[]) => number[];
-export declare const x64Multiply: (m: any[], n: number[]) => number[];
-export declare const x64Rotl: (m: any[], n: number) => any[];
-export declare const x64LeftShift: (m: any[], n: number) => any[];
-export declare const x64Xor: (m: any[], n: any[]) => number[];
-export declare const x64Fmix: (h: any[]) => any[];
-export declare const x64hash128: (key: string, seed: number) => string;

package/utils/fp2.js

@@ -1,234 +0,0 @@
-/// MurmurHash3 related functions
-//
-// Given two 64bit ints (as an array of two 32bit ints) returns the two
-// added together as a 64bit int (as an array of two 32bit ints).
-//
-export const x64Add = function (m, n) {
-    m = [m[0] >>> 16, m[0] & 0xffff, m[1] >>> 16, m[1] & 0xffff];
-    n = [n[0] >>> 16, n[0] & 0xffff, n[1] >>> 16, n[1] & 0xffff];
-    var o = [0, 0, 0, 0];
-    o[3] += m[3] + n[3];
-    o[2] += o[3] >>> 16;
-    o[3] &= 0xffff;
-    o[2] += m[2] + n[2];
-    o[1] += o[2] >>> 16;
-    o[2] &= 0xffff;
-    o[1] += m[1] + n[1];
-    o[0] += o[1] >>> 16;
-    o[1] &= 0xffff;
-    o[0] += m[0] + n[0];
-    o[0] &= 0xffff;
-    return [(o[0] << 16) | o[1], (o[2] << 16) | o[3]];
-};
-//
-// Given two 64bit ints (as an array of two 32bit ints) returns the two
-// multiplied together as a 64bit int (as an array of two 32bit ints).
-//
-export const x64Multiply = function (m, n) {
-    m = [m[0] >>> 16, m[0] & 0xffff, m[1] >>> 16, m[1] & 0xffff];
-    n = [n[0] >>> 16, n[0] & 0xffff, n[1] >>> 16, n[1] & 0xffff];
-    var o = [0, 0, 0, 0];
-    o[3] += m[3] * n[3];
-    o[2] += o[3] >>> 16;
-    o[3] &= 0xffff;
-    o[2] += m[2] * n[3];
-    o[1] += o[2] >>> 16;
-    o[2] &= 0xffff;
-    o[2] += m[3] * n[2];
-    o[1] += o[2] >>> 16;
-    o[2] &= 0xffff;
-    o[1] += m[1] * n[3];
-    o[0] += o[1] >>> 16;
-    o[1] &= 0xffff;
-    o[1] += m[2] * n[2];
-    o[0] += o[1] >>> 16;
-    o[1] &= 0xffff;
-    o[1] += m[3] * n[1];
-    o[0] += o[1] >>> 16;
-    o[1] &= 0xffff;
-    o[0] += m[0] * n[3] + m[1] * n[2] + m[2] * n[1] + m[3] * n[0];
-    o[0] &= 0xffff;
-    return [(o[0] << 16) | o[1], (o[2] << 16) | o[3]];
-};
-//
-// Given a 64bit int (as an array of two 32bit ints) and an int
-// representing a number of bit positions, returns the 64bit int (as an
-// array of two 32bit ints) rotated left by that number of positions.
-//
-export const x64Rotl = function (m, n) {
-    n %= 64;
-    if (n === 32) {
-        return [m[1], m[0]];
-    }
-    else if (n < 32) {
-        return [
-            (m[0] << n) | (m[1] >>> (32 - n)),
-            (m[1] << n) | (m[0] >>> (32 - n)),
-        ];
-    }
-    else {
-        n -= 32;
-        return [
-            (m[1] << n) | (m[0] >>> (32 - n)),
-            (m[0] << n) | (m[1] >>> (32 - n)),
-        ];
-    }
-};
-//
-// Given a 64bit int (as an array of two 32bit ints) and an int
-// representing a number of bit positions, returns the 64bit int (as an
-// array of two 32bit ints) shifted left by that number of positions.
-//
-export const x64LeftShift = function (m, n) {
-    n %= 64;
-    if (n === 0) {
-        return m;
-    }
-    else if (n < 32) {
-        return [(m[0] << n) | (m[1] >>> (32 - n)), m[1] << n];
-    }
-    else {
-        return [m[1] << (n - 32), 0];
-    }
-};
-//
-// Given two 64bit ints (as an array of two 32bit ints) returns the two
-// xored together as a 64bit int (as an array of two 32bit ints).
-//
-export const x64Xor = function (m, n) {
-    return [m[0] ^ n[0], m[1] ^ n[1]];
-};
-//
-// Given a block, returns murmurHash3's final x64 mix of that block.
-// (`[0, h[0] >>> 1]` is a 33 bit unsigned right shift. This is the
-// only place where we need to right shift 64bit ints.)
-//
-export const x64Fmix = function (h) {
-    h = x64Xor(h, [0, h[0] >>> 1]);
-    h = x64Multiply(h, [0xff51afd7, 0xed558ccd]);
-    h = x64Xor(h, [0, h[0] >>> 1]);
-    h = x64Multiply(h, [0xc4ceb9fe, 0x1a85ec53]);
-    h = x64Xor(h, [0, h[0] >>> 1]);
-    return h;
-};
-//
-// Given a string and an optional seed as an int, returns a 128 bit
-// hash using the x64 flavor of MurmurHash3, as an unsigned hex.
-//
-export const x64hash128 = function (key, seed) {
-    key = key || "";
-    seed = seed || 0;
-    var remainder = key.length % 16;
-    var bytes = key.length - remainder;
-    var h1 = [0, seed];
-    var h2 = [0, seed];
-    var k1 = [0, 0];
-    var k2 = [0, 0];
-    var c1 = [0x87c37b91, 0x114253d5];
-    var c2 = [0x4cf5ad43, 0x2745937f];
-    for (var i = 0; i < bytes; i = i + 16) {
-        k1 = [
-            (key.charCodeAt(i + 4) & 0xff) |
-                ((key.charCodeAt(i + 5) & 0xff) << 8) |
-                ((key.charCodeAt(i + 6) & 0xff) << 16) |
-                ((key.charCodeAt(i + 7) & 0xff) << 24),
-            (key.charCodeAt(i) & 0xff) |
-                ((key.charCodeAt(i + 1) & 0xff) << 8) |
-                ((key.charCodeAt(i + 2) & 0xff) << 16) |
-                ((key.charCodeAt(i + 3) & 0xff) << 24),
-        ];
-        k2 = [
-            (key.charCodeAt(i + 12) & 0xff) |
-                ((key.charCodeAt(i + 13) & 0xff) << 8) |
-                ((key.charCodeAt(i + 14) & 0xff) << 16) |
-                ((key.charCodeAt(i + 15) & 0xff) << 24),
-            (key.charCodeAt(i + 8) & 0xff) |
-                ((key.charCodeAt(i + 9) & 0xff) << 8) |
-                ((key.charCodeAt(i + 10) & 0xff) << 16) |
-                ((key.charCodeAt(i + 11) & 0xff) << 24),
-        ];
-        k1 = x64Multiply(k1, c1);
-        k1 = x64Rotl(k1, 31);
-        k1 = x64Multiply(k1, c2);
-        h1 = x64Xor(h1, k1);
-        h1 = x64Rotl(h1, 27);
-        h1 = x64Add(h1, h2);
-        h1 = x64Add(x64Multiply(h1, [0, 5]), [0, 0x52dce729]);
-        k2 = x64Multiply(k2, c2);
-        k2 = x64Rotl(k2, 33);
-        k2 = x64Multiply(k2, c1);
-        h2 = x64Xor(h2, k2);
-        h2 = x64Rotl(h2, 31);
-        h2 = x64Add(h2, h1);
-        h2 = x64Add(x64Multiply(h2, [0, 5]), [0, 0x38495ab5]);
-    }
-    k1 = [0, 0];
-    k2 = [0, 0];
-    switch (remainder) {
-        case 15:
-            k2 = x64Xor(k2, x64LeftShift([0, key.charCodeAt(i + 14)], 48));
-        // fallthrough
-        case 14:
-            k2 = x64Xor(k2, x64LeftShift([0, key.charCodeAt(i + 13)], 40));
-        // fallthrough
-        case 13:
-            k2 = x64Xor(k2, x64LeftShift([0, key.charCodeAt(i + 12)], 32));
-        // fallthrough
-        case 12:
-            k2 = x64Xor(k2, x64LeftShift([0, key.charCodeAt(i + 11)], 24));
-        // fallthrough
-        case 11:
-            k2 = x64Xor(k2, x64LeftShift([0, key.charCodeAt(i + 10)], 16));
-        // fallthrough
-        case 10:
-            k2 = x64Xor(k2, x64LeftShift([0, key.charCodeAt(i + 9)], 8));
-        // fallthrough
-        case 9:
-            k2 = x64Xor(k2, [0, key.charCodeAt(i + 8)]);
-            k2 = x64Multiply(k2, c2);
-            k2 = x64Rotl(k2, 33);
-            k2 = x64Multiply(k2, c1);
-            h2 = x64Xor(h2, k2);
-        // fallthrough
-        case 8:
-            k1 = x64Xor(k1, x64LeftShift([0, key.charCodeAt(i + 7)], 56));
-        // fallthrough
-        case 7:
-            k1 = x64Xor(k1, x64LeftShift([0, key.charCodeAt(i + 6)], 48));
-        // fallthrough
-        case 6:
-            k1 = x64Xor(k1, x64LeftShift([0, key.charCodeAt(i + 5)], 40));
-        // fallthrough
-        case 5:
-            k1 = x64Xor(k1, x64LeftShift([0, key.charCodeAt(i + 4)], 32));
-        // fallthrough
-        case 4:
-            k1 = x64Xor(k1, x64LeftShift([0, key.charCodeAt(i + 3)], 24));
-        // fallthrough
-        case 3:
-            k1 = x64Xor(k1, x64LeftShift([0, key.charCodeAt(i + 2)], 16));
-        // fallthrough
-        case 2:
-            k1 = x64Xor(k1, x64LeftShift([0, key.charCodeAt(i + 1)], 8));
-        // fallthrough
-        case 1:
-            k1 = x64Xor(k1, [0, key.charCodeAt(i)]);
-            k1 = x64Multiply(k1, c1);
-            k1 = x64Rotl(k1, 31);
-            k1 = x64Multiply(k1, c2);
-            h1 = x64Xor(h1, k1);
-        // fallthrough
-    }
-    h1 = x64Xor(h1, [0, key.length]);
-    h2 = x64Xor(h2, [0, key.length]);
-    h1 = x64Add(h1, h2);
-    h2 = x64Add(h2, h1);
-    h1 = x64Fmix(h1);
-    h2 = x64Fmix(h2);
-    h1 = x64Add(h1, h2);
-    h2 = x64Add(h2, h1);
-    return (("00000000" + (h1[0] >>> 0).toString(16)).slice(-8) +
-        ("00000000" + (h1[1] >>> 0).toString(16)).slice(-8) +
-        ("00000000" + (h2[0] >>> 0).toString(16)).slice(-8) +
-        ("00000000" + (h2[1] >>> 0).toString(16)).slice(-8));
-};

package/utils/index.d.ts

@@ -1 +0,0 @@
-export * from "./request";

package/utils/index.js

@@ -1 +0,0 @@
-export * from "./request";

package/utils/lsid.d.ts

@@ -1 +0,0 @@
-export declare function generateLsid(): string;

package/utils/lsid.js

@@ -1,15 +0,0 @@
-// 模拟Rust的random_string!宏
-function randomString(len, charset) {
-    const chars = charset.split("");
-    const charsetLength = chars.length;
-    return Array.from({ length: len }, () => chars[Math.floor(Math.random() * charsetLength)]).join("");
-}
-// 主函数
-export function generateLsid() {
-    const randomPart = randomString(8, "0123456789ABCDEF" // 保持全大写十六进制特征
-    );
-    const timestampPart = Date.now()
-        .toString(16) // 转换为十六进制
-        .toUpperCase(); // 保持与Rust的:X格式一致
-    return `${randomPart}_${timestampPart}`;
-}

package/utils/randomImage.d.ts

@@ -1,2 +0,0 @@
-/** 生成随机的base64图片数据 */
-export declare function generateRandomPngBase64(): string;

package/utils/randomImage.js

@@ -1,107 +0,0 @@
-// Generated by Deepseek
-/** 生成随机的base64图片数据 */
-export function generateRandomPngBase64() {
-    // 生成带过滤头的随机像素数据
-    const pixelData = new Uint8Array(20 * (20 * 4 + 1));
-    for (let y = 0, offset = 0; y < 20; y++) {
-        pixelData[offset++] = 0; // 过滤类型
-        for (let x = 0; x < 20; x++) {
-            pixelData[offset++] = Math.floor(Math.random() * 256); // R
-            pixelData[offset++] = Math.floor(Math.random() * 256); // G
-            pixelData[offset++] = Math.floor(Math.random() * 256); // B
-            pixelData[offset++] = 255; // A
-        }
-    }
-    // 计算Adler32校验和
-    const computeAdler32 = (data) => {
-        let s1 = 1, s2 = 0;
-        for (const byte of data) {
-            s1 = (s1 + byte) % 65521;
-            s2 = (s2 + s1) % 65521;
-        }
-        return (s2 << 16) | s1;
-    };
-    // 构造Deflate流
-    const deflateStream = new Uint8Array([
-        0x78,
-        0x01, // Zlib头
-        0x00, // BFINAL=0，BTYPE=00（非最后块）
-        0x54,
-        0x06, // LEN=1620
-        0xab,
-        0xf9, // NLEN=~1620
-        ...pixelData,
-        ...new Uint8Array([
-            // Adler32
-            (computeAdler32(pixelData) >> 24) & 0xff,
-            (computeAdler32(pixelData) >> 16) & 0xff,
-            (computeAdler32(pixelData) >> 8) & 0xff,
-            computeAdler32(pixelData) & 0xff,
-        ]),
-    ]);
-    // 计算CRC32
-    const computeCRC32 = (data) => {
-        let crc = 0xffffffff;
-        const table = new Uint32Array(256);
-        for (let i = 0; i < 256; i++) {
-            let c = i;
-            for (let j = 0; j < 8; j++) {
-                c = c & 1 ? 0xedb88320 ^ (c >>> 1) : c >>> 1;
-            }
-            table[i] = c;
-        }
-        for (const byte of data) {
-            crc = table[(crc ^ byte) & 0xff] ^ (crc >>> 8);
-        }
-        return crc ^ 0xffffffff;
-    };
-    // 创建PNG块
-    const createChunk = (type, data) => {
-        const typeBytes = new TextEncoder().encode(type);
-        const length = new Uint8Array(4);
-        length[0] = (data.length >> 24) & 0xff;
-        length[1] = (data.length >> 16) & 0xff;
-        length[2] = (data.length >> 8) & 0xff;
-        length[3] = data.length & 0xff;
-        const chunkData = new Uint8Array([...typeBytes, ...data]);
-        const crc = computeCRC32(chunkData);
-        const crcBytes = new Uint8Array(4);
-        crcBytes[0] = (crc >> 24) & 0xff;
-        crcBytes[1] = (crc >> 16) & 0xff;
-        crcBytes[2] = (crc >> 8) & 0xff;
-        crcBytes[3] = crc & 0xff;
-        return new Uint8Array([...length, ...chunkData, ...crcBytes]);
-    };
-    // 构建PNG结构
-    const signature = new Uint8Array([
-        0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a,
-    ]);
-    const ihdrData = new Uint8Array([
-        0x00,
-        0x00,
-        0x00,
-        0x14, // 宽度20
-        0x00,
-        0x00,
-        0x00,
-        0x14, // 高度20
-        0x08, // 位深度
-        0x06, // 颜色类型（RGBA）
-        0x00, // 压缩方法
-        0x00, // 滤波方法
-        0x00, // 隔行扫描
-    ]);
-    const ihdrChunk = createChunk("IHDR", ihdrData);
-    const idatChunk = createChunk("IDAT", deflateStream);
-    const iendChunk = createChunk("IEND", new Uint8Array(0));
-    // 合并所有数据
-    const pngData = new Uint8Array([
-        ...signature,
-        ...ihdrChunk,
-        ...idatChunk,
-        ...iendChunk,
-    ]);
-    // 转换为Base64
-    const base64 = btoa(String.fromCharCode(...pngData));
-    return `data:image/png;base64,${base64}`;
-}

package/utils/uuid.d.ts

@@ -1 +0,0 @@
-export declare function generateUuid(): string;

package/utils/uuid.js

@@ -1,45 +0,0 @@
-// Refactored by Deepseek
-// from `https://github.com/SocialSisterYi/bilibili-API-collect/issues/933#issue-2073916390`
-// Copyright (c) 2024 Hantong Chen(cxw620). MIT license.
-// RE from `https://s1.hdslb.com/bfs/seed/log/report/log-reporter.js`
-// 工具函数代替Rust宏
-const DIGIT_MAP = [
-    "1",
-    "2",
-    "3",
-    "4",
-    "5",
-    "6",
-    "7",
-    "8",
-    "9",
-    "A",
-    "B",
-    "C",
-    "D",
-    "E",
-    "F",
-    "10", // 保持原始数据不变
-];
-// 代替random_choice!宏
-function randomChoice(...args) {
-    // 参数解析
-    const hasSeparator = typeof args[args.length - 2] === "string";
-    const [choiceSet, separator, lengths] = hasSeparator
-        ? [args.pop(), args.pop(), args]
-        : [args.pop(), undefined, args];
-    // 生成随机段
-    const segments = lengths.map((length) => Array.from({ length }, () => choiceSet[Math.floor(Math.random() * choiceSet.length)]).join(""));
-    return separator ? segments.join(separator) : segments.join("");
-}
-// 代替now!宏
-function getTimestamp() {
-    return Date.now() % 100000;
-}
-// 代替UuidInfoc结构体
-export function generateUuid() {
-    const t = getTimestamp().toString().padStart(5, "0");
-    // 生成符合原始格式的各个部分
-    const parts = [randomChoice(8, 4, 4, 4, 12, "-", DIGIT_MAP), t, "infoc"];
-    return parts.join("");
-}