sonic-ws 1.3.2 → 1.3.3

package/dist/ws/util/packets/BatchHelper.js

@@ -1,6 +1,85 @@
-/**
+"use strict";
+/*
  * Copyright 2026 Lily (liwybloc)
- * Licensed under the Apache License, Version 2.0.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
  */
-
-Object.defineProperty(exports,"__esModule",{value:!0}),exports.BatchHelper=void 0;const t=require("../BufferUtil"),e=require("./CompressionUtil");exports.BatchHelper=class{batchInfo={};batchTimeouts={};batchedData={};conn;registerSendPackets(t,e){this.conn=e,t.getTags().forEach(e=>{const a=t.getPacket(e);if(0==a.dataBatching)return;const s=t.getKey(e);this.initiateBatch(s,a.dataBatching,a.gzipCompression)})}initiateBatch(t,e,a){this.batchedData[t]=[],this.batchInfo[t]=[e,a]}startBatch(a){const[s,c]=this.batchInfo[a];this.batchTimeouts[a]=this.conn.setInterval(async()=>{if(0==this.batchedData[a].length)return;const s=new Uint8Array(this.batchedData[a]);this.conn.raw_send((0,t.toPacketBuffer)(a,c?await(0,e.compressGzip)(s):s)),this.batchedData[a]=[],delete this.batchTimeouts[a]},s)}batchPacket(t,a){const s=this.batchedData[t];s.push(...(0,e.convertVarInt)(a.length)),a.forEach(t=>s.push(t)),this.batchTimeouts[t]||this.startBatch(t)}static async unravelBatch(t,a,s){const c=t.gzipCompression?await(0,e.decompressGzip)(a):a,i=[];for(let a=0;a<c.length;){if(t.maxBatchSize>0&&i.length>t.maxBatchSize)return"Too big of batch";const[h,n]=(0,e.readVarInt)(c,a);if(a=h,a+n>c.length)return"Tampered batch length";const r=c.slice(a,a+=n),o=await t.listen(r,s);if("string"==typeof o)return"Batched packet: "+o;i.push([o[0],!t.dontSpread])}return i}};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BatchHelper = void 0;
+const BufferUtil_1 = require("../BufferUtil");
+const CompressionUtil_1 = require("./CompressionUtil");
+/** @internal */
+class BatchHelper {
+    batchInfo = {};
+    batchTimeouts = {};
+    batchedData = {};
+    conn;
+    registerSendPackets(packetHolder, conn) {
+        this.conn = conn;
+        packetHolder.getTags().forEach(tag => {
+            const packet = packetHolder.getPacket(tag);
+            if (packet.dataBatching == 0)
+                return;
+            const code = packetHolder.getKey(tag);
+            this.initiateBatch(code, packet.dataBatching, packet.gzipCompression);
+        });
+    }
+    initiateBatch(code, time, compressed) {
+        this.batchedData[code] = [];
+        this.batchInfo[code] = [time, compressed];
+    }
+    startBatch(code) {
+        const [time, compressed] = this.batchInfo[code];
+        this.batchTimeouts[code] = this.conn.setInterval(async () => {
+            if (this.batchedData[code].length == 0)
+                return;
+            const data = new Uint8Array(this.batchedData[code]);
+            this.conn.raw_send((0, BufferUtil_1.toPacketBuffer)(code, compressed ? await (0, CompressionUtil_1.compressGzip)(data) : data));
+            this.batchedData[code] = [];
+            delete this.batchTimeouts[code];
+        }, time);
+    }
+    batchPacket(code, data) {
+        const batch = this.batchedData[code];
+        batch.push(...(0, CompressionUtil_1.convertVarInt)(data.length));
+        data.forEach(val => batch.push(val));
+        if (!this.batchTimeouts[code])
+            this.startBatch(code);
+    }
+    static async unravelBatch(packet, _data, socket) {
+        const data = packet.gzipCompression ? await (0, CompressionUtil_1.decompressGzip)(_data) : _data;
+        const result = [];
+        for (let i = 0; i < data.length;) {
+            // must be >0 for it to apply
+            if (packet.maxBatchSize > 0 && result.length > packet.maxBatchSize)
+                return "Too big of batch";
+            // read batch length
+            const [off, varint] = (0, CompressionUtil_1.readVarInt)(data, i);
+            i = off;
+            // if it goes oob it's invalid
+            if (i + varint > data.length)
+                return "Tampered batch length";
+            // read sector
+            const sect = data.slice(i, i += varint);
+            // call the packets listeners
+            const listen = await packet.listen(sect, socket);
+            // if invalid, return that
+            if (typeof listen == 'string')
+                return "Batched packet: " + listen;
+            // store result
+            result.push([listen[0], !packet.dontSpread]);
+        }
+        return result;
+    }
+}
+exports.BatchHelper = BatchHelper;

package/dist/ws/util/packets/CompressionUtil.d.ts

@@ -1,16 +1,12 @@
-/**
- * Copyright 2026 Lily (liwybloc)
- * Licensed under the Apache License, Version 2.0.
- */
 export declare const MAX_BYTE = 255;
 export declare const NEGATIVE_BYTE = 127;
 export declare const MAX_SHORT = 65535;
 export declare const SHORT_CC_OVERFLOW: number;
-export declare const UVARINT_OVERFLOW: number, VARINT_CHAIN_FLAG = 128, 
-NEGATIVE_VARINT: number, 
-VARINT_OVERFLOW: number, 
-MAX_VSECT_SIZE = 7, 
-MAX_UVARINT: number, 
+export declare const UVARINT_OVERFLOW: number, VARINT_CHAIN_FLAG = 128, // flag for chaining
+NEGATIVE_VARINT: number, // splitting usable range in half for signed
+VARINT_OVERFLOW: number, // for varint to overflow with negative; is 64
+MAX_VSECT_SIZE = 7, // max continues
+MAX_UVARINT: number, // max value from this, subtract one for overflow
 MAX_VARINT: number;
 export declare const ONE_EIGHT: number, ONE_FOURTH: number;
 export declare const EMPTY_UINT8: Uint8Array<ArrayBuffer>;

package/dist/ws/util/packets/CompressionUtil.js

@@ -1,6 +1,277 @@
-/**
+"use strict";
+/*
  * Copyright 2026 Lily (liwybloc)
- * Licensed under the Apache License, Version 2.0.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
  */
-
-Object.defineProperty(exports,"__esModule",{value:!0}),exports.bitsToBytes=exports.bytesToBits=exports.decompressBools=exports.compressBools=exports.EMPTY_UINT8=exports.ONE_FOURTH=exports.ONE_EIGHT=exports.MAX_VARINT=exports.MAX_UVARINT=exports.MAX_VSECT_SIZE=exports.VARINT_OVERFLOW=exports.NEGATIVE_VARINT=exports.VARINT_CHAIN_FLAG=exports.UVARINT_OVERFLOW=exports.SHORT_CC_OVERFLOW=exports.MAX_SHORT=exports.NEGATIVE_BYTE=exports.MAX_BYTE=void 0,exports.fromShort=o,exports.toShort=n,exports.toByte=function(t){if(!isFinite(t))throw new Error("Can only use real numbers in bytes: "+t);if(t>exports.MAX_BYTE||t<-exports.MAX_BYTE-1)throw new Error(`Byte Numbers must be within range -${exports.MAX_BYTE+1} and ${exports.MAX_BYTE}: ${t}`);return t},exports.convertFloat=function(t){if(isNaN(t))return T(0,A,1);const r=t<0?1:0;if(0==(t=Math.abs(t)))return T(r,0,0);const o=Math.floor(Math.log(t)/Math.LN2);if(o>127||o<-126)return T(r,255,0);const n=t/e(o),s=Math.round((n-1)*e(23));return T(r,o+127,8388607&s)},exports.deconvertFloat=function(t){const r=t.map(t=>t.toString(2).padStart(8,"0")).join(""),o=p(r[0]),n=p(r.slice(1,9)),i=0==n?-126:n-127,a=function(t,r){const o=p(t);let n=0;for(let t=0;t<s;t++)o&1<<s-t-1&&(n+=e(-(t+1)));return(r?1:0)+n}(r.slice(9,32),0!=n);let u;u=n==A?0==a?1/0:NaN:a*e(i);return 1==o?-u:u},exports.convertDouble=function(t){if(isNaN(t))return _(0,c,1);const r=t<0?1:0;if(!isFinite(t))return _(r,c,0);let o,n;0==(t=Math.abs(t))?(o=0,n=0):(o=Math.floor(Math.log2(t))-51,n=Math.floor(t/e(o)));return _(r,o+1023,n)},exports.deconvertDouble=function(t){const r=t.map(t=>t.toString(2).padStart(8,"0")).join(""),o=p(r[0]),n=p(r.slice(1,12)),s=0==n?-1022:n-1023,i=p(r.slice(12,64));let a;a=n==c?0==i?1/0:NaN:i*e(s);return 1==o?-a:a},exports.mapZigZag=E,exports.demapZigZag=l,exports.demapShort_ZZ=function(t){return l(o(t))},exports.mapShort_ZZ=function(t){return n(E(t))},exports.convertVarInt=function(t){if(t>exports.MAX_UVARINT||t<0)throw new Error(`Variable Ints must be within range 0 and ${exports.MAX_VARINT}: ${t}`);if(0===t)return[0];const r=[];for(;t>0;){let e=127&t;(t>>>=7)>0&&(e|=exports.VARINT_CHAIN_FLAG),r.push(e)}return r},exports.readVarInt=N,exports.deconvertVarInts=function(t){let r=[],e=0;for(;e<t.length;){const[o,n]=N(t,e);r.push(n),e=o}return r},exports.compressGzip=async function(t,r=""){if("undefined"==typeof CompressionStream)throw"undefined"!=typeof window&&window.alert(I),new Error(I);const e=new Blob([t]).stream().pipeThrough(new CompressionStream("deflate-raw")),o=await new Response(e).arrayBuffer();t.length<=o.byteLength&&""!=r&&console.warn("WARN: Packet '"+r+"' is small, and compressing it makes the size bigger!");return new Uint8Array(o)},exports.decompressGzip=async function(t){if("undefined"==typeof DecompressionStream)throw"undefined"!=typeof window&&window.alert(I),new Error(I);const r=new Blob([t]).stream().pipeThrough(new DecompressionStream("deflate-raw")),e=await new Response(r).arrayBuffer();return new Uint8Array(e)},exports.bytesToHex=function(t){return Array.from(t,t=>t.toString(16).padStart(2,"0")).join("")},exports.hexToBytes=function(t){const r=new Uint8Array(t.length/2);for(let e=0;e<t.length;e+=2)r[e/2]=parseInt(t.substring(e,e+2),16);return r};const t=require("../BufferUtil");exports.MAX_BYTE=255,exports.NEGATIVE_BYTE=127,exports.MAX_SHORT=65535,exports.SHORT_CC_OVERFLOW=exports.MAX_BYTE+1,exports.UVARINT_OVERFLOW=exports.NEGATIVE_BYTE+1,exports.VARINT_CHAIN_FLAG=128,exports.NEGATIVE_VARINT=Math.floor(exports.NEGATIVE_BYTE/2),exports.VARINT_OVERFLOW=exports.NEGATIVE_VARINT+1,exports.MAX_VSECT_SIZE=7,exports.MAX_UVARINT=exports.UVARINT_OVERFLOW**exports.MAX_VSECT_SIZE-1,exports.MAX_VARINT=Math.floor(exports.MAX_UVARINT/2),exports.ONE_EIGHT=1/8,exports.ONE_FOURTH=1/4,exports.EMPTY_UINT8=new Uint8Array([]);const r=[],e=t=>r[t]??=Math.pow(2,t);function o(t){return t[0]*exports.SHORT_CC_OVERFLOW+t[1]}function n(t){if(!isFinite(t))throw new Error("Can only use real numbers in shorts: "+t);if(t>exports.MAX_SHORT||t<0)throw new Error(`Short Numbers must be within range 0 and ${exports.MAX_SHORT}`);return[Math.floor(t/exports.SHORT_CC_OVERFLOW),t%exports.SHORT_CC_OVERFLOW]}exports.compressBools=t=>t.reduce((t,r,e)=>t|r<<7-e,0);exports.decompressBools=t=>[...Array(8)].map((r,e)=>!!(t&1<<7-e));const s=23;function p(t){return parseInt(t,2)}const i=8,a=23,u=11,x=52,A=255,c=2047;function f(r,e,o,n,s){const i=o.toString(2)+n.toString(2).padStart(r,"0")+s.toString(2).padStart(e,"0");return(0,t.splitArray)(Array.from(i),8).map(t=>p(t.join("")))}function T(t,r,e){return f(i,a,t,r,e)}function _(t,r,e){return f(u,x,t,r,e)}function E(t){return t<<1^t>>31}function l(t){return t>>>1^-(1&t)}function N(t,r){let e,o=0,n=0;do{e=t[r++],o+=(e&~exports.VARINT_CHAIN_FLAG)<<n,n+=7}while(0!==(e&exports.VARINT_CHAIN_FLAG));return[r,o]}exports.bytesToBits=t=>Array.from(t).map(t=>t.toString(2).padStart(8,"0")).join("");exports.bitsToBytes=t=>new Uint8Array(t.match(/.{1,8}/g)?.map(t=>parseInt(t.padEnd(8,"0"),2))??[]);const I="Your browser is too old to support compression. Please update!";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.bitsToBytes = exports.bytesToBits = exports.decompressBools = exports.compressBools = exports.EMPTY_UINT8 = exports.ONE_FOURTH = exports.ONE_EIGHT = exports.MAX_VARINT = exports.MAX_UVARINT = exports.MAX_VSECT_SIZE = exports.VARINT_OVERFLOW = exports.NEGATIVE_VARINT = exports.VARINT_CHAIN_FLAG = exports.UVARINT_OVERFLOW = exports.SHORT_CC_OVERFLOW = exports.MAX_SHORT = exports.NEGATIVE_BYTE = exports.MAX_BYTE = void 0;
+exports.fromShort = fromShort;
+exports.toShort = toShort;
+exports.toByte = toByte;
+exports.convertFloat = convertFloat;
+exports.deconvertFloat = deconvertFloat;
+exports.convertDouble = convertDouble;
+exports.deconvertDouble = deconvertDouble;
+exports.mapZigZag = mapZigZag;
+exports.demapZigZag = demapZigZag;
+exports.demapShort_ZZ = demapShort_ZZ;
+exports.mapShort_ZZ = mapShort_ZZ;
+exports.convertVarInt = convertVarInt;
+exports.readVarInt = readVarInt;
+exports.deconvertVarInts = deconvertVarInts;
+exports.compressGzip = compressGzip;
+exports.decompressGzip = decompressGzip;
+exports.bytesToHex = bytesToHex;
+exports.hexToBytes = hexToBytes;
+const BufferUtil_1 = require("../BufferUtil");
+// this shit is so complex so i commented it...
+// the highest 8-bit
+exports.MAX_BYTE = 0xFF;
+// we split the usable range in half to separate positive and negative encodings
+exports.NEGATIVE_BYTE = 0x7F;
+// the highest 16-bit
+exports.MAX_SHORT = 0xFFFF;
+// overflow for shorts in construction
+exports.SHORT_CC_OVERFLOW = exports.MAX_BYTE + 1;
+// for varint to overflow; is 128
+exports.UVARINT_OVERFLOW = exports.NEGATIVE_BYTE + 1, exports.VARINT_CHAIN_FLAG = 0x80, exports.NEGATIVE_VARINT = Math.floor(exports.NEGATIVE_BYTE / 2), exports.VARINT_OVERFLOW = exports.NEGATIVE_VARINT + 1, exports.MAX_VSECT_SIZE = 7, exports.MAX_UVARINT = (exports.UVARINT_OVERFLOW ** exports.MAX_VSECT_SIZE) - 1, exports.MAX_VARINT = Math.floor(exports.MAX_UVARINT / 2); // max for negatives
+// constants
+exports.ONE_EIGHT = 1 / 8, exports.ONE_FOURTH = 1 / 4;
+exports.EMPTY_UINT8 = new Uint8Array([]);
+const TWO_POWS = [];
+const twoPow = (num) => TWO_POWS[num] ??= Math.pow(2, num);
+// reconstruction
+function fromShort(short) {
+    // convert to number
+    return short[0] * exports.SHORT_CC_OVERFLOW + short[1];
+}
+// checks, conversion
+function toShort(n) {
+    // no nan/infinity
+    if (!isFinite(n))
+        throw new Error("Can only use real numbers in shorts: " + n);
+    // limit check
+    if (n > exports.MAX_SHORT || n < 0)
+        throw new Error(`Short Numbers must be within range 0 and ${exports.MAX_SHORT}`);
+    // how many times it passes SHORT_OVERFLOW and the remainder
+    return [Math.floor(n / exports.SHORT_CC_OVERFLOW), n % exports.SHORT_CC_OVERFLOW];
+}
+// checks
+function toByte(n) {
+    // no nan/infinity
+    if (!isFinite(n))
+        throw new Error("Can only use real numbers in bytes: " + n);
+    ;
+    // limit check
+    if (n > exports.MAX_BYTE || n < -exports.MAX_BYTE - 1)
+        throw new Error(`Byte Numbers must be within range -${exports.MAX_BYTE + 1} and ${exports.MAX_BYTE}: ${n}`);
+    return n;
+}
+// boolean stuff
+const compressBools = (array) => array.reduce((byte, val, i) => byte | (val << (7 - i)), 0);
+exports.compressBools = compressBools;
+const decompressBools = (byte) => [...Array(8)].map((_, i) => (byte & (1 << (7 - i))) !== 0);
+exports.decompressBools = decompressBools;
+// IEEE-754 single-precision float codec
+const MAN_BITS = 23;
+function parseBin(str) {
+    return parseInt(str, 2);
+}
+function parseMan(bin, isNormal) {
+    const mantissaInt = parseBin(bin);
+    let fraction = 0;
+    for (let i = 0; i < MAN_BITS; i++) {
+        if (mantissaInt & (1 << (MAN_BITS - i - 1))) {
+            fraction += twoPow(-(i + 1));
+        }
+    }
+    return (isNormal ? 1 : 0) + fraction;
+}
+// constants for floating point numbers
+const FLOAT_EXPSIZE = 8, FLOAT_FRACTSIZE = 23;
+const DOUBLE_EXPSIZE = 11, DOUBLE_FRACTSIZE = 52;
+const FLOAT_SPECIAL = 0xFF, DOUBLE_SPECIAL = 0x7FF;
+// assembles floating point values into 4 bytes
+function assembleFloatingPoint(expSize, fractSize, sign, exponent, mantissa) {
+    const bin = sign.toString(2) + exponent.toString(2).padStart(expSize, "0") + mantissa.toString(2).padStart(fractSize, "0");
+    return (0, BufferUtil_1.splitArray)(Array.from(bin), 8).map((x) => parseBin(x.join("")));
+}
+function assembleSingleFloat(sign, exponent, mantissa) {
+    return assembleFloatingPoint(FLOAT_EXPSIZE, FLOAT_FRACTSIZE, sign, exponent, mantissa);
+}
+function assembleDoubleFloat(sign, exponent, mantissa) {
+    return assembleFloatingPoint(DOUBLE_EXPSIZE, DOUBLE_FRACTSIZE, sign, exponent, mantissa);
+}
+// https://stackoverflow.com/questions/3096646/how-to-convert-a-floating-point-number-to-its-binary-representation-ieee-754-i
+// edited for clarity
+function convertFloat(flt) {
+    if (isNaN(flt)) // Special case: NaN
+        return assembleSingleFloat(0, FLOAT_SPECIAL, 1); // Mantissa is nonzero for NaN
+    const sign = (flt < 0) ? 1 : 0;
+    flt = Math.abs(flt);
+    if (flt == 0.0) // Special case: +-0
+        return assembleSingleFloat(sign, 0, 0);
+    const exponent = Math.floor(Math.log(flt) / Math.LN2);
+    if (exponent > 127 || exponent < -126) // Special case: +-Infinity (and huge numbers)
+        return assembleSingleFloat(sign, 0xFF, 0); // Mantissa is zero for +-Infinity
+    const mantissa = flt / twoPow(exponent);
+    const roundMan = Math.round((mantissa - 1) * twoPow(23));
+    return assembleSingleFloat(sign, exponent + 127, roundMan & 0x7FFFFF);
+}
+function deconvertFloat(bytes) {
+    const bin = bytes.map(x => x.toString(2).padStart(8, "0")).join("");
+    // bit 1 = sign
+    // bits 2-9 = exponent
+    // bits 10-32 = mantissa
+    const sign = parseBin(bin[0]);
+    const rawExp = parseBin(bin.slice(1, 9));
+    const exp = rawExp == 0 ? -126 : rawExp - 127;
+    const man = parseMan(bin.slice(9, 32), rawExp != 0); // whether to add the implicit 1
+    let result;
+    if (rawExp == FLOAT_SPECIAL) {
+        result = man == 0 ? Infinity : NaN;
+    }
+    else {
+        result = man * twoPow(exp);
+    }
+    return sign == 1 ? -result : result;
+}
+// https://stackoverflow.com/questions/72659156/convert-double-to-integer-mantissa-and-exponents
+// turned to javascript
+function convertDouble(double) {
+    if (isNaN(double))
+        return assembleDoubleFloat(0, DOUBLE_SPECIAL, 1); // nonzero for nan. sign doesnt effect anything
+    const sign = double < 0 ? 1 : 0;
+    if (!isFinite(double))
+        return assembleDoubleFloat(sign, DOUBLE_SPECIAL, 0); // zero for infinity
+    double = Math.abs(double);
+    let exponent, significand;
+    if (double == 0) {
+        exponent = 0;
+        significand = 0;
+    }
+    else {
+        exponent = Math.floor(Math.log2(double)) - 51;
+        significand = Math.floor(double / twoPow(exponent));
+    }
+    return assembleDoubleFloat(sign, exponent + 1023, significand);
+}
+function deconvertDouble(bytes) {
+    const bin = bytes.map(x => x.toString(2).padStart(8, "0")).join("");
+    // bit 1 = sign
+    // bits 2-12 = exponent
+    // bits 13-64 = mantissa
+    const sign = parseBin(bin[0]);
+    const rawExp = parseBin(bin.slice(1, 12));
+    const exp = rawExp == 0 ? -1022 : rawExp - 1023;
+    const man = parseBin(bin.slice(12, 64));
+    let result;
+    if (rawExp == DOUBLE_SPECIAL) {
+        result = man == 0 ? Infinity : NaN;
+    }
+    else {
+        result = man * twoPow(exp);
+    }
+    return sign == 1 ? -result : result;
+}
+// zig_zag
+function mapZigZag(n) {
+    return ((n << 1) ^ (n >> 31));
+}
+function demapZigZag(n) {
+    return (n >>> 1) ^ -((n & 1));
+}
+function demapShort_ZZ(short) {
+    return demapZigZag(fromShort(short));
+}
+function mapShort_ZZ(short) {
+    return toShort(mapZigZag(short));
+}
+// yeah!
+function convertVarInt(num) {
+    if (num > exports.MAX_UVARINT || num < 0)
+        throw new Error(`Variable Ints must be within range 0 and ${exports.MAX_VARINT}: ${num}`);
+    if (num === 0)
+        return [0];
+    const result = [];
+    while (num > 0) {
+        let byte = num & 0x7F; // take 7 bits
+        num >>>= 7;
+        if (num > 0)
+            byte |= exports.VARINT_CHAIN_FLAG;
+        result.push(byte);
+    }
+    return result;
+}
+function readVarInt(arr, off) {
+    let num = 0;
+    let shift = 0;
+    let byte;
+    do {
+        byte = arr[off++];
+        num += (byte & ~exports.VARINT_CHAIN_FLAG) << shift;
+        shift += 7;
+    } while ((byte & exports.VARINT_CHAIN_FLAG) !== 0);
+    return [off, num];
+}
+function deconvertVarInts(arr) {
+    let res = [];
+    let i = 0;
+    while (i < arr.length) {
+        const [off, varint] = readVarInt(arr, i);
+        res.push(varint);
+        i = off;
+    }
+    return res;
+}
+const bytesToBits = (bytes) => Array.from(bytes).map(b => b.toString(2).padStart(8, '0')).join('');
+exports.bytesToBits = bytesToBits;
+const bitsToBytes = (bits) => new Uint8Array(bits.match(/.{1,8}/g)?.map(b => parseInt(b.padEnd(8, '0'), 2)) ?? []);
+exports.bitsToBytes = bitsToBytes;
+const gzipError = "Your browser is too old to support compression. Please update!";
+async function compressGzip(data, ident = "") {
+    if (typeof CompressionStream === "undefined") {
+        if (typeof window !== "undefined")
+            window.alert(gzipError);
+        throw new Error(gzipError);
+    }
+    const stream = new Blob([data]).stream().pipeThrough(new CompressionStream("deflate-raw"));
+    const buffer = await new Response(stream).arrayBuffer();
+    if (data.length <= buffer.byteLength && ident != "") {
+        console.warn("WARN: Packet '" + ident + "' is small, and compressing it makes the size bigger!");
+    }
+    return new Uint8Array(buffer);
+}
+async function decompressGzip(data) {
+    if (typeof DecompressionStream === "undefined") {
+        if (typeof window !== "undefined")
+            window.alert(gzipError);
+        throw new Error(gzipError);
+    }
+    const stream = new Blob([data]).stream().pipeThrough(new DecompressionStream("deflate-raw"));
+    const buffer = await new Response(stream).arrayBuffer();
+    return new Uint8Array(buffer);
+}
+function bytesToHex(bytes) {
+    return Array.from(bytes, b => b.toString(16).padStart(2, '0')).join('');
+}
+;
+function hexToBytes(hex) {
+    const bytes = new Uint8Array(hex.length / 2);
+    for (let i = 0; i < hex.length; i += 2) {
+        bytes[i / 2] = parseInt(hex.substring(i, i + 2), 16);
+    }
+    return bytes;
+}
+;

package/dist/ws/util/packets/HashUtil.d.ts

@@ -1,6 +1,2 @@
-/**
- * Copyright 2026 Lily (liwybloc)
- * Licensed under the Apache License, Version 2.0.
- */
 export declare function setHashFunc(use64Bit: boolean): void;
 export declare function hashValue(value: any): bigint | number;

package/dist/ws/util/packets/HashUtil.js

@@ -1,6 +1,122 @@
-/**
+"use strict";
+/*
  * Copyright 2026 Lily (liwybloc)
- * Licensed under the Apache License, Version 2.0.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
  */
-
-Object.defineProperty(exports,"__esModule",{value:!0}),exports.setHashFunc=function(e){o=e?n:r},exports.hashValue=function(e){return o(e)};const e=1099511628211n,t=(1n<<64n)-1n,n=n=>{let r=14695981039346656037n;const o=n=>{if(null===n)return r^=0n,void(r=r*e&t);const l=typeof n;if("number"===l)return r^=BigInt(Math.trunc(n)),void(r=r*e&t);if("string"!==l){if("boolean"===l)return r^=n?1n:0n,void(r=r*e&t);if(Array.isArray(n))for(let e=0;e<n.length;e++)o(n[e]);else if("object"===l){const l=Object.keys(n).sort();for(let s=0;s<l.length;s++){const i=l[s];for(let n=0;n<i.length;n++)r^=BigInt(i.charCodeAt(n)),r=r*e&t;o(n[i])}}}else for(let o=0;o<n.length;o++)r^=BigInt(n.charCodeAt(o)),r=r*e&t};return o(n),r},r=e=>{let t=2166136261;const n=e=>{if(null===e)return void(t^=0);const r=typeof e;if("number"===r)return t^=0|e,void(t+=(t<<1)+(t<<4)+(t<<7)+(t<<8)+(t<<24));if("string"!==r)if("boolean"!==r){if(Array.isArray(e))for(let t=0;t<e.length;t++)n(e[t]);else if("object"===r){const r=Object.keys(e).sort();for(let o=0;o<r.length;o++){const l=r[o];for(let e=0;e<l.length;e++)t^=l.charCodeAt(e),t+=(t<<1)+(t<<4)+(t<<7)+(t<<8)+(t<<24);n(e[l])}}}else t^=e?1:0;else for(let n=0;n<e.length;n++)t^=e.charCodeAt(n),t+=(t<<1)+(t<<4)+(t<<7)+(t<<8)+(t<<24)};return n(e),t>>>0};let o=n;
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.setHashFunc = setHashFunc;
+exports.hashValue = hashValue;
+const HASH_INIT_64 = 14695981039346656037n;
+const HASH_PRIME_64 = 1099511628211n;
+const MASK_64 = (1n << 64n) - 1n;
+const hashValue64 = (value) => {
+    let hash = HASH_INIT_64;
+    const walk = (v) => {
+        if (v === null) {
+            hash ^= 0n;
+            hash = (hash * HASH_PRIME_64) & MASK_64;
+            return;
+        }
+        const t = typeof v;
+        if (t === "number") {
+            hash ^= BigInt(Math.trunc(v));
+            hash = (hash * HASH_PRIME_64) & MASK_64;
+            return;
+        }
+        if (t === "string") {
+            for (let i = 0; i < v.length; i++) {
+                hash ^= BigInt(v.charCodeAt(i));
+                hash = (hash * HASH_PRIME_64) & MASK_64;
+            }
+            return;
+        }
+        if (t === "boolean") {
+            hash ^= v ? 1n : 0n;
+            hash = (hash * HASH_PRIME_64) & MASK_64;
+            return;
+        }
+        if (Array.isArray(v)) {
+            for (let i = 0; i < v.length; i++) {
+                walk(v[i]);
+            }
+            return;
+        }
+        if (t === "object") {
+            const keys = Object.keys(v).sort();
+            for (let i = 0; i < keys.length; i++) {
+                const k = keys[i];
+                for (let j = 0; j < k.length; j++) {
+                    hash ^= BigInt(k.charCodeAt(j));
+                    hash = (hash * HASH_PRIME_64) & MASK_64;
+                }
+                walk(v[k]);
+            }
+        }
+    };
+    walk(value);
+    return hash;
+};
+const HASH_INIT = 2166136261;
+const hashValue32 = (value) => {
+    let hash = HASH_INIT;
+    const walk = (v) => {
+        if (v === null) {
+            hash ^= 0;
+            return;
+        }
+        const t = typeof v;
+        if (t === "number") {
+            hash ^= v | 0;
+            hash += (hash << 1) + (hash << 4) + (hash << 7) + (hash << 8) + (hash << 24);
+            return;
+        }
+        if (t === "string") {
+            for (let i = 0; i < v.length; i++) {
+                hash ^= v.charCodeAt(i);
+                hash += (hash << 1) + (hash << 4) + (hash << 7) + (hash << 8) + (hash << 24);
+            }
+            return;
+        }
+        if (t === "boolean") {
+            hash ^= v ? 1 : 0;
+            return;
+        }
+        if (Array.isArray(v)) {
+            for (let i = 0; i < v.length; i++) {
+                walk(v[i]);
+            }
+            return;
+        }
+        if (t === "object") {
+            const keys = Object.keys(v).sort();
+            for (let i = 0; i < keys.length; i++) {
+                const k = keys[i];
+                for (let j = 0; j < k.length; j++) {
+                    hash ^= k.charCodeAt(j);
+                    hash += (hash << 1) + (hash << 4) + (hash << 7) + (hash << 8) + (hash << 24);
+                }
+                walk(v[k]);
+            }
+        }
+    };
+    walk(value);
+    return hash >>> 0;
+};
+let hashFunc = hashValue64;
+function setHashFunc(use64Bit) {
+    hashFunc = use64Bit ? hashValue64 : hashValue32;
+}
+function hashValue(value) {
+    return hashFunc(value);
+}

package/dist/ws/util/packets/JSONUtil.d.ts

@@ -1,6 +1,2 @@
-/**
- * Copyright 2026 Lily (liwybloc)
- * Licensed under the Apache License, Version 2.0.
- */
 export declare const compressJSON: (value: any) => Uint8Array<ArrayBuffer>;
 export declare const decompressJSON: (bytes: Uint8Array) => any;