binary-packet 1.0.6 → 1.0.8

package/README.md

@@ -19,6 +19,8 @@ Bun: \
 Define the structure of the packets through unique Packet IDs and "schema" objects. \
 This "schema" object is simply called `Definition` and defines the shape of a packet: specifically its `fields` and their `types`.
 
+### Fields / Data types
+
 Currently, these kinds of `fields` are supported:
 | Type | Description | Values | Size (bytes) |
 |------|-------------|--------------|--------------|
@@ -33,16 +35,24 @@ Currently, these kinds of `fields` are supported:
 | `BinaryPacket` | BinaryPacket "subpacket" | BinaryPacket | size(BinaryPacket) |
 | `FieldArray` | Dynamically-sized array of one of the types above | Up to 256 elements | 1 + length \* size(Element) |
 | `FieldFixedArray` | Statically-sized array of one of the types above | Any pre-defined numbers of elements | length \* size(Element) |
+| `FieldBitFlags` | Boolean flags packed into a single 8 bits integer | Up to 8 boolean flags | 1 |
+
+As shown, both arrays and nested objects ("subpackets") are supported. \
+Note: `FieldFixedArray` is much more memory efficient and performant than `FieldArray`, but require a pre-defined length.
 
-As you can see from the table above, both arrays and nested objects ("subpackets") are supported. \
-Note that `FieldFixedArray`s are much more memory efficient and performant than `FieldArray`s, but require a pre-defined length.
+### Pattern matching
+
+The library exposes an easy way to "pattern match" packets of a **yet-unknown-type** in a type-safe manner through a `visitor` pattern. \
+For an example, search for "**pattern matching**" in the examples below.
 
 ## Usage Examples
 
+### Example: (incomplete) definition of a simplistic board game
+
 ```typescript
 import { BinaryPacket, Field, FieldArray } from 'binary-packet'
 
-// Imagine we have a game board where each cell is a square and is one unit big.
+// Suppose we have a game board where each cell is a square and is one unit big.
 // A cell can be then defined by its X and Y coordinates.
 // For simplicity, let's say there cannot be more than 256 cells, so we can use 8 bits for each coordinate.
 const Cell = {
@@ -102,6 +112,39 @@ assert(board.cells[1].x === 1)
 assert(board.cells[1].y === 1)
 ```
 
+### Example: pattern matching
+
+```typescript
+import assert from 'assert/strict'
+import { BinaryPacket, Field } from 'binary-packet'
+
+// Packet A definition
+const A = BinaryPacket.define(1)
+
+// Packet B definition: This is the kind of packets that we care about in this example!
+const B = BinaryPacket.define(2, { data: Field.UNSIGNED_INT_8 })
+
+// Packet C definition
+const C = BinaryPacket.define(3)
+
+// Assume the following packet comes from the network or, for some other reason, is a buffer we do not know anything about.
+const buffer = B.writeNodeBuffer({ data: 255 })
+
+BinaryPacket.visitNodeBuffer(
+  buffer,
+
+  A.visitor(() => assert(false, 'Erroneously accepted visitor A')),
+
+  B.visitor(packet => {
+    // Do something with the packet
+    assert.equal(packet.data, 255)
+    console.log('Accepted visitor B:', packet)
+  }),
+
+  C.visitor(() => assert(false, 'Erroneously accepted visitor C'))
+)
+```
+
 ## Benchmarks & Alternatives
 
 Benchmarks are not always meant to be taken seriously. \
@@ -110,14 +153,14 @@ So, take these "performance" comparisons with a grain of salt; or, even better,
 
 This library has been benchmarked against the following alternatives:
 
-- [msgpackr](https://www.npmjs.com/package/msgpackr) - A very popular, fast and battle-tested library. Currently offers **many** more features than binary-packet, but it appears to be 2x-4x slower in writes and 3x-10x slower in reads (depends on the packet structure) - is also less type-safe.
+- [msgpackr](https://www.npmjs.com/package/msgpackr) - A very popular, fast and battle-tested library. Currently offers more features than binary-packet, but it appears to be 2x-4x slower in writes and 3x-10x slower in reads (depends on the packet structure) - is also less type-safe.
 - [restructure](https://www.npmjs.com/package/restructure) - An older, popular schema-based library, has some extra features like LazyArrays, but it is **much slower** than both binary-packet and msgpackr. And, sadly, easily crashes with complex structures.
 
 The benchmarks are executed on three different kinds of packets:
 
 - EmptyPacket: basically an empty javascript object.
 - SimplePacket: objects with just primitive fields and statically-sized arrays.
-- ComplexPacket: objects with primitives, statically-sized arrays, dynamically-sized arrays and other nested objects/arrays.
+- ComplexPacket: objects with primitives, statically-sized arrays, dynamically-sized arrays, bitflags and other nested objects/arrays.
 
 You can see and run the benchmarks yourself if you clone the repository and launch `npm run benchmark`.
 

package/dist/index.d.mts

@@ -1,3 +1,11 @@
+/**
+ * Exclusively matches objects of type `ArrayBuffer` and no other types that inherit from it. \
+ * This is needed because the `DataView` constructor explicitly requires a "true" ArrayBuffer, or else it throws.
+ */
+type TrueArrayBuffer = ArrayBuffer & {
+    buffer?: undefined;
+};
+
 declare const enum Field {
     /**
      * Defines a 1 byte (8 bits) unsigned integer field. \
@@ -55,6 +63,24 @@ declare function FieldArray<T extends Field | BinaryPacket<Definition>>(item: T)
  * NOTE: If an array will not always have the same length, use the `FieldArray` type.
  */
 declare function FieldFixedArray<T extends Field | BinaryPacket<Definition>, Length extends number>(item: T, length: Length): [itemType: T, length: Length];
+type BitFlags = (string[] | ReadonlyArray<string>) & {
+    length: 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8;
+};
+/**
+ * Defines a sequence of up to 8 "flags" (basically single bits/booleans) that can be packed together into a single 8 bits value. \
+ * This is useful for minimizing bytes usage when there are lots of boolean fields/flags, instead of saving each flag separately as its own 8 bits value.
+ *
+ * The input should be an array of strings (with at most 8 elements) where each string defines the name of a flag. \
+ * This is just for definition purposes, then when actually writing or reading packets it'll just be a record-object with those names as keys and boolean values.
+ */
+declare function FieldBitFlags<const FlagsArray extends BitFlags>(flags: FlagsArray): {
+    flags: FlagsArray;
+};
+/**
+ * Do not manually construct this type: an object of this kind is returned by a BinaryPacket `createVisitor` method. \
+ * Used in the `BinaryPacket::visit` static method to perform a sort of "pattern matching" on an incoming packet (of yet unknown type) buffer.
+ */
+type Visitor = [BinaryPacket<Definition>, (packet: any) => void];
 declare class BinaryPacket<T extends Definition> {
     private readonly packetId;
     /**
@@ -83,7 +109,30 @@ declare class BinaryPacket<T extends Definition> {
      * NOTE: Due to security issues, the `byteOffset` argument cannot be defaulted and must be provided by the user. \
      * NOTE: For more information read the `readArrayBuffer` method documentation.
      */
-    static readPacketIdArrayBuffer(arraybuffer: ArrayBuffer, byteOffset: number): number;
+    static readPacketIdArrayBuffer(arraybuffer: TrueArrayBuffer, byteOffset: number): number;
+    /**
+     * Visits and "pattern matches" the given Buffer through the given visitors. \
+     * The Buffer is compared to the series of visitors through its Packet ID, and, if an appropriate visitor is found: its callback is called.
+     *
+     * NOTE: If visiting packets in a loop, for both performance and memory efficiency reasons, it is much better to create each visitor only once before the loop starts and not every iteration.
+     */
+    static visitNodeBuffer(buffer: Buffer, ...visitors: Visitor[]): void;
+    /**
+     * Visits and "pattern matches" the given DataView through the given visitors. \
+     * The DataView is compared to the series of visitors through its Packet ID, and, if an appropriate visitor is found: its callback is called.
+     *
+     * NOTE: If visiting packets in a loop, for both performance and memory efficiency reasons, it is much better to create each visitor only once before the loop starts and not every iteration.
+     */
+    static visitDataView(dataview: DataView, ...visitors: Visitor[]): void;
+    /**
+     * Visits and "pattern matches" the given ArrayBuffer through the given visitors. \
+     * The ArrayBuffer is compared to the series of visitors through its Packet ID, and, if an appropriate visitor is found: its callback is called.
+     *
+     * NOTE: Due to security issues, the `byteOffset` and `byteLength` arguments must be provided by the user. \
+     * NOTE: For more information read the `readArrayBuffer` method documentation. \
+     * NOTE: If visiting packets in a loop, for both performance and memory efficiency reasons, it is much better to create each visitor only once before the loop starts and not every iteration.
+     */
+    static visitArrayBuffer(arraybuffer: TrueArrayBuffer, byteOffset: number, byteLength: number, ...visitors: Visitor[]): void;
     /**
      * Reads/deserializes from the given Buffer. \
      * Method available ONLY on NodeJS and Bun.
@@ -116,9 +165,7 @@ declare class BinaryPacket<T extends Definition> {
      * NOTE: if you have a node Buffer do not bother wrapping it into an ArrayBuffer yourself. \
      * NOTE: if you have a node Buffer use the appropriate `readNodeBuffer` as it is much faster and less error prone.
      */
-    readArrayBuffer(dataIn: ArrayBuffer & {
-        buffer?: undefined;
-    }, byteOffset: number, byteLength: number): ToJson<T>;
+    readArrayBuffer(dataIn: TrueArrayBuffer, byteOffset: number, byteLength: number): ToJson<T>;
     /**
      * Writes/serializes the given object into a Buffer. \
      * Method available ONLY on NodeJS and Bun.
@@ -145,10 +192,19 @@ declare class BinaryPacket<T extends Definition> {
         byteLength: number;
         byteOffset: number;
     };
+    /**
+     * Creates a "visitor" object for this BinaryPacket definition. \
+     * Used when visiting and "pattern matching" buffers with the `BinaryPacket::visit` static utility methods. \
+     *
+     * For more information read the `BinaryPacket::visitNodeBuffer` documentation. \
+     * NOTE: If visiting packets in a loop, for both performance and memory efficiency reasons, it is much better to create each visitor only once before the loop starts and not every iteration.
+     */
+    visitor(onVisit: (packet: ToJson<T>) => void): Visitor;
     private readonly entries;
     readonly canFastWrite: boolean;
     readonly minimumByteLength: number;
     private constructor();
+    private static visit;
     private read;
     private write;
     /**
@@ -205,9 +261,14 @@ declare class BinaryPacket<T extends Definition> {
  * // ...
  */
 type Definition = {
-    [fieldName: string]: MaybeArray<Field> | MaybeArray<BinaryPacket<Definition>>;
+    [fieldName: string]: MaybeArray<Field> | MaybeArray<BinaryPacket<Definition>> | {
+        flags: BitFlags;
+    };
 };
 type MaybeArray<T> = T | [itemType: T] | [itemType: T, length: number];
+type BitFlagsToJson<FlagsArray extends BitFlags> = {
+    [key in FlagsArray[number]]: boolean;
+};
 /**
  * Meta-type that converts a `Definition` schema to the type of the actual JavaScript object that will be written into a packet or read from. \
  */
@@ -216,7 +277,9 @@ type ToJson<T extends Definition> = {
         length: Length;
     } : number[] & {
         length: Length;
-    } : T[K] extends BinaryPacket<infer BPDef> ? ToJson<BPDef> : number;
+    } : T[K] extends BinaryPacket<infer BPDef> ? ToJson<BPDef> : T[K] extends {
+        flags: infer FlagsArray extends BitFlags;
+    } ? BitFlagsToJson<FlagsArray> : number;
 };
 
-export { BinaryPacket, type Definition, Field, FieldArray, FieldFixedArray };
+export { BinaryPacket, type Definition, Field, FieldArray, FieldBitFlags, FieldFixedArray, type ToJson };

package/dist/index.d.ts

@@ -1,3 +1,11 @@
+/**
+ * Exclusively matches objects of type `ArrayBuffer` and no other types that inherit from it. \
+ * This is needed because the `DataView` constructor explicitly requires a "true" ArrayBuffer, or else it throws.
+ */
+type TrueArrayBuffer = ArrayBuffer & {
+    buffer?: undefined;
+};
+
 declare const enum Field {
     /**
      * Defines a 1 byte (8 bits) unsigned integer field. \
@@ -55,6 +63,24 @@ declare function FieldArray<T extends Field | BinaryPacket<Definition>>(item: T)
  * NOTE: If an array will not always have the same length, use the `FieldArray` type.
  */
 declare function FieldFixedArray<T extends Field | BinaryPacket<Definition>, Length extends number>(item: T, length: Length): [itemType: T, length: Length];
+type BitFlags = (string[] | ReadonlyArray<string>) & {
+    length: 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8;
+};
+/**
+ * Defines a sequence of up to 8 "flags" (basically single bits/booleans) that can be packed together into a single 8 bits value. \
+ * This is useful for minimizing bytes usage when there are lots of boolean fields/flags, instead of saving each flag separately as its own 8 bits value.
+ *
+ * The input should be an array of strings (with at most 8 elements) where each string defines the name of a flag. \
+ * This is just for definition purposes, then when actually writing or reading packets it'll just be a record-object with those names as keys and boolean values.
+ */
+declare function FieldBitFlags<const FlagsArray extends BitFlags>(flags: FlagsArray): {
+    flags: FlagsArray;
+};
+/**
+ * Do not manually construct this type: an object of this kind is returned by a BinaryPacket `createVisitor` method. \
+ * Used in the `BinaryPacket::visit` static method to perform a sort of "pattern matching" on an incoming packet (of yet unknown type) buffer.
+ */
+type Visitor = [BinaryPacket<Definition>, (packet: any) => void];
 declare class BinaryPacket<T extends Definition> {
     private readonly packetId;
     /**
@@ -83,7 +109,30 @@ declare class BinaryPacket<T extends Definition> {
      * NOTE: Due to security issues, the `byteOffset` argument cannot be defaulted and must be provided by the user. \
      * NOTE: For more information read the `readArrayBuffer` method documentation.
      */
-    static readPacketIdArrayBuffer(arraybuffer: ArrayBuffer, byteOffset: number): number;
+    static readPacketIdArrayBuffer(arraybuffer: TrueArrayBuffer, byteOffset: number): number;
+    /**
+     * Visits and "pattern matches" the given Buffer through the given visitors. \
+     * The Buffer is compared to the series of visitors through its Packet ID, and, if an appropriate visitor is found: its callback is called.
+     *
+     * NOTE: If visiting packets in a loop, for both performance and memory efficiency reasons, it is much better to create each visitor only once before the loop starts and not every iteration.
+     */
+    static visitNodeBuffer(buffer: Buffer, ...visitors: Visitor[]): void;
+    /**
+     * Visits and "pattern matches" the given DataView through the given visitors. \
+     * The DataView is compared to the series of visitors through its Packet ID, and, if an appropriate visitor is found: its callback is called.
+     *
+     * NOTE: If visiting packets in a loop, for both performance and memory efficiency reasons, it is much better to create each visitor only once before the loop starts and not every iteration.
+     */
+    static visitDataView(dataview: DataView, ...visitors: Visitor[]): void;
+    /**
+     * Visits and "pattern matches" the given ArrayBuffer through the given visitors. \
+     * The ArrayBuffer is compared to the series of visitors through its Packet ID, and, if an appropriate visitor is found: its callback is called.
+     *
+     * NOTE: Due to security issues, the `byteOffset` and `byteLength` arguments must be provided by the user. \
+     * NOTE: For more information read the `readArrayBuffer` method documentation. \
+     * NOTE: If visiting packets in a loop, for both performance and memory efficiency reasons, it is much better to create each visitor only once before the loop starts and not every iteration.
+     */
+    static visitArrayBuffer(arraybuffer: TrueArrayBuffer, byteOffset: number, byteLength: number, ...visitors: Visitor[]): void;
     /**
      * Reads/deserializes from the given Buffer. \
      * Method available ONLY on NodeJS and Bun.
@@ -116,9 +165,7 @@ declare class BinaryPacket<T extends Definition> {
      * NOTE: if you have a node Buffer do not bother wrapping it into an ArrayBuffer yourself. \
      * NOTE: if you have a node Buffer use the appropriate `readNodeBuffer` as it is much faster and less error prone.
      */
-    readArrayBuffer(dataIn: ArrayBuffer & {
-        buffer?: undefined;
-    }, byteOffset: number, byteLength: number): ToJson<T>;
+    readArrayBuffer(dataIn: TrueArrayBuffer, byteOffset: number, byteLength: number): ToJson<T>;
     /**
      * Writes/serializes the given object into a Buffer. \
      * Method available ONLY on NodeJS and Bun.
@@ -145,10 +192,19 @@ declare class BinaryPacket<T extends Definition> {
         byteLength: number;
         byteOffset: number;
     };
+    /**
+     * Creates a "visitor" object for this BinaryPacket definition. \
+     * Used when visiting and "pattern matching" buffers with the `BinaryPacket::visit` static utility methods. \
+     *
+     * For more information read the `BinaryPacket::visitNodeBuffer` documentation. \
+     * NOTE: If visiting packets in a loop, for both performance and memory efficiency reasons, it is much better to create each visitor only once before the loop starts and not every iteration.
+     */
+    visitor(onVisit: (packet: ToJson<T>) => void): Visitor;
     private readonly entries;
     readonly canFastWrite: boolean;
     readonly minimumByteLength: number;
     private constructor();
+    private static visit;
     private read;
     private write;
     /**
@@ -205,9 +261,14 @@ declare class BinaryPacket<T extends Definition> {
  * // ...
  */
 type Definition = {
-    [fieldName: string]: MaybeArray<Field> | MaybeArray<BinaryPacket<Definition>>;
+    [fieldName: string]: MaybeArray<Field> | MaybeArray<BinaryPacket<Definition>> | {
+        flags: BitFlags;
+    };
 };
 type MaybeArray<T> = T | [itemType: T] | [itemType: T, length: number];
+type BitFlagsToJson<FlagsArray extends BitFlags> = {
+    [key in FlagsArray[number]]: boolean;
+};
 /**
  * Meta-type that converts a `Definition` schema to the type of the actual JavaScript object that will be written into a packet or read from. \
  */
@@ -216,7 +277,9 @@ type ToJson<T extends Definition> = {
         length: Length;
     } : number[] & {
         length: Length;
-    } : T[K] extends BinaryPacket<infer BPDef> ? ToJson<BPDef> : number;
+    } : T[K] extends BinaryPacket<infer BPDef> ? ToJson<BPDef> : T[K] extends {
+        flags: infer FlagsArray extends BitFlags;
+    } ? BitFlagsToJson<FlagsArray> : number;
 };
 
-export { BinaryPacket, type Definition, Field, FieldArray, FieldFixedArray };
+export { BinaryPacket, type Definition, Field, FieldArray, FieldBitFlags, FieldFixedArray, type ToJson };

package/dist/index.js

@@ -1,2 +1,2 @@
-"use strict";var E=Object.defineProperty;var A=Object.getOwnPropertyDescriptor;var b=Object.getOwnPropertyNames;var L=Object.prototype.hasOwnProperty;var g=(n,e)=>{for(var t in e)E(n,t,{get:e[t],enumerable:!0})},S=(n,e,t,r)=>{if(e&&typeof e=="object"||typeof e=="function")for(let i of b(e))!L.call(n,i)&&i!==t&&E(n,i,{get:()=>e[i],enumerable:!(r=A(e,i))||r.enumerable});return n};var G=n=>S(E({},"__esModule",{value:!0}),n);var v={};g(v,{BinaryPacket:()=>p,Field:()=>w,FieldArray:()=>O,FieldFixedArray:()=>k});module.exports=G(v);var B=typeof Buffer=="function";function U(n,e){let t=new ArrayBuffer(e),r=Math.min(n.byteLength,t.byteLength),i=Math.trunc(r/8);new Float64Array(t,0,i).set(new Float64Array(n.buffer,0,i));let s=i*8;return i=r-s,new Uint8Array(t,s,i).set(new Uint8Array(n.buffer,s,i)),new DataView(t)}function h(n,e){let t=Buffer.allocUnsafe(e);return n.copy(t),t}var w=(a=>(a[a.UNSIGNED_INT_8=0]="UNSIGNED_INT_8",a[a.UNSIGNED_INT_16=1]="UNSIGNED_INT_16",a[a.UNSIGNED_INT_32=2]="UNSIGNED_INT_32",a[a.INT_8=3]="INT_8",a[a.INT_16=4]="INT_16",a[a.INT_32=5]="INT_32",a[a.FLOAT_32=6]="FLOAT_32",a[a.FLOAT_64=7]="FLOAT_64",a))(w||{});function O(n){return[n]}function k(n,e){if(e<0||!Number.isFinite(e))throw new RangeError("Length of a FixedArray must be a positive integer.");return[n,e]}var p=class n{constructor(e,t){this.packetId=e;this.entries=t?J(t):[];let r=V(this.entries);this.minimumByteLength=r.minimumByteLength,this.canFastWrite=r.canFastWrite}static define(e,t){if(e<0||!Number.isFinite(e))throw new RangeError("Packet IDs must be positive integers.");if(e>255)throw new RangeError("Packet IDs greater than 255 are not supported. Do you REALLY need more than 255 different kinds of packets?");return new n(e,t)}static readPacketIdNodeBuffer(e,t=0){return e.readUint8(t)}static readPacketIdDataView(e,t=0){return e.getUint8(t)}static readPacketIdArrayBuffer(e,t){return new Uint8Array(e,t,1)[0]}readNodeBuffer(e,t={offset:0},r=e.byteLength){return this.read(e,t,r,l)}readDataView(e,t={offset:0},r=e.byteLength){return this.read(e,t,r,m)}readArrayBuffer(e,t,r){return this.read(B?Buffer.from(e,t,r):new DataView(e,t,r),{offset:0},r,B?l:m)}writeNodeBuffer(e){let t=Buffer.allocUnsafe(this.minimumByteLength);return this.write(t,e,{offset:0},d,h)}writeDataView(e){let t=new DataView(new ArrayBuffer(this.minimumByteLength));return this.write(t,e,{offset:0},I,U)}writeArrayBuffer(e){let t=B?this.writeNodeBuffer(e):this.writeDataView(e);return{buffer:t.buffer,byteLength:t.byteLength,byteOffset:t.byteOffset}}entries;canFastWrite;minimumByteLength;read(e,t,r,i){if(r+t.offset<this.minimumByteLength)throw new Error(`There is no space available to fit a packet of type ${this.packetId} at offset ${t.offset}`);if(i[0](e,t.offset)!==this.packetId)throw new Error(`Data at offset ${t.offset} is not a packet of type ${this.packetId}`);t.offset+=1;let s={};for(let[f,o]of this.entries)if(Array.isArray(o)){let a=o[1]??i[0](e,t.offset++),y=Array(a),T=o[0];if(typeof T=="object")for(let u=0;u<a;++u)y[u]=T.read(e,t,r,i);else{let u=N[T];for(let _=0;_<a;++_)y[_]=i[T](e,t.offset),t.offset+=u}s[f]=y}else typeof o=="object"?s[f]=o.read(e,t,r,i):(s[f]=i[o](e,t.offset),t.offset+=N[o]);return s}write(e,t,r,i,s){return i[0](e,this.packetId,r.offset),r.offset+=1,this.canFastWrite?(this.fastWrite(e,t,r,i),e):this.slowWrite(e,t,r,this.minimumByteLength,this.minimumByteLength,i,s)}fastWrite(e,t,r,i){for(let[s,f]of this.entries)if(Array.isArray(f)){let o=f[0],a=f[1],y=t[s];if(typeof o=="object")for(let T=0;T<a;++T)o.fastWrite(e,y[T],r,i);else{let T=N[o];for(let u=0;u<a;++u)i[o](e,y[u],r.offset),r.offset+=T}}else typeof f=="object"?f.fastWrite(e,t[s],r,i):(i[f](e,t[s],r.offset),r.offset+=N[f])}slowWrite(e,t,r,i,s,f,o){for(let[a,y]of this.entries){let T=t[a];if(Array.isArray(y)){let u=T.length,_=y[1]===void 0;if(_&&(f[0](e,u,r.offset),r.offset+=1),u>0){let D=y[0];if(typeof D=="object"){if(_){let c=u*D.minimumByteLength;i+=c,s+=c,e.byteLength<s&&(e=o(e,s))}for(let c of T)f[0](e,D.packetId,r.offset),r.offset+=1,e=D.slowWrite(e,c,r,i,s,f,o),i=r.offset,s=e.byteLength}else{let c=N[D];if(_){let F=u*c;i+=F,s+=F,e.byteLength<s&&(e=o(e,s))}for(let F of T)f[D](e,F,r.offset),r.offset+=c}}}else typeof y=="object"?(f[0](e,y.packetId,r.offset),r.offset+=1,e=y.slowWrite(e,T,r,i,s,f,o),i=r.offset,s=e.byteLength):(f[y](e,T,r.offset),r.offset+=N[y])}return e}};function J(n){return Object.entries(n).sort(([e],[t])=>e.localeCompare(t))}function V(n){let e=1,t=!0;for(let[,r]of n)if(Array.isArray(r))if(r.length===2){let i=typeof r[0]=="object"?r[0].minimumByteLength:N[r[0]];e+=r[1]*i}else e+=1,t=!1;else r instanceof p?(e+=r.minimumByteLength,t&&=r.canFastWrite):e+=N[r];return{minimumByteLength:e,canFastWrite:t}}var N=Array(8);N[0]=1;N[3]=1;N[1]=2;N[4]=2;N[2]=4;N[5]=4;N[6]=4;N[7]=8;var m=Array(8);m[0]=(n,e)=>n.getUint8(e);m[3]=(n,e)=>n.getInt8(e);m[1]=(n,e)=>n.getUint16(e);m[4]=(n,e)=>n.getInt16(e);m[2]=(n,e)=>n.getUint32(e);m[5]=(n,e)=>n.getInt32(e);m[6]=(n,e)=>n.getFloat32(e);m[7]=(n,e)=>n.getFloat64(e);var I=Array(8);I[0]=(n,e,t)=>n.setUint8(t,e);I[3]=(n,e,t)=>n.setInt8(t,e);I[1]=(n,e,t)=>n.setUint16(t,e);I[4]=(n,e,t)=>n.setInt16(t,e);I[2]=(n,e,t)=>n.setUint32(t,e);I[5]=(n,e,t)=>n.setInt32(t,e);I[6]=(n,e,t)=>n.setFloat32(t,e);I[7]=(n,e,t)=>n.setFloat64(t,e);var d=Array(8);B&&(d[0]=(n,e,t)=>n.writeUint8(e,t),d[3]=(n,e,t)=>n.writeInt8(e,t),d[1]=(n,e,t)=>n.writeUint16LE(e,t),d[4]=(n,e,t)=>n.writeInt16LE(e,t),d[2]=(n,e,t)=>n.writeUint32LE(e,t),d[5]=(n,e,t)=>n.writeInt32LE(e,t),d[6]=(n,e,t)=>n.writeFloatLE(e,t),d[7]=(n,e,t)=>n.writeDoubleLE(e,t));var l=Array(8);B&&(l[0]=(n,e)=>n.readUint8(e),l[3]=(n,e)=>n.readInt8(e),l[1]=(n,e)=>n.readUint16LE(e),l[4]=(n,e)=>n.readInt16LE(e),l[2]=(n,e)=>n.readUint32LE(e),l[5]=(n,e)=>n.readInt32LE(e),l[6]=(n,e)=>n.readFloatLE(e),l[7]=(n,e)=>n.readDoubleLE(e));0&&(module.exports={BinaryPacket,Field,FieldArray,FieldFixedArray});
+"use strict";var D=Object.defineProperty;var w=Object.getOwnPropertyDescriptor;var A=Object.getOwnPropertyNames;var b=Object.prototype.hasOwnProperty;var S=(r,e)=>{for(var t in e)D(r,t,{get:e[t],enumerable:!0})},L=(r,e,t,i)=>{if(e&&typeof e=="object"||typeof e=="function")for(let n of A(e))!b.call(r,n)&&n!==t&&D(r,n,{get:()=>e[n],enumerable:!(i=w(e,n))||i.enumerable});return r};var G=r=>L(D({},"__esModule",{value:!0}),r);var J={};S(J,{BinaryPacket:()=>g,Field:()=>U,FieldArray:()=>v,FieldBitFlags:()=>k,FieldFixedArray:()=>V});module.exports=G(J);var F=typeof Buffer=="function";function E(r,e){let t=new ArrayBuffer(e),i=Math.min(r.byteLength,t.byteLength),n=Math.trunc(i/8);new Float64Array(t,0,n).set(new Float64Array(r.buffer,0,n));let f=n*8;return n=i-f,new Uint8Array(t,f,n).set(new Uint8Array(r.buffer,f,n)),new DataView(t)}function h(r,e){let t=Buffer.allocUnsafe(e);return r.copy(t),t}var U=(s=>(s[s.UNSIGNED_INT_8=0]="UNSIGNED_INT_8",s[s.UNSIGNED_INT_16=1]="UNSIGNED_INT_16",s[s.UNSIGNED_INT_32=2]="UNSIGNED_INT_32",s[s.INT_8=3]="INT_8",s[s.INT_16=4]="INT_16",s[s.INT_32=5]="INT_32",s[s.FLOAT_32=6]="FLOAT_32",s[s.FLOAT_64=7]="FLOAT_64",s))(U||{});function v(r){return[r]}function V(r,e){if(e<0||!Number.isFinite(e))throw new RangeError("Length of a FixedArray must be a positive integer.");return[r,e]}function k(r){if(r.length>8)throw new Error(`Invalid BinaryPacket definition: a BitFlags field can have only up to 8 flags, given: ${r.join(", ")}`);return{flags:r}}var g=class r{constructor(e,t){this.packetId=e;this.entries=t?O(t):[];let i=x(this.entries);this.minimumByteLength=i.minimumByteLength,this.canFastWrite=i.canFastWrite}static define(e,t){if(e<0||!Number.isFinite(e))throw new RangeError("Packet IDs must be positive integers.");if(e>255)throw new RangeError("Packet IDs greater than 255 are not supported. Do you REALLY need more than 255 different kinds of packets?");return new r(e,t)}static readPacketIdNodeBuffer(e,t=0){return e.readUint8(t)}static readPacketIdDataView(e,t=0){return e.getUint8(t)}static readPacketIdArrayBuffer(e,t){return new Uint8Array(e,t,1)[0]}static visitNodeBuffer(e,...t){return r.visit(e,I,t)}static visitDataView(e,...t){return r.visit(e,d,t)}static visitArrayBuffer(e,t,i,...n){return r.visit(new DataView(e,t,i),d,n)}readNodeBuffer(e,t={offset:0},i=e.byteLength){return this.read(e,t,i,I)}readDataView(e,t={offset:0},i=e.byteLength){return this.read(e,t,i,d)}readArrayBuffer(e,t,i){return this.read(F?Buffer.from(e,t,i):new DataView(e,t,i),{offset:0},i,F?I:d)}writeNodeBuffer(e){let t=Buffer.allocUnsafe(this.minimumByteLength);return this.write(t,e,{offset:0},_,h)}writeDataView(e){let t=new DataView(new ArrayBuffer(this.minimumByteLength));return this.write(t,e,{offset:0},m,E)}writeArrayBuffer(e){let t=F?this.writeNodeBuffer(e):this.writeDataView(e);return{buffer:t.buffer,byteLength:t.byteLength,byteOffset:t.byteOffset}}visitor(e){return[this,e]}entries;canFastWrite;minimumByteLength;static visit(e,t,i){for(let[n,f]of i)if(n.packetId===t[0](e,0))return f(n.read(e,{offset:0},e.byteLength,t))}read(e,t,i,n){if(i+t.offset<this.minimumByteLength)throw new Error(`There is no space available to fit a packet of type ${this.packetId} at offset ${t.offset}`);if(n[0](e,t.offset)!==this.packetId)throw new Error(`Data at offset ${t.offset} is not a packet of type ${this.packetId}`);t.offset+=1;let f={};for(let[o,T]of this.entries)if(Array.isArray(T)){let s=T[1]??n[0](e,t.offset++),a=Array(s),l=T[0];if(typeof l=="object")for(let N=0;N<s;++N)a[N]=l.read(e,t,i,n);else{let N=y[l];for(let u=0;u<s;++u)a[u]=n[l](e,t.offset),t.offset+=N}f[o]=a}else if(typeof T=="number")f[o]=n[T](e,t.offset),t.offset+=y[T];else if("flags"in T){let s=n[0](e,t.offset);t.offset+=1,f[o]={};for(let a=0;a<T.flags.length;++a)f[o][T.flags[a]]=!!(s&1<<a)}else f[o]=T.read(e,t,i,n);return f}write(e,t,i,n,f){return n[0](e,this.packetId,i.offset),i.offset+=1,this.canFastWrite?(this.fastWrite(e,t,i,n),e):this.slowWrite(e,t,i,this.minimumByteLength,this.minimumByteLength,n,f)}fastWrite(e,t,i,n){for(let[f,o]of this.entries){let T=t[f];if(Array.isArray(o)){let s=o[0],a=o[1];if(typeof s=="object")for(let l=0;l<a;++l)s.fastWrite(e,T[l],i,n);else{let l=y[s];for(let N=0;N<a;++N)n[s](e,T[N],i.offset),i.offset+=l}}else if(typeof o=="number")n[o](e,T,i.offset),i.offset+=y[o];else if("flags"in o){let s=0;for(let a=0;a<o.flags.length;++a)T[o.flags[a]]&&(s|=1<<a);n[0](e,s,i.offset),i.offset+=1}else o.fastWrite(e,T,i,n)}}slowWrite(e,t,i,n,f,o,T){for(let[s,a]of this.entries){let l=t[s];if(Array.isArray(a)){let N=l.length,u=a[1]===void 0;if(u&&(o[0](e,N,i.offset),i.offset+=1),N>0){let B=a[0];if(typeof B=="object"){if(u){let c=N*B.minimumByteLength;n+=c,f+=c,e.byteLength<f&&(e=T(e,f))}for(let c of l)o[0](e,B.packetId,i.offset),i.offset+=1,e=B.slowWrite(e,c,i,n,f,o,T),n=i.offset,f=e.byteLength}else{let c=y[B];if(u){let p=N*c;n+=p,f+=p,e.byteLength<f&&(e=T(e,f))}for(let p of l)o[B](e,p,i.offset),i.offset+=c}}}else if(typeof a=="number")o[a](e,l,i.offset),i.offset+=y[a];else if("flags"in a){let N=0;for(let u=0;u<a.flags.length;++u)l[a.flags[u]]&&(N|=1<<u);o[0](e,N,i.offset),i.offset+=1}else o[0](e,a.packetId,i.offset),i.offset+=1,e=a.slowWrite(e,l,i,n,f,o,T),n=i.offset,f=e.byteLength}return e}};function O(r){return Object.entries(r).sort(([e],[t])=>e.localeCompare(t))}function x(r){let e=1,t=!0;for(let[,i]of r)if(Array.isArray(i))if(i.length===2){let n=typeof i[0]=="object"?i[0].minimumByteLength:y[i[0]];e+=i[1]*n}else e+=1,t=!1;else i instanceof g?(e+=i.minimumByteLength,t&&=i.canFastWrite):typeof i=="object"?e+=1:e+=y[i];return{minimumByteLength:e,canFastWrite:t}}var y=Array(8);y[0]=1;y[3]=1;y[1]=2;y[4]=2;y[2]=4;y[5]=4;y[6]=4;y[7]=8;var d=Array(8);d[0]=(r,e)=>r.getUint8(e);d[3]=(r,e)=>r.getInt8(e);d[1]=(r,e)=>r.getUint16(e);d[4]=(r,e)=>r.getInt16(e);d[2]=(r,e)=>r.getUint32(e);d[5]=(r,e)=>r.getInt32(e);d[6]=(r,e)=>r.getFloat32(e);d[7]=(r,e)=>r.getFloat64(e);var m=Array(8);m[0]=(r,e,t)=>r.setUint8(t,e);m[3]=(r,e,t)=>r.setInt8(t,e);m[1]=(r,e,t)=>r.setUint16(t,e);m[4]=(r,e,t)=>r.setInt16(t,e);m[2]=(r,e,t)=>r.setUint32(t,e);m[5]=(r,e,t)=>r.setInt32(t,e);m[6]=(r,e,t)=>r.setFloat32(t,e);m[7]=(r,e,t)=>r.setFloat64(t,e);var _=Array(8);F&&(_[0]=(r,e,t)=>r.writeUint8(e,t),_[3]=(r,e,t)=>r.writeInt8(e,t),_[1]=(r,e,t)=>r.writeUint16LE(e,t),_[4]=(r,e,t)=>r.writeInt16LE(e,t),_[2]=(r,e,t)=>r.writeUint32LE(e,t),_[5]=(r,e,t)=>r.writeInt32LE(e,t),_[6]=(r,e,t)=>r.writeFloatLE(e,t),_[7]=(r,e,t)=>r.writeDoubleLE(e,t));var I=Array(8);F&&(I[0]=(r,e)=>r.readUint8(e),I[3]=(r,e)=>r.readInt8(e),I[1]=(r,e)=>r.readUint16LE(e),I[4]=(r,e)=>r.readInt16LE(e),I[2]=(r,e)=>r.readUint32LE(e),I[5]=(r,e)=>r.readInt32LE(e),I[6]=(r,e)=>r.readFloatLE(e),I[7]=(r,e)=>r.readDoubleLE(e));0&&(module.exports={BinaryPacket,Field,FieldArray,FieldBitFlags,FieldFixedArray});
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/index.ts","../src/buffers.ts"],"sourcesContent":["import { growDataView, growNodeBuffer, hasNodeBuffers } from './buffers'\r\n\r\nexport const enum Field {\r\n  /**\r\n   * Defines a 1 byte (8 bits) unsigned integer field. \\\r\n   * (Range: 0 - 255)\r\n   */\r\n  UNSIGNED_INT_8 = 0,\r\n\r\n  /**\r\n   * Defines a 2 bytes (16 bits) unsigned integer field. \\\r\n   * (Range: 0 - 65535)\r\n   */\r\n  UNSIGNED_INT_16,\r\n\r\n  /**\r\n   * Defines a 4 bytes (32 bits) unsigned integer field. \\\r\n   * (Range: 0 - 4294967295)\r\n   */\r\n  UNSIGNED_INT_32,\r\n\r\n  /**\r\n   * Defines a 1 byte (8 bits) signed integer field. \\\r\n   * (Range: -128 - 127)\r\n   */\r\n  INT_8,\r\n\r\n  /**\r\n   * Defines a 2 bytes (16 bits) signed integer field. \\\r\n   * (Range: -32768 - 32767)\r\n   */\r\n  INT_16,\r\n\r\n  /**\r\n   * Defines a 4 bytes (32 bits) signed integer field. \\\r\n   * (Range: -2147483648 - 2147483647)\r\n   */\r\n  INT_32,\r\n\r\n  /**\r\n   * Defines a 4 bytes (32 bits) floating-point field. \\\r\n   */\r\n  FLOAT_32,\r\n\r\n  /**\r\n   * Defines a 8 bytes (64 bits) floating-point field. \\\r\n   */\r\n  FLOAT_64\r\n}\r\n\r\n/**\r\n * Defines a dynamically-sized array with elements of a certain type. \\\r\n * Dynamically-sized arrays are useful when a packet's field is an array of a non pre-defined length. \\\r\n * Although, this makes dynamically-sized arrays more memory expensive as the internal buffer needs to be grown accordingly.\r\n *\r\n * NOTE: If an array will ALWAYS have the same length, prefer using the `FieldFixedArray` type, for both better performance and memory efficiency. \\\r\n * NOTE: As of now, dynamic arrays can have at most 256 elements.\r\n */\r\nexport function FieldArray<T extends Field | BinaryPacket<Definition>>(item: T): [itemType: T] {\r\n  return [item]\r\n}\r\n\r\n/**\r\n * Defines a statically-sized array with elements of a certain type. \\\r\n * Fixed arrays are useful when a packet's field is an array of a pre-defined length. \\\r\n * Fixed arrays much more memory efficient and performant than non-fixed ones.\r\n *\r\n * NOTE: If an array will not always have the same length, use the `FieldArray` type.\r\n */\r\nexport function FieldFixedArray<T extends Field | BinaryPacket<Definition>, Length extends number>(\r\n  item: T,\r\n  length: Length\r\n): [itemType: T, length: Length] {\r\n  if (length < 0 || !Number.isFinite(length)) {\r\n    throw new RangeError('Length of a FixedArray must be a positive integer.')\r\n  }\r\n\r\n  return [item, length]\r\n}\r\n\r\nexport class BinaryPacket<T extends Definition> {\r\n  /**\r\n   * Defines a new binary packet. \\\r\n   * Make sure that every `packetId` is unique.\r\n   * @throws RangeError If packetId is negative, floating-point, or greater than 255.\r\n   */\r\n  static define<T extends Definition>(packetId: number, definition?: T) {\r\n    if (packetId < 0 || !Number.isFinite(packetId)) {\r\n      throw new RangeError('Packet IDs must be positive integers.')\r\n    }\r\n\r\n    if (packetId > 255) {\r\n      throw new RangeError(\r\n        'Packet IDs greater than 255 are not supported. Do you REALLY need more than 255 different kinds of packets?'\r\n      )\r\n    }\r\n\r\n    return new BinaryPacket(packetId, definition)\r\n  }\r\n\r\n  /**\r\n   * Reads just the packetId from the given Buffer. \\\r\n   * This method practically just reads the uint8 at offset `byteOffset` (default: 0). \\\r\n   * Useful if the receiving side receives multiple types of packets.\r\n   */\r\n  static readPacketIdNodeBuffer(buffer: Buffer, byteOffset = 0) {\r\n    return buffer.readUint8(byteOffset)\r\n  }\r\n\r\n  /**\r\n   * Reads just the packetId from the given DataView. \\\r\n   * This method practically just reads the uint8 at offset `byteOffset` (default: 0). \\\r\n   * Useful if the receiving side receives multiple types of packets.\r\n   */\r\n  static readPacketIdDataView(dataview: DataView, byteOffset = 0) {\r\n    return dataview.getUint8(byteOffset)\r\n  }\r\n\r\n  /**\r\n   * Reads just the packetId from the given ArrayBuffer. \\\r\n   * This method practically just reads the uint8 at offset `byteOffset`. \\\r\n   * Useful if the receiving side receives multiple types of packets.\r\n   *\r\n   * NOTE: Due to security issues, the `byteOffset` argument cannot be defaulted and must be provided by the user. \\\r\n   * NOTE: For more information read the `readArrayBuffer` method documentation.\r\n   */\r\n  static readPacketIdArrayBuffer(arraybuffer: ArrayBuffer, byteOffset: number) {\r\n    return new Uint8Array(arraybuffer, byteOffset, 1)[0]\r\n  }\r\n\r\n  /**\r\n   * Reads/deserializes from the given Buffer. \\\r\n   * Method available ONLY on NodeJS and Bun.\r\n   *\r\n   * If possible, always prefer reading using this method, as it is much faster than the other ones.\r\n   *\r\n   * NOTE: if you have an ArrayBuffer do not bother wrapping it into a node Buffer yourself. \\\r\n   * NOTE: if you have an ArrayBuffer use the appropriate `readArrayBuffer`.\r\n   */\r\n  readNodeBuffer(\r\n    dataIn: Buffer,\r\n    offsetPointer = { offset: 0 },\r\n    byteLength = dataIn.byteLength\r\n  ): ToJson<T> {\r\n    return this.read(dataIn, offsetPointer, byteLength, GET_FUNCTION_BUF)\r\n  }\r\n\r\n  /**\r\n   * Reads/deserializes from the given DataView.\r\n   *\r\n   * NOTE: if you have an ArrayBuffer do not bother wrapping it into a DataView yourself. \\\r\n   * NOTE: if you have an ArrayBuffer use the appropriate `readArrayBuffer`.\r\n   */\r\n  readDataView(\r\n    dataIn: DataView,\r\n    offsetPointer = { offset: 0 },\r\n    byteLength = dataIn.byteLength\r\n  ): ToJson<T> {\r\n    return this.read(dataIn, offsetPointer, byteLength, GET_FUNCTION)\r\n  }\r\n\r\n  /**\r\n   * Reads/deserializes from the given ArrayBuffer. \\\r\n   * WARNING: this method is practically a HACK.\r\n   *\r\n   * When using this method both the `byteOffset` and `byteLength` are REQUIRED and cannot be defaulted. \\\r\n   * This is to prevent serious bugs and security issues. \\\r\n   * That is because often raw ArrayBuffers come from a pre-allocated buffer pool and do not start at byteOffset 0.\r\n   *\r\n   * NOTE: if you have a node Buffer do not bother wrapping it into an ArrayBuffer yourself. \\\r\n   * NOTE: if you have a node Buffer use the appropriate `readNodeBuffer` as it is much faster and less error prone.\r\n   */\r\n  readArrayBuffer(\r\n    dataIn: ArrayBuffer & { buffer?: undefined },\r\n    byteOffset: number,\r\n    byteLength: number\r\n  ) {\r\n    return this.read(\r\n      hasNodeBuffers\r\n        ? Buffer.from(dataIn, byteOffset, byteLength)\r\n        : new DataView(dataIn, byteOffset, byteLength),\r\n      { offset: 0 }, // The underlying buffer has already been offsetted\r\n      byteLength,\r\n      hasNodeBuffers ? GET_FUNCTION_BUF : GET_FUNCTION\r\n    )\r\n  }\r\n\r\n  /**\r\n   * Writes/serializes the given object into a Buffer. \\\r\n   * Method available ONLY on NodeJS and Bun.\r\n   *\r\n   * If possible, always prefer writing using this method, as it is much faster than the other ones.\r\n   */\r\n  writeNodeBuffer(dataOut: ToJson<T>) {\r\n    const buffer = Buffer.allocUnsafe(this.minimumByteLength)\r\n    return this.write(buffer, dataOut, { offset: 0 }, SET_FUNCTION_BUF, growNodeBuffer)\r\n  }\r\n\r\n  /**\r\n   * Writes/serializes the given object into a DataView. \\\r\n   */\r\n  writeDataView(dataOut: ToJson<T>) {\r\n    const dataview = new DataView(new ArrayBuffer(this.minimumByteLength))\r\n    return this.write(dataview, dataOut, { offset: 0 }, SET_FUNCTION, growDataView)\r\n  }\r\n\r\n  /**\r\n   * Writes/serializes the given object into an ArrayBuffer. \\\r\n   * This method is just a wrapper around either  `writeNodeBuffer` or `writeDataView`. \\\r\n   *\r\n   * This method works with JavaScript standard raw ArrayBuffer(s) and, as such, is very error prone: \\\r\n   * Make sure you're using the returned byteLength and byteOffset fields in the read counterpart. \\\r\n   *\r\n   * Always consider whether is possible to use directly `writeNodeBuffer` or `writeDataView` instead of `writeArrayBuffer`. \\\r\n   * For more information read the `readArrayBuffer` documentation.\r\n   */\r\n  writeArrayBuffer(dataOut: ToJson<T>) {\r\n    const buf = hasNodeBuffers ? this.writeNodeBuffer(dataOut) : this.writeDataView(dataOut)\r\n    return { buffer: buf.buffer, byteLength: buf.byteLength, byteOffset: buf.byteOffset }\r\n  }\r\n\r\n  private readonly entries: Entries\r\n  readonly canFastWrite: boolean\r\n  readonly minimumByteLength: number\r\n\r\n  private constructor(\r\n    private readonly packetId: number,\r\n    definition?: T\r\n  ) {\r\n    this.entries = definition ? sortEntries(definition) : []\r\n    const inspection = inspectEntries(this.entries)\r\n\r\n    this.minimumByteLength = inspection.minimumByteLength\r\n    this.canFastWrite = inspection.canFastWrite\r\n  }\r\n\r\n  private read(\r\n    dataIn: DataView | Buffer,\r\n    offsetPointer: { offset: number },\r\n    byteLength: number,\r\n    readFunctions: typeof GET_FUNCTION | typeof GET_FUNCTION_BUF\r\n  ): ToJson<T> {\r\n    if (byteLength + offsetPointer.offset < this.minimumByteLength) {\r\n      throw new Error(\r\n        `There is no space available to fit a packet of type ${this.packetId} at offset ${offsetPointer.offset}`\r\n      )\r\n    }\r\n\r\n    if (\r\n      readFunctions[Field.UNSIGNED_INT_8](dataIn as any, offsetPointer.offset) !== this.packetId\r\n    ) {\r\n      throw new Error(\r\n        `Data at offset ${offsetPointer.offset} is not a packet of type ${this.packetId}`\r\n      )\r\n    }\r\n\r\n    offsetPointer.offset += 1\r\n    const result: any = {}\r\n\r\n    for (const [name, def] of this.entries) {\r\n      if (Array.isArray(def)) {\r\n        const length =\r\n          // def[1] is the length of a statically-sized array, if undefined: must read the length from the buffer as it means it's a dynamically-sized array\r\n          def[1] ?? readFunctions[Field.UNSIGNED_INT_8](dataIn as any, offsetPointer.offset++)\r\n\r\n        const array = Array(length)\r\n\r\n        const itemType = def[0]\r\n\r\n        if (typeof itemType === 'object') {\r\n          // Array of \"subpackets\"\r\n          for (let i = 0; i < length; ++i) {\r\n            array[i] = itemType.read(dataIn, offsetPointer, byteLength, readFunctions)\r\n          }\r\n        } else {\r\n          // Array of primitives (numbers)\r\n          const itemSize = BYTE_SIZE[itemType]\r\n\r\n          // It seems like looping over each element is actually much faster than using TypedArrays bulk copy.\r\n          // TODO: properly benchmark with various array sizes to see if it's actually the case.\r\n          for (let i = 0; i < length; ++i) {\r\n            array[i] = readFunctions[itemType](dataIn as any, offsetPointer.offset)\r\n            offsetPointer.offset += itemSize\r\n          }\r\n        }\r\n\r\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access\r\n        result[name] = array\r\n      } else if (typeof def === 'object') {\r\n        // Single \"subpacket\"\r\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access\r\n        result[name] = def.read(dataIn, offsetPointer, byteLength, readFunctions)\r\n      } else {\r\n        // Single primitive (number)\r\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access\r\n        result[name] = readFunctions[def](dataIn as any, offsetPointer.offset)\r\n        offsetPointer.offset += BYTE_SIZE[def]\r\n      }\r\n    }\r\n\r\n    return result as ToJson<T>\r\n  }\r\n\r\n  private write<Buf extends DataView | Buffer>(\r\n    buffer: Buf,\r\n    dataOut: ToJson<T>,\r\n    offsetPointer: { offset: number },\r\n    writeFunctions: typeof SET_FUNCTION | typeof SET_FUNCTION_BUF,\r\n    growBufferFunction: (buffer: Buf, newByteLength: number) => Buf\r\n  ): Buf {\r\n    writeFunctions[Field.UNSIGNED_INT_8](buffer as any, this.packetId, offsetPointer.offset)\r\n    offsetPointer.offset += 1\r\n\r\n    if (this.canFastWrite) {\r\n      // If there are no arrays, the minimumByteLength always equals to the full needed byteLength.\r\n      // So we can take the fast path, since we know beforehand that the buffer isn't going to grow.\r\n      this.fastWrite(buffer, dataOut, offsetPointer, writeFunctions)\r\n      return buffer\r\n    } else {\r\n      // If non-empty arrays are encountered, the buffer must grow.\r\n      // If every array is empty, the speed of this path is comparable to the fast path.\r\n      return this.slowWrite(\r\n        buffer,\r\n        dataOut,\r\n        offsetPointer,\r\n        this.minimumByteLength,\r\n        this.minimumByteLength,\r\n        writeFunctions,\r\n        growBufferFunction\r\n      )\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Fast write does not support writing dynamically-sized arrays.\r\n   */\r\n  private fastWrite<Buf extends DataView | Buffer>(\r\n    buffer: Buf,\r\n    dataOut: ToJson<T>,\r\n    offsetPointer: { offset: number },\r\n    writeFunctions: typeof SET_FUNCTION | typeof SET_FUNCTION_BUF\r\n  ) {\r\n    for (const [name, def] of this.entries) {\r\n      if (Array.isArray(def)) {\r\n        // Statically-sized array\r\n        const itemType = def[0]\r\n        const length = def[1]!\r\n        const data = dataOut[name] as any[]\r\n\r\n        if (typeof itemType === 'object') {\r\n          for (let i = 0; i < length; ++i) {\r\n            itemType.fastWrite(buffer, data[i] as ToJson<Definition>, offsetPointer, writeFunctions)\r\n          }\r\n        } else {\r\n          const itemSize = BYTE_SIZE[itemType]\r\n\r\n          for (let i = 0; i < length; ++i) {\r\n            writeFunctions[itemType](buffer as any, data[i] as number, offsetPointer.offset)\r\n            offsetPointer.offset += itemSize\r\n          }\r\n        }\r\n      } else if (typeof def === 'object') {\r\n        // Single \"subpacket\"\r\n        // In fastWrite there cannot be arrays, but the cast is needed because TypeScript can't possibly know that.\r\n        def.fastWrite(buffer, dataOut[name] as ToJson<Definition>, offsetPointer, writeFunctions)\r\n      } else {\r\n        // Single primitive (number)\r\n        writeFunctions[def](buffer as any, dataOut[name] as number, offsetPointer.offset)\r\n        offsetPointer.offset += BYTE_SIZE[def]\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * The slow writing path tries writing data into the buffer as fast as the fast writing path does. \\\r\n   * But, if a non-empty dynamically-sized array is encountered, the buffer needs to grow, slightly reducing performance.\r\n   */\r\n  private slowWrite<Buf extends DataView | Buffer>(\r\n    buffer: Buf,\r\n    dataOut: ToJson<T>,\r\n    offsetPointer: { offset: number },\r\n    byteLength: number,\r\n    maxByteLength: number,\r\n    writeFunctions: typeof SET_FUNCTION | typeof SET_FUNCTION_BUF,\r\n    growBufferFunction: (buffer: Buf, newByteLength: number) => Buf\r\n  ): Buf {\r\n    for (const [name, def] of this.entries) {\r\n      const data = dataOut[name]\r\n\r\n      if (Array.isArray(def)) {\r\n        // Could be both an array of just numbers or \"subpackets\"\r\n\r\n        const length = (data as any[]).length\r\n        const isDynamicArray = def[1] === undefined\r\n\r\n        // Check if it is a dynamically-sized array, if it is, the length of the array must be serialized in the buffer before its elements\r\n        // Explicitly check for undefined and not falsy values because it could be a statically-sized array of 0 elements.\r\n        if (isDynamicArray) {\r\n          writeFunctions[Field.UNSIGNED_INT_8](buffer as any, length, offsetPointer.offset)\r\n          offsetPointer.offset += 1\r\n        }\r\n\r\n        if (length > 0) {\r\n          const itemType = def[0]\r\n\r\n          if (typeof itemType === 'object') {\r\n            // Array of \"subpackets\"\r\n\r\n            if (isDynamicArray) {\r\n              const neededBytesForElements = length * itemType.minimumByteLength\r\n\r\n              byteLength += neededBytesForElements\r\n              maxByteLength += neededBytesForElements\r\n\r\n              if (buffer.byteLength < maxByteLength) {\r\n                buffer = growBufferFunction(buffer, maxByteLength)\r\n              }\r\n            }\r\n\r\n            for (const object of data as unknown as ToJson<Definition>[]) {\r\n              writeFunctions[Field.UNSIGNED_INT_8](\r\n                buffer as any,\r\n                itemType.packetId,\r\n                offsetPointer.offset\r\n              )\r\n\r\n              offsetPointer.offset += 1\r\n\r\n              buffer = itemType.slowWrite(\r\n                buffer,\r\n                object,\r\n                offsetPointer,\r\n                byteLength,\r\n                maxByteLength,\r\n                writeFunctions,\r\n                growBufferFunction\r\n              )\r\n\r\n              byteLength = offsetPointer.offset\r\n              maxByteLength = buffer.byteLength\r\n            }\r\n          } else {\r\n            // Array of primitives (numbers)\r\n            const itemSize = BYTE_SIZE[itemType]\r\n\r\n            if (isDynamicArray) {\r\n              const neededBytesForElements = length * itemSize\r\n\r\n              byteLength += neededBytesForElements\r\n              maxByteLength += neededBytesForElements\r\n\r\n              if (buffer.byteLength < maxByteLength) {\r\n                buffer = growBufferFunction(buffer, maxByteLength)\r\n              }\r\n            }\r\n\r\n            // It seems like looping over each element is actually much faster than using TypedArrays bulk copy.\r\n            // TODO: properly benchmark with various array sizes to see if it's actually the case.\r\n            for (const number of data as number[]) {\r\n              writeFunctions[itemType](buffer as any, number, offsetPointer.offset)\r\n              offsetPointer.offset += itemSize\r\n            }\r\n          }\r\n        }\r\n      } else if (typeof def === 'object') {\r\n        // Single \"subpacket\"\r\n        writeFunctions[Field.UNSIGNED_INT_8](buffer as any, def.packetId, offsetPointer.offset)\r\n        offsetPointer.offset += 1\r\n\r\n        buffer = def.slowWrite(\r\n          buffer,\r\n          data as ToJson<Definition>,\r\n          offsetPointer,\r\n          byteLength,\r\n          maxByteLength,\r\n          writeFunctions,\r\n          growBufferFunction\r\n        )\r\n\r\n        byteLength = offsetPointer.offset\r\n        maxByteLength = buffer.byteLength\r\n      } else {\r\n        // Single primitive (number)\r\n        writeFunctions[def](buffer as any, data as number, offsetPointer.offset)\r\n        offsetPointer.offset += BYTE_SIZE[def]\r\n      }\r\n    }\r\n\r\n    return buffer\r\n  }\r\n}\r\n\r\n/**\r\n * BinaryPacket definition: \\\r\n * Any packet can be defined through a \"schema\" object explaining its fields names and types.\r\n *\r\n * @example\r\n * // Imagine we have a game board where each cell is a square and is one unit big.\r\n * // A cell can be then defined by its X and Y coordinates.\r\n * // For simplicity, let's say there cannot be more than 256 cells, so we can use 8 bits for each coordinate.\r\n * const Cell = {\r\n *  x: Field.UNSIGNED_INT_8,\r\n *  y: Field.UNSIGNED_INT_8\r\n * }\r\n *\r\n * // When done with the cell definition we can create its BinaryPacket writer/reader.\r\n * // NOTE: each BinaryPacket needs an unique ID, for identification purposes and error checking.\r\n * const CellPacket = BinaryPacket.define(0, Cell)\r\n *\r\n * // Let's now make the definition of the whole game board.\r\n * // You can also specify arrays of both \"primitive\" fields and other BinaryPackets.\r\n * const Board = {\r\n *  numPlayers: Field.UNSIGNED_INT_8,\r\n *  cells: FieldArray(CellPacket)\r\n * }\r\n *\r\n * // When done with the board definition we can create its BinaryPacket writer/reader.\r\n * // NOTE: each BinaryPacket needs an unique ID, for identification purposes and error checking.\r\n * const BoardPacket = BinaryPacket.define(1, Board)\r\n *\r\n * // And use it.\r\n * const buffer = BoardPacket.writeNodeBuffer({\r\n *  numPlayers: 1,\r\n *  cells: [\r\n *    { x: 0, y: 0 },\r\n *    { x: 1, y: 1 }\r\n *  ]\r\n * })\r\n *\r\n * // sendTheBufferOver(buffer)\r\n * // ...\r\n * // const buffer = receiveTheBuffer()\r\n * const board = BoardPacket.readNodeBuffer(buffer)\r\n * // ...\r\n */\r\nexport type Definition = {\r\n  [fieldName: string]: MaybeArray<Field> | MaybeArray<BinaryPacket<Definition>>\r\n}\r\n\r\ntype MaybeArray<T> = T | [itemType: T] | [itemType: T, length: number]\r\n\r\n/**\r\n * Meta-type that converts a `Definition` schema to the type of the actual JavaScript object that will be written into a packet or read from. \\\r\n */\r\ntype ToJson<T extends Definition> = {\r\n  [K in keyof T]: T[K] extends [infer Item]\r\n    ? Item extends BinaryPacket<infer BPDef>\r\n      ? ToJson<BPDef>[]\r\n      : number[]\r\n    : T[K] extends [infer Item, infer Length]\r\n      ? Item extends BinaryPacket<infer BPDef>\r\n        ? ToJson<BPDef>[] & { length: Length }\r\n        : number[] & { length: Length }\r\n      : T[K] extends BinaryPacket<infer BPDef>\r\n        ? ToJson<BPDef>\r\n        : number\r\n}\r\n\r\n/**\r\n * In a JavaScript object, the order of its keys is not strictly defined: sort them by field name. \\\r\n * Thus, we cannot trust iterating over an object keys: we MUST iterate over its entries array. \\\r\n * This is important to make sure that whoever shares BinaryPacket definitions can correctly write/read packets independently of their JS engines.\r\n */\r\nfunction sortEntries(definition: Definition) {\r\n  return Object.entries(definition).sort(([fieldName1], [fieldName2]) =>\r\n    fieldName1.localeCompare(fieldName2)\r\n  )\r\n}\r\n\r\ntype Entries = ReturnType<typeof sortEntries>\r\n\r\n/**\r\n * Helper function that \"inspects\" the entries of a BinaryPacket definition\r\n * and returns useful \"stats\" needed for writing and reading buffers.\r\n *\r\n * This function is ever called only once per BinaryPacket definition.\r\n */\r\nfunction inspectEntries(entries: Entries) {\r\n  // The PacketID is already 1 byte, that's why we aren't starting from 0.\r\n  let minimumByteLength = 1\r\n  let canFastWrite = true\r\n\r\n  for (const [, type] of entries) {\r\n    if (Array.isArray(type)) {\r\n      if (type.length === 2) {\r\n        // Statically-sized array\r\n        const itemSize =\r\n          typeof type[0] === 'object' ? type[0].minimumByteLength : BYTE_SIZE[type[0]]\r\n\r\n        minimumByteLength += type[1] * itemSize\r\n      } else {\r\n        // Dynamically-sized array\r\n        // Adding 1 byte to serialize the array length\r\n        minimumByteLength += 1\r\n        canFastWrite = false\r\n      }\r\n    } else if (type instanceof BinaryPacket) {\r\n      minimumByteLength += type.minimumByteLength\r\n      canFastWrite &&= type.canFastWrite\r\n    } else {\r\n      minimumByteLength += BYTE_SIZE[type]\r\n    }\r\n  }\r\n\r\n  return { minimumByteLength, canFastWrite }\r\n}\r\n\r\n//////////////////////////////////////////////\r\n// The logic here is practically over       //\r\n// Here below there are needed constants    //\r\n// that map a field-type to a functionality //\r\n//////////////////////////////////////////////\r\n\r\nconst BYTE_SIZE = Array(8) as number[]\r\n\r\nBYTE_SIZE[Field.UNSIGNED_INT_8] = 1\r\nBYTE_SIZE[Field.INT_8] = 1\r\n\r\nBYTE_SIZE[Field.UNSIGNED_INT_16] = 2\r\nBYTE_SIZE[Field.INT_16] = 2\r\n\r\nBYTE_SIZE[Field.UNSIGNED_INT_32] = 4\r\nBYTE_SIZE[Field.INT_32] = 4\r\nBYTE_SIZE[Field.FLOAT_32] = 4\r\n\r\nBYTE_SIZE[Field.FLOAT_64] = 8\r\n\r\nconst GET_FUNCTION = Array(8) as ((view: DataView, offset: number) => number)[]\r\n\r\nGET_FUNCTION[Field.UNSIGNED_INT_8] = (view, offset) => view.getUint8(offset)\r\nGET_FUNCTION[Field.INT_8] = (view, offset) => view.getInt8(offset)\r\n\r\nGET_FUNCTION[Field.UNSIGNED_INT_16] = (view, offset) => view.getUint16(offset)\r\nGET_FUNCTION[Field.INT_16] = (view, offset) => view.getInt16(offset)\r\n\r\nGET_FUNCTION[Field.UNSIGNED_INT_32] = (view, offset) => view.getUint32(offset)\r\nGET_FUNCTION[Field.INT_32] = (view, offset) => view.getInt32(offset)\r\nGET_FUNCTION[Field.FLOAT_32] = (view, offset) => view.getFloat32(offset)\r\n\r\nGET_FUNCTION[Field.FLOAT_64] = (view, offset) => view.getFloat64(offset)\r\n\r\nconst SET_FUNCTION = Array(8) as ((view: DataView, value: number, offset: number) => void)[]\r\n\r\nSET_FUNCTION[Field.UNSIGNED_INT_8] = (view, value, offset) => view.setUint8(offset, value)\r\nSET_FUNCTION[Field.INT_8] = (view, value, offset) => view.setInt8(offset, value)\r\n\r\nSET_FUNCTION[Field.UNSIGNED_INT_16] = (view, value, offset) => view.setUint16(offset, value)\r\nSET_FUNCTION[Field.INT_16] = (view, value, offset) => view.setInt16(offset, value)\r\n\r\nSET_FUNCTION[Field.UNSIGNED_INT_32] = (view, value, offset) => view.setUint32(offset, value)\r\nSET_FUNCTION[Field.INT_32] = (view, value, offset) => view.setInt32(offset, value)\r\nSET_FUNCTION[Field.FLOAT_32] = (view, value, offset) => view.setFloat32(offset, value)\r\n\r\nSET_FUNCTION[Field.FLOAT_64] = (view, value, offset) => view.setFloat64(offset, value)\r\n\r\nconst SET_FUNCTION_BUF = Array(8) as ((nodeBuffer: Buffer, value: number, offset: number) => void)[]\r\n\r\nif (hasNodeBuffers) {\r\n  SET_FUNCTION_BUF[Field.UNSIGNED_INT_8] = (view, value, offset) => view.writeUint8(value, offset)\r\n  SET_FUNCTION_BUF[Field.INT_8] = (view, value, offset) => view.writeInt8(value, offset)\r\n\r\n  SET_FUNCTION_BUF[Field.UNSIGNED_INT_16] = (view, value, offset) =>\r\n    view.writeUint16LE(value, offset)\r\n  SET_FUNCTION_BUF[Field.INT_16] = (view, value, offset) => view.writeInt16LE(value, offset)\r\n\r\n  SET_FUNCTION_BUF[Field.UNSIGNED_INT_32] = (view, value, offset) =>\r\n    view.writeUint32LE(value, offset)\r\n  SET_FUNCTION_BUF[Field.INT_32] = (view, value, offset) => view.writeInt32LE(value, offset)\r\n  SET_FUNCTION_BUF[Field.FLOAT_32] = (view, value, offset) => view.writeFloatLE(value, offset)\r\n\r\n  SET_FUNCTION_BUF[Field.FLOAT_64] = (view, value, offset) => view.writeDoubleLE(value, offset)\r\n}\r\n\r\nconst GET_FUNCTION_BUF = Array(8) as ((nodeBuffer: Buffer, offset: number) => number)[]\r\n\r\nif (hasNodeBuffers) {\r\n  GET_FUNCTION_BUF[Field.UNSIGNED_INT_8] = (view, offset) => view.readUint8(offset)\r\n  GET_FUNCTION_BUF[Field.INT_8] = (view, offset) => view.readInt8(offset)\r\n\r\n  GET_FUNCTION_BUF[Field.UNSIGNED_INT_16] = (view, offset) => view.readUint16LE(offset)\r\n  GET_FUNCTION_BUF[Field.INT_16] = (view, offset) => view.readInt16LE(offset)\r\n\r\n  GET_FUNCTION_BUF[Field.UNSIGNED_INT_32] = (view, offset) => view.readUint32LE(offset)\r\n  GET_FUNCTION_BUF[Field.INT_32] = (view, offset) => view.readInt32LE(offset)\r\n  GET_FUNCTION_BUF[Field.FLOAT_32] = (view, offset) => view.readFloatLE(offset)\r\n\r\n  GET_FUNCTION_BUF[Field.FLOAT_64] = (view, offset) => view.readDoubleLE(offset)\r\n}\r\n","export const hasNodeBuffers = typeof Buffer === 'function'\r\n\r\nexport function growDataView(dataview: DataView, newByteLength: number) {\r\n  const resizedBuffer = new ArrayBuffer(newByteLength)\r\n  const amountToCopy = Math.min(dataview.byteLength, resizedBuffer.byteLength)\r\n\r\n  // Treat the buffer as if it was a Float64Array so we can copy 8 bytes at a time, to finish faster\r\n  let length = Math.trunc(amountToCopy / 8)\r\n  new Float64Array(resizedBuffer, 0, length).set(new Float64Array(dataview.buffer, 0, length))\r\n\r\n  // Copy the remaining up to 7 bytes\r\n  const offset = length * 8\r\n  length = amountToCopy - offset\r\n  new Uint8Array(resizedBuffer, offset, length).set(new Uint8Array(dataview.buffer, offset, length))\r\n\r\n  return new DataView(resizedBuffer)\r\n}\r\n\r\nexport function growNodeBuffer(buffer: Buffer, newByteLength: number) {\r\n  const newBuffer = Buffer.allocUnsafe(newByteLength)\r\n  buffer.copy(newBuffer)\r\n  return newBuffer\r\n}\r\n"],"mappings":"yaAAA,IAAAA,EAAA,GAAAC,EAAAD,EAAA,kBAAAE,EAAA,UAAAC,EAAA,eAAAC,EAAA,oBAAAC,IAAA,eAAAC,EAAAN,GCAO,IAAMO,EAAiB,OAAO,QAAW,WAEzC,SAASC,EAAaC,EAAoBC,EAAuB,CACtE,IAAMC,EAAgB,IAAI,YAAYD,CAAa,EAC7CE,EAAe,KAAK,IAAIH,EAAS,WAAYE,EAAc,UAAU,EAGvEE,EAAS,KAAK,MAAMD,EAAe,CAAC,EACxC,IAAI,aAAaD,EAAe,EAAGE,CAAM,EAAE,IAAI,IAAI,aAAaJ,EAAS,OAAQ,EAAGI,CAAM,CAAC,EAG3F,IAAMC,EAASD,EAAS,EACxB,OAAAA,EAASD,EAAeE,EACxB,IAAI,WAAWH,EAAeG,EAAQD,CAAM,EAAE,IAAI,IAAI,WAAWJ,EAAS,OAAQK,EAAQD,CAAM,CAAC,EAE1F,IAAI,SAASF,CAAa,CACnC,CAEO,SAASI,EAAeC,EAAgBN,EAAuB,CACpE,IAAMO,EAAY,OAAO,YAAYP,CAAa,EAClD,OAAAM,EAAO,KAAKC,CAAS,EACdA,CACT,CDpBO,IAAWC,OAKhBA,IAAA,eAAiB,GAAjB,iBAMAA,IAAA,qCAMAA,IAAA,qCAMAA,IAAA,iBAMAA,IAAA,mBAMAA,IAAA,mBAKAA,IAAA,uBAKAA,IAAA,uBA7CgBA,OAAA,IAwDX,SAASC,EAAuDC,EAAwB,CAC7F,MAAO,CAACA,CAAI,CACd,CASO,SAASC,EACdD,EACAE,EAC+B,CAC/B,GAAIA,EAAS,GAAK,CAAC,OAAO,SAASA,CAAM,EACvC,MAAM,IAAI,WAAW,oDAAoD,EAG3E,MAAO,CAACF,EAAME,CAAM,CACtB,CAEO,IAAMC,EAAN,MAAMC,CAAmC,CAiJtC,YACWC,EACjBC,EACA,CAFiB,cAAAD,EAGjB,KAAK,QAAUC,EAAaC,EAAYD,CAAU,EAAI,CAAC,EACvD,IAAME,EAAaC,EAAe,KAAK,OAAO,EAE9C,KAAK,kBAAoBD,EAAW,kBACpC,KAAK,aAAeA,EAAW,YACjC,CApJA,OAAO,OAA6BH,EAAkBC,EAAgB,CACpE,GAAID,EAAW,GAAK,CAAC,OAAO,SAASA,CAAQ,EAC3C,MAAM,IAAI,WAAW,uCAAuC,EAG9D,GAAIA,EAAW,IACb,MAAM,IAAI,WACR,6GACF,EAGF,OAAO,IAAID,EAAaC,EAAUC,CAAU,CAC9C,CAOA,OAAO,uBAAuBI,EAAgBC,EAAa,EAAG,CAC5D,OAAOD,EAAO,UAAUC,CAAU,CACpC,CAOA,OAAO,qBAAqBC,EAAoBD,EAAa,EAAG,CAC9D,OAAOC,EAAS,SAASD,CAAU,CACrC,CAUA,OAAO,wBAAwBE,EAA0BF,EAAoB,CAC3E,OAAO,IAAI,WAAWE,EAAaF,EAAY,CAAC,EAAE,CAAC,CACrD,CAWA,eACEG,EACAC,EAAgB,CAAE,OAAQ,CAAE,EAC5BC,EAAaF,EAAO,WACT,CACX,OAAO,KAAK,KAAKA,EAAQC,EAAeC,EAAYC,CAAgB,CACtE,CAQA,aACEH,EACAC,EAAgB,CAAE,OAAQ,CAAE,EAC5BC,EAAaF,EAAO,WACT,CACX,OAAO,KAAK,KAAKA,EAAQC,EAAeC,EAAYE,CAAY,CAClE,CAaA,gBACEJ,EACAH,EACAK,EACA,CACA,OAAO,KAAK,KACVG,EACI,OAAO,KAAKL,EAAQH,EAAYK,CAAU,EAC1C,IAAI,SAASF,EAAQH,EAAYK,CAAU,EAC/C,CAAE,OAAQ,CAAE,EACZA,EACAG,EAAiBF,EAAmBC,CACtC,CACF,CAQA,gBAAgBE,EAAoB,CAClC,IAAMV,EAAS,OAAO,YAAY,KAAK,iBAAiB,EACxD,OAAO,KAAK,MAAMA,EAAQU,EAAS,CAAE,OAAQ,CAAE,EAAGC,EAAkBC,CAAc,CACpF,CAKA,cAAcF,EAAoB,CAChC,IAAMR,EAAW,IAAI,SAAS,IAAI,YAAY,KAAK,iBAAiB,CAAC,EACrE,OAAO,KAAK,MAAMA,EAAUQ,EAAS,CAAE,OAAQ,CAAE,EAAGG,EAAcC,CAAY,CAChF,CAYA,iBAAiBJ,EAAoB,CACnC,IAAMK,EAAMN,EAAiB,KAAK,gBAAgBC,CAAO,EAAI,KAAK,cAAcA,CAAO,EACvF,MAAO,CAAE,OAAQK,EAAI,OAAQ,WAAYA,EAAI,WAAY,WAAYA,EAAI,UAAW,CACtF,CAEiB,QACR,aACA,kBAaD,KACNX,EACAC,EACAC,EACAU,EACW,CACX,GAAIV,EAAaD,EAAc,OAAS,KAAK,kBAC3C,MAAM,IAAI,MACR,uDAAuD,KAAK,QAAQ,cAAcA,EAAc,MAAM,EACxG,EAGF,GACEW,EAAc,CAAoB,EAAEZ,EAAeC,EAAc,MAAM,IAAM,KAAK,SAElF,MAAM,IAAI,MACR,kBAAkBA,EAAc,MAAM,4BAA4B,KAAK,QAAQ,EACjF,EAGFA,EAAc,QAAU,EACxB,IAAMY,EAAc,CAAC,EAErB,OAAW,CAACC,EAAMC,CAAG,IAAK,KAAK,QAC7B,GAAI,MAAM,QAAQA,CAAG,EAAG,CACtB,IAAM3B,EAEJ2B,EAAI,CAAC,GAAKH,EAAc,CAAoB,EAAEZ,EAAeC,EAAc,QAAQ,EAE/Ee,EAAQ,MAAM5B,CAAM,EAEpB6B,EAAWF,EAAI,CAAC,EAEtB,GAAI,OAAOE,GAAa,SAEtB,QAASC,EAAI,EAAGA,EAAI9B,EAAQ,EAAE8B,EAC5BF,EAAME,CAAC,EAAID,EAAS,KAAKjB,EAAQC,EAAeC,EAAYU,CAAa,MAEtE,CAEL,IAAMO,EAAWC,EAAUH,CAAQ,EAInC,QAASC,EAAI,EAAGA,EAAI9B,EAAQ,EAAE8B,EAC5BF,EAAME,CAAC,EAAIN,EAAcK,CAAQ,EAAEjB,EAAeC,EAAc,MAAM,EACtEA,EAAc,QAAUkB,CAE5B,CAGAN,EAAOC,CAAI,EAAIE,CACjB,MAAW,OAAOD,GAAQ,SAGxBF,EAAOC,CAAI,EAAIC,EAAI,KAAKf,EAAQC,EAAeC,EAAYU,CAAa,GAIxEC,EAAOC,CAAI,EAAIF,EAAcG,CAAG,EAAEf,EAAeC,EAAc,MAAM,EACrEA,EAAc,QAAUmB,EAAUL,CAAG,GAIzC,OAAOF,CACT,CAEQ,MACNjB,EACAU,EACAL,EACAoB,EACAC,EACK,CAIL,OAHAD,EAAe,CAAoB,EAAEzB,EAAe,KAAK,SAAUK,EAAc,MAAM,EACvFA,EAAc,QAAU,EAEpB,KAAK,cAGP,KAAK,UAAUL,EAAQU,EAASL,EAAeoB,CAAc,EACtDzB,GAIA,KAAK,UACVA,EACAU,EACAL,EACA,KAAK,kBACL,KAAK,kBACLoB,EACAC,CACF,CAEJ,CAKQ,UACN1B,EACAU,EACAL,EACAoB,EACA,CACA,OAAW,CAACP,EAAMC,CAAG,IAAK,KAAK,QAC7B,GAAI,MAAM,QAAQA,CAAG,EAAG,CAEtB,IAAME,EAAWF,EAAI,CAAC,EAChB3B,EAAS2B,EAAI,CAAC,EACdQ,EAAOjB,EAAQQ,CAAI,EAEzB,GAAI,OAAOG,GAAa,SACtB,QAASC,EAAI,EAAGA,EAAI9B,EAAQ,EAAE8B,EAC5BD,EAAS,UAAUrB,EAAQ2B,EAAKL,CAAC,EAAyBjB,EAAeoB,CAAc,MAEpF,CACL,IAAMF,EAAWC,EAAUH,CAAQ,EAEnC,QAASC,EAAI,EAAGA,EAAI9B,EAAQ,EAAE8B,EAC5BG,EAAeJ,CAAQ,EAAErB,EAAe2B,EAAKL,CAAC,EAAajB,EAAc,MAAM,EAC/EA,EAAc,QAAUkB,CAE5B,CACF,MAAW,OAAOJ,GAAQ,SAGxBA,EAAI,UAAUnB,EAAQU,EAAQQ,CAAI,EAAyBb,EAAeoB,CAAc,GAGxFA,EAAeN,CAAG,EAAEnB,EAAeU,EAAQQ,CAAI,EAAab,EAAc,MAAM,EAChFA,EAAc,QAAUmB,EAAUL,CAAG,EAG3C,CAMQ,UACNnB,EACAU,EACAL,EACAC,EACAsB,EACAH,EACAC,EACK,CACL,OAAW,CAACR,EAAMC,CAAG,IAAK,KAAK,QAAS,CACtC,IAAMQ,EAAOjB,EAAQQ,CAAI,EAEzB,GAAI,MAAM,QAAQC,CAAG,EAAG,CAGtB,IAAM3B,EAAUmC,EAAe,OACzBE,EAAiBV,EAAI,CAAC,IAAM,OASlC,GALIU,IACFJ,EAAe,CAAoB,EAAEzB,EAAeR,EAAQa,EAAc,MAAM,EAChFA,EAAc,QAAU,GAGtBb,EAAS,EAAG,CACd,IAAM6B,EAAWF,EAAI,CAAC,EAEtB,GAAI,OAAOE,GAAa,SAAU,CAGhC,GAAIQ,EAAgB,CAClB,IAAMC,EAAyBtC,EAAS6B,EAAS,kBAEjDf,GAAcwB,EACdF,GAAiBE,EAEb9B,EAAO,WAAa4B,IACtB5B,EAAS0B,EAAmB1B,EAAQ4B,CAAa,EAErD,CAEA,QAAWG,KAAUJ,EACnBF,EAAe,CAAoB,EACjCzB,EACAqB,EAAS,SACThB,EAAc,MAChB,EAEAA,EAAc,QAAU,EAExBL,EAASqB,EAAS,UAChBrB,EACA+B,EACA1B,EACAC,EACAsB,EACAH,EACAC,CACF,EAEApB,EAAaD,EAAc,OAC3BuB,EAAgB5B,EAAO,UAE3B,KAAO,CAEL,IAAMuB,EAAWC,EAAUH,CAAQ,EAEnC,GAAIQ,EAAgB,CAClB,IAAMC,EAAyBtC,EAAS+B,EAExCjB,GAAcwB,EACdF,GAAiBE,EAEb9B,EAAO,WAAa4B,IACtB5B,EAAS0B,EAAmB1B,EAAQ4B,CAAa,EAErD,CAIA,QAAWI,KAAUL,EACnBF,EAAeJ,CAAQ,EAAErB,EAAegC,EAAQ3B,EAAc,MAAM,EACpEA,EAAc,QAAUkB,CAE5B,CACF,CACF,MAAW,OAAOJ,GAAQ,UAExBM,EAAe,CAAoB,EAAEzB,EAAemB,EAAI,SAAUd,EAAc,MAAM,EACtFA,EAAc,QAAU,EAExBL,EAASmB,EAAI,UACXnB,EACA2B,EACAtB,EACAC,EACAsB,EACAH,EACAC,CACF,EAEApB,EAAaD,EAAc,OAC3BuB,EAAgB5B,EAAO,aAGvByB,EAAeN,CAAG,EAAEnB,EAAe2B,EAAgBtB,EAAc,MAAM,EACvEA,EAAc,QAAUmB,EAAUL,CAAG,EAEzC,CAEA,OAAOnB,CACT,CACF,EAyEA,SAASH,EAAYD,EAAwB,CAC3C,OAAO,OAAO,QAAQA,CAAU,EAAE,KAAK,CAAC,CAACqC,CAAU,EAAG,CAACC,CAAU,IAC/DD,EAAW,cAAcC,CAAU,CACrC,CACF,CAUA,SAASnC,EAAeoC,EAAkB,CAExC,IAAIC,EAAoB,EACpBC,EAAe,GAEnB,OAAW,CAAC,CAAEC,CAAI,IAAKH,EACrB,GAAI,MAAM,QAAQG,CAAI,EACpB,GAAIA,EAAK,SAAW,EAAG,CAErB,IAAMf,EACJ,OAAOe,EAAK,CAAC,GAAM,SAAWA,EAAK,CAAC,EAAE,kBAAoBd,EAAUc,EAAK,CAAC,CAAC,EAE7EF,GAAqBE,EAAK,CAAC,EAAIf,CACjC,MAGEa,GAAqB,EACrBC,EAAe,QAERC,aAAgB7C,GACzB2C,GAAqBE,EAAK,kBAC1BD,IAAiBC,EAAK,cAEtBF,GAAqBZ,EAAUc,CAAI,EAIvC,MAAO,CAAE,kBAAAF,EAAmB,aAAAC,CAAa,CAC3C,CAQA,IAAMb,EAAY,MAAM,CAAC,EAEzBA,EAAU,CAAoB,EAAI,EAClCA,EAAU,CAAW,EAAI,EAEzBA,EAAU,CAAqB,EAAI,EACnCA,EAAU,CAAY,EAAI,EAE1BA,EAAU,CAAqB,EAAI,EACnCA,EAAU,CAAY,EAAI,EAC1BA,EAAU,CAAc,EAAI,EAE5BA,EAAU,CAAc,EAAI,EAE5B,IAAMhB,EAAe,MAAM,CAAC,EAE5BA,EAAa,CAAoB,EAAI,CAAC+B,EAAMC,IAAWD,EAAK,SAASC,CAAM,EAC3EhC,EAAa,CAAW,EAAI,CAAC+B,EAAMC,IAAWD,EAAK,QAAQC,CAAM,EAEjEhC,EAAa,CAAqB,EAAI,CAAC+B,EAAMC,IAAWD,EAAK,UAAUC,CAAM,EAC7EhC,EAAa,CAAY,EAAI,CAAC+B,EAAMC,IAAWD,EAAK,SAASC,CAAM,EAEnEhC,EAAa,CAAqB,EAAI,CAAC+B,EAAMC,IAAWD,EAAK,UAAUC,CAAM,EAC7EhC,EAAa,CAAY,EAAI,CAAC+B,EAAMC,IAAWD,EAAK,SAASC,CAAM,EACnEhC,EAAa,CAAc,EAAI,CAAC+B,EAAMC,IAAWD,EAAK,WAAWC,CAAM,EAEvEhC,EAAa,CAAc,EAAI,CAAC+B,EAAMC,IAAWD,EAAK,WAAWC,CAAM,EAEvE,IAAM3B,EAAe,MAAM,CAAC,EAE5BA,EAAa,CAAoB,EAAI,CAAC0B,EAAME,EAAOD,IAAWD,EAAK,SAASC,EAAQC,CAAK,EACzF5B,EAAa,CAAW,EAAI,CAAC0B,EAAME,EAAOD,IAAWD,EAAK,QAAQC,EAAQC,CAAK,EAE/E5B,EAAa,CAAqB,EAAI,CAAC0B,EAAME,EAAOD,IAAWD,EAAK,UAAUC,EAAQC,CAAK,EAC3F5B,EAAa,CAAY,EAAI,CAAC0B,EAAME,EAAOD,IAAWD,EAAK,SAASC,EAAQC,CAAK,EAEjF5B,EAAa,CAAqB,EAAI,CAAC0B,EAAME,EAAOD,IAAWD,EAAK,UAAUC,EAAQC,CAAK,EAC3F5B,EAAa,CAAY,EAAI,CAAC0B,EAAME,EAAOD,IAAWD,EAAK,SAASC,EAAQC,CAAK,EACjF5B,EAAa,CAAc,EAAI,CAAC0B,EAAME,EAAOD,IAAWD,EAAK,WAAWC,EAAQC,CAAK,EAErF5B,EAAa,CAAc,EAAI,CAAC0B,EAAME,EAAOD,IAAWD,EAAK,WAAWC,EAAQC,CAAK,EAErF,IAAM9B,EAAmB,MAAM,CAAC,EAE5BF,IACFE,EAAiB,CAAoB,EAAI,CAAC4B,EAAME,EAAOD,IAAWD,EAAK,WAAWE,EAAOD,CAAM,EAC/F7B,EAAiB,CAAW,EAAI,CAAC4B,EAAME,EAAOD,IAAWD,EAAK,UAAUE,EAAOD,CAAM,EAErF7B,EAAiB,CAAqB,EAAI,CAAC4B,EAAME,EAAOD,IACtDD,EAAK,cAAcE,EAAOD,CAAM,EAClC7B,EAAiB,CAAY,EAAI,CAAC4B,EAAME,EAAOD,IAAWD,EAAK,aAAaE,EAAOD,CAAM,EAEzF7B,EAAiB,CAAqB,EAAI,CAAC4B,EAAME,EAAOD,IACtDD,EAAK,cAAcE,EAAOD,CAAM,EAClC7B,EAAiB,CAAY,EAAI,CAAC4B,EAAME,EAAOD,IAAWD,EAAK,aAAaE,EAAOD,CAAM,EACzF7B,EAAiB,CAAc,EAAI,CAAC4B,EAAME,EAAOD,IAAWD,EAAK,aAAaE,EAAOD,CAAM,EAE3F7B,EAAiB,CAAc,EAAI,CAAC4B,EAAME,EAAOD,IAAWD,EAAK,cAAcE,EAAOD,CAAM,GAG9F,IAAMjC,EAAmB,MAAM,CAAC,EAE5BE,IACFF,EAAiB,CAAoB,EAAI,CAACgC,EAAMC,IAAWD,EAAK,UAAUC,CAAM,EAChFjC,EAAiB,CAAW,EAAI,CAACgC,EAAMC,IAAWD,EAAK,SAASC,CAAM,EAEtEjC,EAAiB,CAAqB,EAAI,CAACgC,EAAMC,IAAWD,EAAK,aAAaC,CAAM,EACpFjC,EAAiB,CAAY,EAAI,CAACgC,EAAMC,IAAWD,EAAK,YAAYC,CAAM,EAE1EjC,EAAiB,CAAqB,EAAI,CAACgC,EAAMC,IAAWD,EAAK,aAAaC,CAAM,EACpFjC,EAAiB,CAAY,EAAI,CAACgC,EAAMC,IAAWD,EAAK,YAAYC,CAAM,EAC1EjC,EAAiB,CAAc,EAAI,CAACgC,EAAMC,IAAWD,EAAK,YAAYC,CAAM,EAE5EjC,EAAiB,CAAc,EAAI,CAACgC,EAAMC,IAAWD,EAAK,aAAaC,CAAM","names":["src_exports","__export","BinaryPacket","Field","FieldArray","FieldFixedArray","__toCommonJS","hasNodeBuffers","growDataView","dataview","newByteLength","resizedBuffer","amountToCopy","length","offset","growNodeBuffer","buffer","newBuffer","Field","FieldArray","item","FieldFixedArray","length","BinaryPacket","_BinaryPacket","packetId","definition","sortEntries","inspection","inspectEntries","buffer","byteOffset","dataview","arraybuffer","dataIn","offsetPointer","byteLength","GET_FUNCTION_BUF","GET_FUNCTION","hasNodeBuffers","dataOut","SET_FUNCTION_BUF","growNodeBuffer","SET_FUNCTION","growDataView","buf","readFunctions","result","name","def","array","itemType","i","itemSize","BYTE_SIZE","writeFunctions","growBufferFunction","data","maxByteLength","isDynamicArray","neededBytesForElements","object","number","fieldName1","fieldName2","entries","minimumByteLength","canFastWrite","type","view","offset","value"]}
+{"version":3,"sources":["../src/index.ts","../src/buffers.ts"],"sourcesContent":["import { growDataView, growNodeBuffer, hasNodeBuffers, type TrueArrayBuffer } from './buffers'\r\n\r\nexport const enum Field {\r\n  /**\r\n   * Defines a 1 byte (8 bits) unsigned integer field. \\\r\n   * (Range: 0 - 255)\r\n   */\r\n  UNSIGNED_INT_8 = 0,\r\n\r\n  /**\r\n   * Defines a 2 bytes (16 bits) unsigned integer field. \\\r\n   * (Range: 0 - 65535)\r\n   */\r\n  UNSIGNED_INT_16,\r\n\r\n  /**\r\n   * Defines a 4 bytes (32 bits) unsigned integer field. \\\r\n   * (Range: 0 - 4294967295)\r\n   */\r\n  UNSIGNED_INT_32,\r\n\r\n  /**\r\n   * Defines a 1 byte (8 bits) signed integer field. \\\r\n   * (Range: -128 - 127)\r\n   */\r\n  INT_8,\r\n\r\n  /**\r\n   * Defines a 2 bytes (16 bits) signed integer field. \\\r\n   * (Range: -32768 - 32767)\r\n   */\r\n  INT_16,\r\n\r\n  /**\r\n   * Defines a 4 bytes (32 bits) signed integer field. \\\r\n   * (Range: -2147483648 - 2147483647)\r\n   */\r\n  INT_32,\r\n\r\n  /**\r\n   * Defines a 4 bytes (32 bits) floating-point field. \\\r\n   */\r\n  FLOAT_32,\r\n\r\n  /**\r\n   * Defines a 8 bytes (64 bits) floating-point field. \\\r\n   */\r\n  FLOAT_64\r\n}\r\n\r\n/**\r\n * Defines a dynamically-sized array with elements of a certain type. \\\r\n * Dynamically-sized arrays are useful when a packet's field is an array of a non pre-defined length. \\\r\n * Although, this makes dynamically-sized arrays more memory expensive as the internal buffer needs to be grown accordingly.\r\n *\r\n * NOTE: If an array will ALWAYS have the same length, prefer using the `FieldFixedArray` type, for both better performance and memory efficiency. \\\r\n * NOTE: As of now, dynamic arrays can have at most 256 elements.\r\n */\r\nexport function FieldArray<T extends Field | BinaryPacket<Definition>>(item: T): [itemType: T] {\r\n  return [item]\r\n}\r\n\r\n/**\r\n * Defines a statically-sized array with elements of a certain type. \\\r\n * Fixed arrays are useful when a packet's field is an array of a pre-defined length. \\\r\n * Fixed arrays much more memory efficient and performant than non-fixed ones.\r\n *\r\n * NOTE: If an array will not always have the same length, use the `FieldArray` type.\r\n */\r\nexport function FieldFixedArray<T extends Field | BinaryPacket<Definition>, Length extends number>(\r\n  item: T,\r\n  length: Length\r\n): [itemType: T, length: Length] {\r\n  if (length < 0 || !Number.isFinite(length)) {\r\n    throw new RangeError('Length of a FixedArray must be a positive integer.')\r\n  }\r\n\r\n  return [item, length]\r\n}\r\n\r\ntype BitFlags = (string[] | ReadonlyArray<string>) & {\r\n  length: 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8\r\n}\r\n\r\n/**\r\n * Defines a sequence of up to 8 \"flags\" (basically single bits/booleans) that can be packed together into a single 8 bits value. \\\r\n * This is useful for minimizing bytes usage when there are lots of boolean fields/flags, instead of saving each flag separately as its own 8 bits value.\r\n *\r\n * The input should be an array of strings (with at most 8 elements) where each string defines the name of a flag. \\\r\n * This is just for definition purposes, then when actually writing or reading packets it'll just be a record-object with those names as keys and boolean values.\r\n */\r\nexport function FieldBitFlags<const FlagsArray extends BitFlags>(flags: FlagsArray) {\r\n  if (flags.length > 8) {\r\n    throw new Error(\r\n      `Invalid BinaryPacket definition: a BitFlags field can have only up to 8 flags, given: ${flags.join(', ')}`\r\n    )\r\n  }\r\n\r\n  return { flags }\r\n}\r\n\r\n/**\r\n * Do not manually construct this type: an object of this kind is returned by a BinaryPacket `createVisitor` method. \\\r\n * Used in the `BinaryPacket::visit` static method to perform a sort of \"pattern matching\" on an incoming packet (of yet unknown type) buffer.\r\n */\r\ntype Visitor = [BinaryPacket<Definition>, (packet: any) => void]\r\n\r\nexport class BinaryPacket<T extends Definition> {\r\n  /**\r\n   * Defines a new binary packet. \\\r\n   * Make sure that every `packetId` is unique.\r\n   * @throws RangeError If packetId is negative, floating-point, or greater than 255.\r\n   */\r\n  static define<T extends Definition>(packetId: number, definition?: T) {\r\n    if (packetId < 0 || !Number.isFinite(packetId)) {\r\n      throw new RangeError('Packet IDs must be positive integers.')\r\n    }\r\n\r\n    if (packetId > 255) {\r\n      throw new RangeError(\r\n        'Packet IDs greater than 255 are not supported. Do you REALLY need more than 255 different kinds of packets?'\r\n      )\r\n    }\r\n\r\n    return new BinaryPacket(packetId, definition)\r\n  }\r\n\r\n  /**\r\n   * Reads just the packetId from the given Buffer. \\\r\n   * This method practically just reads the uint8 at offset `byteOffset` (default: 0). \\\r\n   * Useful if the receiving side receives multiple types of packets.\r\n   */\r\n  static readPacketIdNodeBuffer(buffer: Buffer, byteOffset = 0) {\r\n    return buffer.readUint8(byteOffset)\r\n  }\r\n\r\n  /**\r\n   * Reads just the packetId from the given DataView. \\\r\n   * This method practically just reads the uint8 at offset `byteOffset` (default: 0). \\\r\n   * Useful if the receiving side receives multiple types of packets.\r\n   */\r\n  static readPacketIdDataView(dataview: DataView, byteOffset = 0) {\r\n    return dataview.getUint8(byteOffset)\r\n  }\r\n\r\n  /**\r\n   * Reads just the packetId from the given ArrayBuffer. \\\r\n   * This method practically just reads the uint8 at offset `byteOffset`. \\\r\n   * Useful if the receiving side receives multiple types of packets.\r\n   *\r\n   * NOTE: Due to security issues, the `byteOffset` argument cannot be defaulted and must be provided by the user. \\\r\n   * NOTE: For more information read the `readArrayBuffer` method documentation.\r\n   */\r\n  static readPacketIdArrayBuffer(arraybuffer: TrueArrayBuffer, byteOffset: number) {\r\n    return new Uint8Array(arraybuffer, byteOffset, 1)[0]\r\n  }\r\n\r\n  /**\r\n   * Visits and \"pattern matches\" the given Buffer through the given visitors. \\\r\n   * The Buffer is compared to the series of visitors through its Packet ID, and, if an appropriate visitor is found: its callback is called.\r\n   *\r\n   * NOTE: If visiting packets in a loop, for both performance and memory efficiency reasons, it is much better to create each visitor only once before the loop starts and not every iteration.\r\n   */\r\n  static visitNodeBuffer(buffer: Buffer, ...visitors: Visitor[]) {\r\n    return BinaryPacket.visit(buffer, GET_FUNCTION_BUF, visitors)\r\n  }\r\n\r\n  /**\r\n   * Visits and \"pattern matches\" the given DataView through the given visitors. \\\r\n   * The DataView is compared to the series of visitors through its Packet ID, and, if an appropriate visitor is found: its callback is called.\r\n   *\r\n   * NOTE: If visiting packets in a loop, for both performance and memory efficiency reasons, it is much better to create each visitor only once before the loop starts and not every iteration.\r\n   */\r\n  static visitDataView(dataview: DataView, ...visitors: Visitor[]) {\r\n    return BinaryPacket.visit(dataview, GET_FUNCTION, visitors)\r\n  }\r\n\r\n  /**\r\n   * Visits and \"pattern matches\" the given ArrayBuffer through the given visitors. \\\r\n   * The ArrayBuffer is compared to the series of visitors through its Packet ID, and, if an appropriate visitor is found: its callback is called.\r\n   *\r\n   * NOTE: Due to security issues, the `byteOffset` and `byteLength` arguments must be provided by the user. \\\r\n   * NOTE: For more information read the `readArrayBuffer` method documentation. \\\r\n   * NOTE: If visiting packets in a loop, for both performance and memory efficiency reasons, it is much better to create each visitor only once before the loop starts and not every iteration.\r\n   */\r\n  static visitArrayBuffer(\r\n    arraybuffer: TrueArrayBuffer,\r\n    byteOffset: number,\r\n    byteLength: number,\r\n    ...visitors: Visitor[]\r\n  ) {\r\n    return BinaryPacket.visit(\r\n      new DataView(arraybuffer, byteOffset, byteLength),\r\n      GET_FUNCTION,\r\n      visitors\r\n    )\r\n  }\r\n\r\n  /**\r\n   * Reads/deserializes from the given Buffer. \\\r\n   * Method available ONLY on NodeJS and Bun.\r\n   *\r\n   * If possible, always prefer reading using this method, as it is much faster than the other ones.\r\n   *\r\n   * NOTE: if you have an ArrayBuffer do not bother wrapping it into a node Buffer yourself. \\\r\n   * NOTE: if you have an ArrayBuffer use the appropriate `readArrayBuffer`.\r\n   */\r\n  readNodeBuffer(\r\n    dataIn: Buffer,\r\n    offsetPointer = { offset: 0 },\r\n    byteLength = dataIn.byteLength\r\n  ): ToJson<T> {\r\n    return this.read(dataIn, offsetPointer, byteLength, GET_FUNCTION_BUF)\r\n  }\r\n\r\n  /**\r\n   * Reads/deserializes from the given DataView.\r\n   *\r\n   * NOTE: if you have an ArrayBuffer do not bother wrapping it into a DataView yourself. \\\r\n   * NOTE: if you have an ArrayBuffer use the appropriate `readArrayBuffer`.\r\n   */\r\n  readDataView(\r\n    dataIn: DataView,\r\n    offsetPointer = { offset: 0 },\r\n    byteLength = dataIn.byteLength\r\n  ): ToJson<T> {\r\n    return this.read(dataIn, offsetPointer, byteLength, GET_FUNCTION)\r\n  }\r\n\r\n  /**\r\n   * Reads/deserializes from the given ArrayBuffer. \\\r\n   * WARNING: this method is practically a HACK.\r\n   *\r\n   * When using this method both the `byteOffset` and `byteLength` are REQUIRED and cannot be defaulted. \\\r\n   * This is to prevent serious bugs and security issues. \\\r\n   * That is because often raw ArrayBuffers come from a pre-allocated buffer pool and do not start at byteOffset 0.\r\n   *\r\n   * NOTE: if you have a node Buffer do not bother wrapping it into an ArrayBuffer yourself. \\\r\n   * NOTE: if you have a node Buffer use the appropriate `readNodeBuffer` as it is much faster and less error prone.\r\n   */\r\n  readArrayBuffer(dataIn: TrueArrayBuffer, byteOffset: number, byteLength: number) {\r\n    return this.read(\r\n      hasNodeBuffers\r\n        ? Buffer.from(dataIn, byteOffset, byteLength)\r\n        : new DataView(dataIn, byteOffset, byteLength),\r\n      { offset: 0 }, // The underlying buffer has already been offsetted\r\n      byteLength,\r\n      hasNodeBuffers ? GET_FUNCTION_BUF : GET_FUNCTION\r\n    )\r\n  }\r\n\r\n  /**\r\n   * Writes/serializes the given object into a Buffer. \\\r\n   * Method available ONLY on NodeJS and Bun.\r\n   *\r\n   * If possible, always prefer writing using this method, as it is much faster than the other ones.\r\n   */\r\n  writeNodeBuffer(dataOut: ToJson<T>) {\r\n    const buffer = Buffer.allocUnsafe(this.minimumByteLength)\r\n    return this.write(buffer, dataOut, { offset: 0 }, SET_FUNCTION_BUF, growNodeBuffer)\r\n  }\r\n\r\n  /**\r\n   * Writes/serializes the given object into a DataView. \\\r\n   */\r\n  writeDataView(dataOut: ToJson<T>) {\r\n    const dataview = new DataView(new ArrayBuffer(this.minimumByteLength))\r\n    return this.write(dataview, dataOut, { offset: 0 }, SET_FUNCTION, growDataView)\r\n  }\r\n\r\n  /**\r\n   * Writes/serializes the given object into an ArrayBuffer. \\\r\n   * This method is just a wrapper around either  `writeNodeBuffer` or `writeDataView`. \\\r\n   *\r\n   * This method works with JavaScript standard raw ArrayBuffer(s) and, as such, is very error prone: \\\r\n   * Make sure you're using the returned byteLength and byteOffset fields in the read counterpart. \\\r\n   *\r\n   * Always consider whether is possible to use directly `writeNodeBuffer` or `writeDataView` instead of `writeArrayBuffer`. \\\r\n   * For more information read the `readArrayBuffer` documentation.\r\n   */\r\n  writeArrayBuffer(dataOut: ToJson<T>) {\r\n    const buf = hasNodeBuffers ? this.writeNodeBuffer(dataOut) : this.writeDataView(dataOut)\r\n    return { buffer: buf.buffer, byteLength: buf.byteLength, byteOffset: buf.byteOffset }\r\n  }\r\n\r\n  /**\r\n   * Creates a \"visitor\" object for this BinaryPacket definition. \\\r\n   * Used when visiting and \"pattern matching\" buffers with the `BinaryPacket::visit` static utility methods. \\\r\n   *\r\n   * For more information read the `BinaryPacket::visitNodeBuffer` documentation. \\\r\n   * NOTE: If visiting packets in a loop, for both performance and memory efficiency reasons, it is much better to create each visitor only once before the loop starts and not every iteration.\r\n   */\r\n  visitor(onVisit: (packet: ToJson<T>) => void): Visitor {\r\n    return [this, onVisit]\r\n  }\r\n\r\n  /// PRIVATE\r\n\r\n  private readonly entries: Entries\r\n  readonly canFastWrite: boolean\r\n  readonly minimumByteLength: number\r\n\r\n  private constructor(\r\n    private readonly packetId: number,\r\n    definition?: T\r\n  ) {\r\n    this.entries = definition ? sortEntries(definition) : []\r\n    const inspection = inspectEntries(this.entries)\r\n\r\n    this.minimumByteLength = inspection.minimumByteLength\r\n    this.canFastWrite = inspection.canFastWrite\r\n  }\r\n\r\n  private static visit(\r\n    dataIn: Buffer | DataView,\r\n    readFunctions: typeof GET_FUNCTION | typeof GET_FUNCTION_BUF,\r\n    visitors: Visitor[]\r\n  ) {\r\n    for (const [Packet, onVisit] of visitors) {\r\n      if (Packet.packetId === readFunctions[Field.UNSIGNED_INT_8](dataIn as any, 0)) {\r\n        return onVisit(Packet.read(dataIn, { offset: 0 }, dataIn.byteLength, readFunctions))\r\n      }\r\n    }\r\n  }\r\n\r\n  private read(\r\n    dataIn: DataView | Buffer,\r\n    offsetPointer: { offset: number },\r\n    byteLength: number,\r\n    readFunctions: typeof GET_FUNCTION | typeof GET_FUNCTION_BUF\r\n  ): ToJson<T> {\r\n    if (byteLength + offsetPointer.offset < this.minimumByteLength) {\r\n      throw new Error(\r\n        `There is no space available to fit a packet of type ${this.packetId} at offset ${offsetPointer.offset}`\r\n      )\r\n    }\r\n\r\n    if (\r\n      readFunctions[Field.UNSIGNED_INT_8](dataIn as any, offsetPointer.offset) !== this.packetId\r\n    ) {\r\n      throw new Error(\r\n        `Data at offset ${offsetPointer.offset} is not a packet of type ${this.packetId}`\r\n      )\r\n    }\r\n\r\n    offsetPointer.offset += 1\r\n    const result: any = {}\r\n\r\n    for (const [name, def] of this.entries) {\r\n      if (Array.isArray(def)) {\r\n        const length =\r\n          // def[1] is the length of a statically-sized array, if undefined: must read the length from the buffer as it means it's a dynamically-sized array\r\n          def[1] ?? readFunctions[Field.UNSIGNED_INT_8](dataIn as any, offsetPointer.offset++)\r\n\r\n        const array = Array(length)\r\n\r\n        const itemType = def[0]\r\n\r\n        if (typeof itemType === 'object') {\r\n          // Array of \"subpackets\"\r\n          for (let i = 0; i < length; ++i) {\r\n            array[i] = itemType.read(dataIn, offsetPointer, byteLength, readFunctions)\r\n          }\r\n        } else {\r\n          // Array of primitives (numbers)\r\n          const itemSize = BYTE_SIZE[itemType]\r\n\r\n          // It seems like looping over each element is actually much faster than using TypedArrays bulk copy.\r\n          // TODO: properly benchmark with various array sizes to see if it's actually the case.\r\n          for (let i = 0; i < length; ++i) {\r\n            array[i] = readFunctions[itemType](dataIn as any, offsetPointer.offset)\r\n            offsetPointer.offset += itemSize\r\n          }\r\n        }\r\n\r\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access\r\n        result[name] = array\r\n      } else if (typeof def === 'number') {\r\n        // Single primitive (number)\r\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access\r\n        result[name] = readFunctions[def](dataIn as any, offsetPointer.offset)\r\n        offsetPointer.offset += BYTE_SIZE[def]\r\n      } else if ('flags' in def) {\r\n        // BitFlags\r\n        const flags = readFunctions[Field.UNSIGNED_INT_8](dataIn as any, offsetPointer.offset)\r\n        offsetPointer.offset += 1\r\n\r\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access\r\n        result[name] = {}\r\n\r\n        for (let bit = 0; bit < def.flags.length; ++bit) {\r\n          // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access\r\n          result[name][def.flags[bit]] = !!(flags & (1 << bit))\r\n        }\r\n      } else {\r\n        // Single \"subpacket\"\r\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access\r\n        result[name] = def.read(dataIn, offsetPointer, byteLength, readFunctions)\r\n      }\r\n    }\r\n\r\n    return result as ToJson<T>\r\n  }\r\n\r\n  private write<Buf extends DataView | Buffer>(\r\n    buffer: Buf,\r\n    dataOut: ToJson<T>,\r\n    offsetPointer: { offset: number },\r\n    writeFunctions: typeof SET_FUNCTION | typeof SET_FUNCTION_BUF,\r\n    growBufferFunction: (buffer: Buf, newByteLength: number) => Buf\r\n  ): Buf {\r\n    writeFunctions[Field.UNSIGNED_INT_8](buffer as any, this.packetId, offsetPointer.offset)\r\n    offsetPointer.offset += 1\r\n\r\n    if (this.canFastWrite) {\r\n      // If there are no arrays, the minimumByteLength always equals to the full needed byteLength.\r\n      // So we can take the fast path, since we know beforehand that the buffer isn't going to grow.\r\n      this.fastWrite(buffer, dataOut, offsetPointer, writeFunctions)\r\n      return buffer\r\n    } else {\r\n      // If non-empty arrays are encountered, the buffer must grow.\r\n      // If every array is empty, the speed of this path is comparable to the fast path.\r\n      return this.slowWrite(\r\n        buffer,\r\n        dataOut,\r\n        offsetPointer,\r\n        this.minimumByteLength,\r\n        this.minimumByteLength,\r\n        writeFunctions,\r\n        growBufferFunction\r\n      )\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Fast write does not support writing dynamically-sized arrays.\r\n   */\r\n  private fastWrite<Buf extends DataView | Buffer>(\r\n    buffer: Buf,\r\n    dataOut: ToJson<T>,\r\n    offsetPointer: { offset: number },\r\n    writeFunctions: typeof SET_FUNCTION | typeof SET_FUNCTION_BUF\r\n  ) {\r\n    for (const [name, def] of this.entries) {\r\n      const data = dataOut[name]\r\n\r\n      if (Array.isArray(def)) {\r\n        // Statically-sized array\r\n        const itemType = def[0]\r\n        const length = def[1]!\r\n\r\n        if (typeof itemType === 'object') {\r\n          for (let i = 0; i < length; ++i) {\r\n            itemType.fastWrite(\r\n              buffer,\r\n              (data as any[])[i] as ToJson<Definition>,\r\n              offsetPointer,\r\n              writeFunctions\r\n            )\r\n          }\r\n        } else {\r\n          const itemSize = BYTE_SIZE[itemType]\r\n\r\n          for (let i = 0; i < length; ++i) {\r\n            writeFunctions[itemType](buffer as any, (data as number[])[i], offsetPointer.offset)\r\n            offsetPointer.offset += itemSize\r\n          }\r\n        }\r\n      } else if (typeof def === 'number') {\r\n        // Single primitive (number)\r\n        writeFunctions[def](buffer as any, data as number, offsetPointer.offset)\r\n        offsetPointer.offset += BYTE_SIZE[def]\r\n      } else if ('flags' in def) {\r\n        // BitFlags\r\n        let flags = 0\r\n\r\n        for (let bit = 0; bit < def.flags.length; ++bit) {\r\n          if ((data as Record<string, boolean>)[def.flags[bit]]) {\r\n            flags |= 1 << bit\r\n          }\r\n        }\r\n\r\n        writeFunctions[Field.UNSIGNED_INT_8](buffer as any, flags, offsetPointer.offset)\r\n        offsetPointer.offset += 1\r\n      } else {\r\n        // Single \"subpacket\"\r\n        // In fastWrite there cannot be arrays, but the cast is needed because TypeScript can't possibly know that.\r\n        def.fastWrite(buffer, data as ToJson<Definition>, offsetPointer, writeFunctions)\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * The slow writing path tries writing data into the buffer as fast as the fast writing path does. \\\r\n   * But, if a non-empty dynamically-sized array is encountered, the buffer needs to grow, slightly reducing performance.\r\n   */\r\n  private slowWrite<Buf extends DataView | Buffer>(\r\n    buffer: Buf,\r\n    dataOut: ToJson<T>,\r\n    offsetPointer: { offset: number },\r\n    byteLength: number,\r\n    maxByteLength: number,\r\n    writeFunctions: typeof SET_FUNCTION | typeof SET_FUNCTION_BUF,\r\n    growBufferFunction: (buffer: Buf, newByteLength: number) => Buf\r\n  ): Buf {\r\n    for (const [name, def] of this.entries) {\r\n      const data = dataOut[name]\r\n\r\n      if (Array.isArray(def)) {\r\n        // Could be both an array of just numbers or \"subpackets\"\r\n\r\n        const length = (data as any[]).length\r\n        const isDynamicArray = def[1] === undefined\r\n\r\n        // Check if it is a dynamically-sized array, if it is, the length of the array must be serialized in the buffer before its elements\r\n        // Explicitly check for undefined and not falsy values because it could be a statically-sized array of 0 elements.\r\n        if (isDynamicArray) {\r\n          writeFunctions[Field.UNSIGNED_INT_8](buffer as any, length, offsetPointer.offset)\r\n          offsetPointer.offset += 1\r\n        }\r\n\r\n        if (length > 0) {\r\n          const itemType = def[0]\r\n\r\n          if (typeof itemType === 'object') {\r\n            // Array of \"subpackets\"\r\n\r\n            if (isDynamicArray) {\r\n              const neededBytesForElements = length * itemType.minimumByteLength\r\n\r\n              byteLength += neededBytesForElements\r\n              maxByteLength += neededBytesForElements\r\n\r\n              if (buffer.byteLength < maxByteLength) {\r\n                buffer = growBufferFunction(buffer, maxByteLength)\r\n              }\r\n            }\r\n\r\n            for (const object of data as unknown as ToJson<Definition>[]) {\r\n              writeFunctions[Field.UNSIGNED_INT_8](\r\n                buffer as any,\r\n                itemType.packetId,\r\n                offsetPointer.offset\r\n              )\r\n\r\n              offsetPointer.offset += 1\r\n\r\n              buffer = itemType.slowWrite(\r\n                buffer,\r\n                object,\r\n                offsetPointer,\r\n                byteLength,\r\n                maxByteLength,\r\n                writeFunctions,\r\n                growBufferFunction\r\n              )\r\n\r\n              byteLength = offsetPointer.offset\r\n              maxByteLength = buffer.byteLength\r\n            }\r\n          } else {\r\n            // Array of primitives (numbers)\r\n            const itemSize = BYTE_SIZE[itemType]\r\n\r\n            if (isDynamicArray) {\r\n              const neededBytesForElements = length * itemSize\r\n\r\n              byteLength += neededBytesForElements\r\n              maxByteLength += neededBytesForElements\r\n\r\n              if (buffer.byteLength < maxByteLength) {\r\n                buffer = growBufferFunction(buffer, maxByteLength)\r\n              }\r\n            }\r\n\r\n            // It seems like looping over each element is actually much faster than using TypedArrays bulk copy.\r\n            // TODO: properly benchmark with various array sizes to see if it's actually the case.\r\n            for (const number of data as number[]) {\r\n              writeFunctions[itemType](buffer as any, number, offsetPointer.offset)\r\n              offsetPointer.offset += itemSize\r\n            }\r\n          }\r\n        }\r\n      } else if (typeof def === 'number') {\r\n        // Single primitive (number)\r\n        writeFunctions[def](buffer as any, data as number, offsetPointer.offset)\r\n        offsetPointer.offset += BYTE_SIZE[def]\r\n      } else if ('flags' in def) {\r\n        // BitFlags\r\n        let flags = 0\r\n\r\n        for (let bit = 0; bit < def.flags.length; ++bit) {\r\n          if ((data as Record<string, boolean>)[def.flags[bit]]) {\r\n            flags |= 1 << bit\r\n          }\r\n        }\r\n\r\n        writeFunctions[Field.UNSIGNED_INT_8](buffer as any, flags, offsetPointer.offset)\r\n        offsetPointer.offset += 1\r\n      } else {\r\n        // Single \"subpacket\"\r\n        writeFunctions[Field.UNSIGNED_INT_8](buffer as any, def.packetId, offsetPointer.offset)\r\n        offsetPointer.offset += 1\r\n\r\n        buffer = def.slowWrite(\r\n          buffer,\r\n          data as ToJson<Definition>,\r\n          offsetPointer,\r\n          byteLength,\r\n          maxByteLength,\r\n          writeFunctions,\r\n          growBufferFunction\r\n        )\r\n\r\n        byteLength = offsetPointer.offset\r\n        maxByteLength = buffer.byteLength\r\n      }\r\n    }\r\n\r\n    return buffer\r\n  }\r\n}\r\n\r\n/**\r\n * BinaryPacket definition: \\\r\n * Any packet can be defined through a \"schema\" object explaining its fields names and types.\r\n *\r\n * @example\r\n * // Imagine we have a game board where each cell is a square and is one unit big.\r\n * // A cell can be then defined by its X and Y coordinates.\r\n * // For simplicity, let's say there cannot be more than 256 cells, so we can use 8 bits for each coordinate.\r\n * const Cell = {\r\n *  x: Field.UNSIGNED_INT_8,\r\n *  y: Field.UNSIGNED_INT_8\r\n * }\r\n *\r\n * // When done with the cell definition we can create its BinaryPacket writer/reader.\r\n * // NOTE: each BinaryPacket needs an unique ID, for identification purposes and error checking.\r\n * const CellPacket = BinaryPacket.define(0, Cell)\r\n *\r\n * // Let's now make the definition of the whole game board.\r\n * // You can also specify arrays of both \"primitive\" fields and other BinaryPackets.\r\n * const Board = {\r\n *  numPlayers: Field.UNSIGNED_INT_8,\r\n *  cells: FieldArray(CellPacket)\r\n * }\r\n *\r\n * // When done with the board definition we can create its BinaryPacket writer/reader.\r\n * // NOTE: each BinaryPacket needs an unique ID, for identification purposes and error checking.\r\n * const BoardPacket = BinaryPacket.define(1, Board)\r\n *\r\n * // And use it.\r\n * const buffer = BoardPacket.writeNodeBuffer({\r\n *  numPlayers: 1,\r\n *  cells: [\r\n *    { x: 0, y: 0 },\r\n *    { x: 1, y: 1 }\r\n *  ]\r\n * })\r\n *\r\n * // sendTheBufferOver(buffer)\r\n * // ...\r\n * // const buffer = receiveTheBuffer()\r\n * const board = BoardPacket.readNodeBuffer(buffer)\r\n * // ...\r\n */\r\nexport type Definition = {\r\n  [fieldName: string]:\r\n    | MaybeArray<Field>\r\n    | MaybeArray<BinaryPacket<Definition>>\r\n    | { flags: BitFlags }\r\n}\r\n\r\ntype MaybeArray<T> = T | [itemType: T] | [itemType: T, length: number]\r\n\r\ntype BitFlagsToJson<FlagsArray extends BitFlags> = {\r\n  [key in FlagsArray[number]]: boolean\r\n}\r\n\r\n/**\r\n * Meta-type that converts a `Definition` schema to the type of the actual JavaScript object that will be written into a packet or read from. \\\r\n */\r\nexport type ToJson<T extends Definition> = {\r\n  [K in keyof T]: T[K] extends [infer Item]\r\n    ? Item extends BinaryPacket<infer BPDef>\r\n      ? ToJson<BPDef>[]\r\n      : number[]\r\n    : T[K] extends [infer Item, infer Length]\r\n      ? Item extends BinaryPacket<infer BPDef>\r\n        ? ToJson<BPDef>[] & { length: Length }\r\n        : number[] & { length: Length }\r\n      : T[K] extends BinaryPacket<infer BPDef>\r\n        ? ToJson<BPDef>\r\n        : T[K] extends { flags: infer FlagsArray extends BitFlags }\r\n          ? BitFlagsToJson<FlagsArray>\r\n          : number\r\n}\r\n\r\n/**\r\n * In a JavaScript object, the order of its keys is not strictly defined: sort them by field name. \\\r\n * Thus, we cannot trust iterating over an object keys: we MUST iterate over its entries array. \\\r\n * This is important to make sure that whoever shares BinaryPacket definitions can correctly write/read packets independently of their JS engines.\r\n */\r\nfunction sortEntries(definition: Definition) {\r\n  return Object.entries(definition).sort(([fieldName1], [fieldName2]) =>\r\n    fieldName1.localeCompare(fieldName2)\r\n  )\r\n}\r\n\r\ntype Entries = ReturnType<typeof sortEntries>\r\n\r\n/**\r\n * Helper function that \"inspects\" the entries of a BinaryPacket definition\r\n * and returns useful \"stats\" needed for writing and reading buffers.\r\n *\r\n * This function is ever called only once per BinaryPacket definition.\r\n */\r\nfunction inspectEntries(entries: Entries) {\r\n  // The PacketID is already 1 byte, that's why we aren't starting from 0.\r\n  let minimumByteLength = 1\r\n  let canFastWrite = true\r\n\r\n  for (const [, type] of entries) {\r\n    if (Array.isArray(type)) {\r\n      if (type.length === 2) {\r\n        // Statically-sized array\r\n        const itemSize =\r\n          typeof type[0] === 'object' ? type[0].minimumByteLength : BYTE_SIZE[type[0]]\r\n\r\n        minimumByteLength += type[1] * itemSize\r\n      } else {\r\n        // Dynamically-sized array\r\n        // Adding 1 byte to serialize the array length\r\n        minimumByteLength += 1\r\n        canFastWrite = false\r\n      }\r\n    } else if (type instanceof BinaryPacket) {\r\n      minimumByteLength += type.minimumByteLength\r\n      canFastWrite &&= type.canFastWrite\r\n    } else if (typeof type === 'object') {\r\n      // BitFlags\r\n      // BitFlags are always 1 byte long, because they can hold up to 8 booleans\r\n      minimumByteLength += 1\r\n    } else {\r\n      minimumByteLength += BYTE_SIZE[type]\r\n    }\r\n  }\r\n\r\n  return { minimumByteLength, canFastWrite }\r\n}\r\n\r\n//////////////////////////////////////////////\r\n// The logic here is practically over       //\r\n// Here below there are needed constants    //\r\n// that map a field-type to a functionality //\r\n//////////////////////////////////////////////\r\n\r\nconst BYTE_SIZE = Array(8) as number[]\r\n\r\nBYTE_SIZE[Field.UNSIGNED_INT_8] = 1\r\nBYTE_SIZE[Field.INT_8] = 1\r\n\r\nBYTE_SIZE[Field.UNSIGNED_INT_16] = 2\r\nBYTE_SIZE[Field.INT_16] = 2\r\n\r\nBYTE_SIZE[Field.UNSIGNED_INT_32] = 4\r\nBYTE_SIZE[Field.INT_32] = 4\r\nBYTE_SIZE[Field.FLOAT_32] = 4\r\n\r\nBYTE_SIZE[Field.FLOAT_64] = 8\r\n\r\nconst GET_FUNCTION = Array(8) as ((view: DataView, offset: number) => number)[]\r\n\r\nGET_FUNCTION[Field.UNSIGNED_INT_8] = (view, offset) => view.getUint8(offset)\r\nGET_FUNCTION[Field.INT_8] = (view, offset) => view.getInt8(offset)\r\n\r\nGET_FUNCTION[Field.UNSIGNED_INT_16] = (view, offset) => view.getUint16(offset)\r\nGET_FUNCTION[Field.INT_16] = (view, offset) => view.getInt16(offset)\r\n\r\nGET_FUNCTION[Field.UNSIGNED_INT_32] = (view, offset) => view.getUint32(offset)\r\nGET_FUNCTION[Field.INT_32] = (view, offset) => view.getInt32(offset)\r\nGET_FUNCTION[Field.FLOAT_32] = (view, offset) => view.getFloat32(offset)\r\n\r\nGET_FUNCTION[Field.FLOAT_64] = (view, offset) => view.getFloat64(offset)\r\n\r\nconst SET_FUNCTION = Array(8) as ((view: DataView, value: number, offset: number) => void)[]\r\n\r\nSET_FUNCTION[Field.UNSIGNED_INT_8] = (view, value, offset) => view.setUint8(offset, value)\r\nSET_FUNCTION[Field.INT_8] = (view, value, offset) => view.setInt8(offset, value)\r\n\r\nSET_FUNCTION[Field.UNSIGNED_INT_16] = (view, value, offset) => view.setUint16(offset, value)\r\nSET_FUNCTION[Field.INT_16] = (view, value, offset) => view.setInt16(offset, value)\r\n\r\nSET_FUNCTION[Field.UNSIGNED_INT_32] = (view, value, offset) => view.setUint32(offset, value)\r\nSET_FUNCTION[Field.INT_32] = (view, value, offset) => view.setInt32(offset, value)\r\nSET_FUNCTION[Field.FLOAT_32] = (view, value, offset) => view.setFloat32(offset, value)\r\n\r\nSET_FUNCTION[Field.FLOAT_64] = (view, value, offset) => view.setFloat64(offset, value)\r\n\r\nconst SET_FUNCTION_BUF = Array(8) as ((nodeBuffer: Buffer, value: number, offset: number) => void)[]\r\n\r\nif (hasNodeBuffers) {\r\n  SET_FUNCTION_BUF[Field.UNSIGNED_INT_8] = (view, value, offset) => view.writeUint8(value, offset)\r\n  SET_FUNCTION_BUF[Field.INT_8] = (view, value, offset) => view.writeInt8(value, offset)\r\n\r\n  SET_FUNCTION_BUF[Field.UNSIGNED_INT_16] = (view, value, offset) =>\r\n    view.writeUint16LE(value, offset)\r\n  SET_FUNCTION_BUF[Field.INT_16] = (view, value, offset) => view.writeInt16LE(value, offset)\r\n\r\n  SET_FUNCTION_BUF[Field.UNSIGNED_INT_32] = (view, value, offset) =>\r\n    view.writeUint32LE(value, offset)\r\n  SET_FUNCTION_BUF[Field.INT_32] = (view, value, offset) => view.writeInt32LE(value, offset)\r\n  SET_FUNCTION_BUF[Field.FLOAT_32] = (view, value, offset) => view.writeFloatLE(value, offset)\r\n\r\n  SET_FUNCTION_BUF[Field.FLOAT_64] = (view, value, offset) => view.writeDoubleLE(value, offset)\r\n}\r\n\r\nconst GET_FUNCTION_BUF = Array(8) as ((nodeBuffer: Buffer, offset: number) => number)[]\r\n\r\nif (hasNodeBuffers) {\r\n  GET_FUNCTION_BUF[Field.UNSIGNED_INT_8] = (view, offset) => view.readUint8(offset)\r\n  GET_FUNCTION_BUF[Field.INT_8] = (view, offset) => view.readInt8(offset)\r\n\r\n  GET_FUNCTION_BUF[Field.UNSIGNED_INT_16] = (view, offset) => view.readUint16LE(offset)\r\n  GET_FUNCTION_BUF[Field.INT_16] = (view, offset) => view.readInt16LE(offset)\r\n\r\n  GET_FUNCTION_BUF[Field.UNSIGNED_INT_32] = (view, offset) => view.readUint32LE(offset)\r\n  GET_FUNCTION_BUF[Field.INT_32] = (view, offset) => view.readInt32LE(offset)\r\n  GET_FUNCTION_BUF[Field.FLOAT_32] = (view, offset) => view.readFloatLE(offset)\r\n\r\n  GET_FUNCTION_BUF[Field.FLOAT_64] = (view, offset) => view.readDoubleLE(offset)\r\n}\r\n","/**\r\n * Exclusively matches objects of type `ArrayBuffer` and no other types that inherit from it. \\\r\n * This is needed because the `DataView` constructor explicitly requires a \"true\" ArrayBuffer, or else it throws.\r\n */\r\nexport type TrueArrayBuffer = ArrayBuffer & { buffer?: undefined }\r\n\r\nexport const hasNodeBuffers = typeof Buffer === 'function'\r\n\r\nexport function growDataView(dataview: DataView, newByteLength: number) {\r\n  const resizedBuffer = new ArrayBuffer(newByteLength)\r\n  const amountToCopy = Math.min(dataview.byteLength, resizedBuffer.byteLength)\r\n\r\n  // Treat the buffer as if it was a Float64Array so we can copy 8 bytes at a time, to finish faster\r\n  let length = Math.trunc(amountToCopy / 8)\r\n  new Float64Array(resizedBuffer, 0, length).set(new Float64Array(dataview.buffer, 0, length))\r\n\r\n  // Copy the remaining up to 7 bytes\r\n  const offset = length * 8\r\n  length = amountToCopy - offset\r\n  new Uint8Array(resizedBuffer, offset, length).set(new Uint8Array(dataview.buffer, offset, length))\r\n\r\n  return new DataView(resizedBuffer)\r\n}\r\n\r\nexport function growNodeBuffer(buffer: Buffer, newByteLength: number) {\r\n  const newBuffer = Buffer.allocUnsafe(newByteLength)\r\n  buffer.copy(newBuffer)\r\n  return newBuffer\r\n}\r\n"],"mappings":"yaAAA,IAAAA,EAAA,GAAAC,EAAAD,EAAA,kBAAAE,EAAA,UAAAC,EAAA,eAAAC,EAAA,kBAAAC,EAAA,oBAAAC,IAAA,eAAAC,EAAAP,GCMO,IAAMQ,EAAiB,OAAO,QAAW,WAEzC,SAASC,EAAaC,EAAoBC,EAAuB,CACtE,IAAMC,EAAgB,IAAI,YAAYD,CAAa,EAC7CE,EAAe,KAAK,IAAIH,EAAS,WAAYE,EAAc,UAAU,EAGvEE,EAAS,KAAK,MAAMD,EAAe,CAAC,EACxC,IAAI,aAAaD,EAAe,EAAGE,CAAM,EAAE,IAAI,IAAI,aAAaJ,EAAS,OAAQ,EAAGI,CAAM,CAAC,EAG3F,IAAMC,EAASD,EAAS,EACxB,OAAAA,EAASD,EAAeE,EACxB,IAAI,WAAWH,EAAeG,EAAQD,CAAM,EAAE,IAAI,IAAI,WAAWJ,EAAS,OAAQK,EAAQD,CAAM,CAAC,EAE1F,IAAI,SAASF,CAAa,CACnC,CAEO,SAASI,EAAeC,EAAgBN,EAAuB,CACpE,IAAMO,EAAY,OAAO,YAAYP,CAAa,EAClD,OAAAM,EAAO,KAAKC,CAAS,EACdA,CACT,CD1BO,IAAWC,OAKhBA,IAAA,eAAiB,GAAjB,iBAMAA,IAAA,qCAMAA,IAAA,qCAMAA,IAAA,iBAMAA,IAAA,mBAMAA,IAAA,mBAKAA,IAAA,uBAKAA,IAAA,uBA7CgBA,OAAA,IAwDX,SAASC,EAAuDC,EAAwB,CAC7F,MAAO,CAACA,CAAI,CACd,CASO,SAASC,EACdD,EACAE,EAC+B,CAC/B,GAAIA,EAAS,GAAK,CAAC,OAAO,SAASA,CAAM,EACvC,MAAM,IAAI,WAAW,oDAAoD,EAG3E,MAAO,CAACF,EAAME,CAAM,CACtB,CAaO,SAASC,EAAiDC,EAAmB,CAClF,GAAIA,EAAM,OAAS,EACjB,MAAM,IAAI,MACR,yFAAyFA,EAAM,KAAK,IAAI,CAAC,EAC3G,EAGF,MAAO,CAAE,MAAAA,CAAM,CACjB,CAQO,IAAMC,EAAN,MAAMC,CAAmC,CAmMtC,YACWC,EACjBC,EACA,CAFiB,cAAAD,EAGjB,KAAK,QAAUC,EAAaC,EAAYD,CAAU,EAAI,CAAC,EACvD,IAAME,EAAaC,EAAe,KAAK,OAAO,EAE9C,KAAK,kBAAoBD,EAAW,kBACpC,KAAK,aAAeA,EAAW,YACjC,CAtMA,OAAO,OAA6BH,EAAkBC,EAAgB,CACpE,GAAID,EAAW,GAAK,CAAC,OAAO,SAASA,CAAQ,EAC3C,MAAM,IAAI,WAAW,uCAAuC,EAG9D,GAAIA,EAAW,IACb,MAAM,IAAI,WACR,6GACF,EAGF,OAAO,IAAID,EAAaC,EAAUC,CAAU,CAC9C,CAOA,OAAO,uBAAuBI,EAAgBC,EAAa,EAAG,CAC5D,OAAOD,EAAO,UAAUC,CAAU,CACpC,CAOA,OAAO,qBAAqBC,EAAoBD,EAAa,EAAG,CAC9D,OAAOC,EAAS,SAASD,CAAU,CACrC,CAUA,OAAO,wBAAwBE,EAA8BF,EAAoB,CAC/E,OAAO,IAAI,WAAWE,EAAaF,EAAY,CAAC,EAAE,CAAC,CACrD,CAQA,OAAO,gBAAgBD,KAAmBI,EAAqB,CAC7D,OAAOV,EAAa,MAAMM,EAAQK,EAAkBD,CAAQ,CAC9D,CAQA,OAAO,cAAcF,KAAuBE,EAAqB,CAC/D,OAAOV,EAAa,MAAMQ,EAAUI,EAAcF,CAAQ,CAC5D,CAUA,OAAO,iBACLD,EACAF,EACAM,KACGH,EACH,CACA,OAAOV,EAAa,MAClB,IAAI,SAASS,EAAaF,EAAYM,CAAU,EAChDD,EACAF,CACF,CACF,CAWA,eACEI,EACAC,EAAgB,CAAE,OAAQ,CAAE,EAC5BF,EAAaC,EAAO,WACT,CACX,OAAO,KAAK,KAAKA,EAAQC,EAAeF,EAAYF,CAAgB,CACtE,CAQA,aACEG,EACAC,EAAgB,CAAE,OAAQ,CAAE,EAC5BF,EAAaC,EAAO,WACT,CACX,OAAO,KAAK,KAAKA,EAAQC,EAAeF,EAAYD,CAAY,CAClE,CAaA,gBAAgBE,EAAyBP,EAAoBM,EAAoB,CAC/E,OAAO,KAAK,KACVG,EACI,OAAO,KAAKF,EAAQP,EAAYM,CAAU,EAC1C,IAAI,SAASC,EAAQP,EAAYM,CAAU,EAC/C,CAAE,OAAQ,CAAE,EACZA,EACAG,EAAiBL,EAAmBC,CACtC,CACF,CAQA,gBAAgBK,EAAoB,CAClC,IAAMX,EAAS,OAAO,YAAY,KAAK,iBAAiB,EACxD,OAAO,KAAK,MAAMA,EAAQW,EAAS,CAAE,OAAQ,CAAE,EAAGC,EAAkBC,CAAc,CACpF,CAKA,cAAcF,EAAoB,CAChC,IAAMT,EAAW,IAAI,SAAS,IAAI,YAAY,KAAK,iBAAiB,CAAC,EACrE,OAAO,KAAK,MAAMA,EAAUS,EAAS,CAAE,OAAQ,CAAE,EAAGG,EAAcC,CAAY,CAChF,CAYA,iBAAiBJ,EAAoB,CACnC,IAAMK,EAAMN,EAAiB,KAAK,gBAAgBC,CAAO,EAAI,KAAK,cAAcA,CAAO,EACvF,MAAO,CAAE,OAAQK,EAAI,OAAQ,WAAYA,EAAI,WAAY,WAAYA,EAAI,UAAW,CACtF,CASA,QAAQC,EAA+C,CACrD,MAAO,CAAC,KAAMA,CAAO,CACvB,CAIiB,QACR,aACA,kBAaT,OAAe,MACbT,EACAU,EACAd,EACA,CACA,OAAW,CAACe,EAAQF,CAAO,IAAKb,EAC9B,GAAIe,EAAO,WAAaD,EAAc,CAAoB,EAAEV,EAAe,CAAC,EAC1E,OAAOS,EAAQE,EAAO,KAAKX,EAAQ,CAAE,OAAQ,CAAE,EAAGA,EAAO,WAAYU,CAAa,CAAC,CAGzF,CAEQ,KACNV,EACAC,EACAF,EACAW,EACW,CACX,GAAIX,EAAaE,EAAc,OAAS,KAAK,kBAC3C,MAAM,IAAI,MACR,uDAAuD,KAAK,QAAQ,cAAcA,EAAc,MAAM,EACxG,EAGF,GACES,EAAc,CAAoB,EAAEV,EAAeC,EAAc,MAAM,IAAM,KAAK,SAElF,MAAM,IAAI,MACR,kBAAkBA,EAAc,MAAM,4BAA4B,KAAK,QAAQ,EACjF,EAGFA,EAAc,QAAU,EACxB,IAAMW,EAAc,CAAC,EAErB,OAAW,CAACC,EAAMC,CAAG,IAAK,KAAK,QAC7B,GAAI,MAAM,QAAQA,CAAG,EAAG,CACtB,IAAMhC,EAEJgC,EAAI,CAAC,GAAKJ,EAAc,CAAoB,EAAEV,EAAeC,EAAc,QAAQ,EAE/Ec,EAAQ,MAAMjC,CAAM,EAEpBkC,EAAWF,EAAI,CAAC,EAEtB,GAAI,OAAOE,GAAa,SAEtB,QAASC,EAAI,EAAGA,EAAInC,EAAQ,EAAEmC,EAC5BF,EAAME,CAAC,EAAID,EAAS,KAAKhB,EAAQC,EAAeF,EAAYW,CAAa,MAEtE,CAEL,IAAMQ,EAAWC,EAAUH,CAAQ,EAInC,QAASC,EAAI,EAAGA,EAAInC,EAAQ,EAAEmC,EAC5BF,EAAME,CAAC,EAAIP,EAAcM,CAAQ,EAAEhB,EAAeC,EAAc,MAAM,EACtEA,EAAc,QAAUiB,CAE5B,CAGAN,EAAOC,CAAI,EAAIE,CACjB,SAAW,OAAOD,GAAQ,SAGxBF,EAAOC,CAAI,EAAIH,EAAcI,CAAG,EAAEd,EAAeC,EAAc,MAAM,EACrEA,EAAc,QAAUkB,EAAUL,CAAG,UAC5B,UAAWA,EAAK,CAEzB,IAAM9B,EAAQ0B,EAAc,CAAoB,EAAEV,EAAeC,EAAc,MAAM,EACrFA,EAAc,QAAU,EAGxBW,EAAOC,CAAI,EAAI,CAAC,EAEhB,QAASO,EAAM,EAAGA,EAAMN,EAAI,MAAM,OAAQ,EAAEM,EAE1CR,EAAOC,CAAI,EAAEC,EAAI,MAAMM,CAAG,CAAC,EAAI,CAAC,EAAEpC,EAAS,GAAKoC,EAEpD,MAGER,EAAOC,CAAI,EAAIC,EAAI,KAAKd,EAAQC,EAAeF,EAAYW,CAAa,EAI5E,OAAOE,CACT,CAEQ,MACNpB,EACAW,EACAF,EACAoB,EACAC,EACK,CAIL,OAHAD,EAAe,CAAoB,EAAE7B,EAAe,KAAK,SAAUS,EAAc,MAAM,EACvFA,EAAc,QAAU,EAEpB,KAAK,cAGP,KAAK,UAAUT,EAAQW,EAASF,EAAeoB,CAAc,EACtD7B,GAIA,KAAK,UACVA,EACAW,EACAF,EACA,KAAK,kBACL,KAAK,kBACLoB,EACAC,CACF,CAEJ,CAKQ,UACN9B,EACAW,EACAF,EACAoB,EACA,CACA,OAAW,CAACR,EAAMC,CAAG,IAAK,KAAK,QAAS,CACtC,IAAMS,EAAOpB,EAAQU,CAAI,EAEzB,GAAI,MAAM,QAAQC,CAAG,EAAG,CAEtB,IAAME,EAAWF,EAAI,CAAC,EAChBhC,EAASgC,EAAI,CAAC,EAEpB,GAAI,OAAOE,GAAa,SACtB,QAASC,EAAI,EAAGA,EAAInC,EAAQ,EAAEmC,EAC5BD,EAAS,UACPxB,EACC+B,EAAeN,CAAC,EACjBhB,EACAoB,CACF,MAEG,CACL,IAAMH,EAAWC,EAAUH,CAAQ,EAEnC,QAASC,EAAI,EAAGA,EAAInC,EAAQ,EAAEmC,EAC5BI,EAAeL,CAAQ,EAAExB,EAAgB+B,EAAkBN,CAAC,EAAGhB,EAAc,MAAM,EACnFA,EAAc,QAAUiB,CAE5B,CACF,SAAW,OAAOJ,GAAQ,SAExBO,EAAeP,CAAG,EAAEtB,EAAe+B,EAAgBtB,EAAc,MAAM,EACvEA,EAAc,QAAUkB,EAAUL,CAAG,UAC5B,UAAWA,EAAK,CAEzB,IAAI9B,EAAQ,EAEZ,QAASoC,EAAM,EAAGA,EAAMN,EAAI,MAAM,OAAQ,EAAEM,EACrCG,EAAiCT,EAAI,MAAMM,CAAG,CAAC,IAClDpC,GAAS,GAAKoC,GAIlBC,EAAe,CAAoB,EAAE7B,EAAeR,EAAOiB,EAAc,MAAM,EAC/EA,EAAc,QAAU,CAC1B,MAGEa,EAAI,UAAUtB,EAAQ+B,EAA4BtB,EAAeoB,CAAc,CAEnF,CACF,CAMQ,UACN7B,EACAW,EACAF,EACAF,EACAyB,EACAH,EACAC,EACK,CACL,OAAW,CAACT,EAAMC,CAAG,IAAK,KAAK,QAAS,CACtC,IAAMS,EAAOpB,EAAQU,CAAI,EAEzB,GAAI,MAAM,QAAQC,CAAG,EAAG,CAGtB,IAAMhC,EAAUyC,EAAe,OACzBE,EAAiBX,EAAI,CAAC,IAAM,OASlC,GALIW,IACFJ,EAAe,CAAoB,EAAE7B,EAAeV,EAAQmB,EAAc,MAAM,EAChFA,EAAc,QAAU,GAGtBnB,EAAS,EAAG,CACd,IAAMkC,EAAWF,EAAI,CAAC,EAEtB,GAAI,OAAOE,GAAa,SAAU,CAGhC,GAAIS,EAAgB,CAClB,IAAMC,EAAyB5C,EAASkC,EAAS,kBAEjDjB,GAAc2B,EACdF,GAAiBE,EAEblC,EAAO,WAAagC,IACtBhC,EAAS8B,EAAmB9B,EAAQgC,CAAa,EAErD,CAEA,QAAWG,KAAUJ,EACnBF,EAAe,CAAoB,EACjC7B,EACAwB,EAAS,SACTf,EAAc,MAChB,EAEAA,EAAc,QAAU,EAExBT,EAASwB,EAAS,UAChBxB,EACAmC,EACA1B,EACAF,EACAyB,EACAH,EACAC,CACF,EAEAvB,EAAaE,EAAc,OAC3BuB,EAAgBhC,EAAO,UAE3B,KAAO,CAEL,IAAM0B,EAAWC,EAAUH,CAAQ,EAEnC,GAAIS,EAAgB,CAClB,IAAMC,EAAyB5C,EAASoC,EAExCnB,GAAc2B,EACdF,GAAiBE,EAEblC,EAAO,WAAagC,IACtBhC,EAAS8B,EAAmB9B,EAAQgC,CAAa,EAErD,CAIA,QAAWI,KAAUL,EACnBF,EAAeL,CAAQ,EAAExB,EAAeoC,EAAQ3B,EAAc,MAAM,EACpEA,EAAc,QAAUiB,CAE5B,CACF,CACF,SAAW,OAAOJ,GAAQ,SAExBO,EAAeP,CAAG,EAAEtB,EAAe+B,EAAgBtB,EAAc,MAAM,EACvEA,EAAc,QAAUkB,EAAUL,CAAG,UAC5B,UAAWA,EAAK,CAEzB,IAAI9B,EAAQ,EAEZ,QAASoC,EAAM,EAAGA,EAAMN,EAAI,MAAM,OAAQ,EAAEM,EACrCG,EAAiCT,EAAI,MAAMM,CAAG,CAAC,IAClDpC,GAAS,GAAKoC,GAIlBC,EAAe,CAAoB,EAAE7B,EAAeR,EAAOiB,EAAc,MAAM,EAC/EA,EAAc,QAAU,CAC1B,MAEEoB,EAAe,CAAoB,EAAE7B,EAAesB,EAAI,SAAUb,EAAc,MAAM,EACtFA,EAAc,QAAU,EAExBT,EAASsB,EAAI,UACXtB,EACA+B,EACAtB,EACAF,EACAyB,EACAH,EACAC,CACF,EAEAvB,EAAaE,EAAc,OAC3BuB,EAAgBhC,EAAO,UAE3B,CAEA,OAAOA,CACT,CACF,EAkFA,SAASH,EAAYD,EAAwB,CAC3C,OAAO,OAAO,QAAQA,CAAU,EAAE,KAAK,CAAC,CAACyC,CAAU,EAAG,CAACC,CAAU,IAC/DD,EAAW,cAAcC,CAAU,CACrC,CACF,CAUA,SAASvC,EAAewC,EAAkB,CAExC,IAAIC,EAAoB,EACpBC,EAAe,GAEnB,OAAW,CAAC,CAAEC,CAAI,IAAKH,EACrB,GAAI,MAAM,QAAQG,CAAI,EACpB,GAAIA,EAAK,SAAW,EAAG,CAErB,IAAMhB,EACJ,OAAOgB,EAAK,CAAC,GAAM,SAAWA,EAAK,CAAC,EAAE,kBAAoBf,EAAUe,EAAK,CAAC,CAAC,EAE7EF,GAAqBE,EAAK,CAAC,EAAIhB,CACjC,MAGEc,GAAqB,EACrBC,EAAe,QAERC,aAAgBjD,GACzB+C,GAAqBE,EAAK,kBAC1BD,IAAiBC,EAAK,cACb,OAAOA,GAAS,SAGzBF,GAAqB,EAErBA,GAAqBb,EAAUe,CAAI,EAIvC,MAAO,CAAE,kBAAAF,EAAmB,aAAAC,CAAa,CAC3C,CAQA,IAAMd,EAAY,MAAM,CAAC,EAEzBA,EAAU,CAAoB,EAAI,EAClCA,EAAU,CAAW,EAAI,EAEzBA,EAAU,CAAqB,EAAI,EACnCA,EAAU,CAAY,EAAI,EAE1BA,EAAU,CAAqB,EAAI,EACnCA,EAAU,CAAY,EAAI,EAC1BA,EAAU,CAAc,EAAI,EAE5BA,EAAU,CAAc,EAAI,EAE5B,IAAMrB,EAAe,MAAM,CAAC,EAE5BA,EAAa,CAAoB,EAAI,CAACqC,EAAMC,IAAWD,EAAK,SAASC,CAAM,EAC3EtC,EAAa,CAAW,EAAI,CAACqC,EAAMC,IAAWD,EAAK,QAAQC,CAAM,EAEjEtC,EAAa,CAAqB,EAAI,CAACqC,EAAMC,IAAWD,EAAK,UAAUC,CAAM,EAC7EtC,EAAa,CAAY,EAAI,CAACqC,EAAMC,IAAWD,EAAK,SAASC,CAAM,EAEnEtC,EAAa,CAAqB,EAAI,CAACqC,EAAMC,IAAWD,EAAK,UAAUC,CAAM,EAC7EtC,EAAa,CAAY,EAAI,CAACqC,EAAMC,IAAWD,EAAK,SAASC,CAAM,EACnEtC,EAAa,CAAc,EAAI,CAACqC,EAAMC,IAAWD,EAAK,WAAWC,CAAM,EAEvEtC,EAAa,CAAc,EAAI,CAACqC,EAAMC,IAAWD,EAAK,WAAWC,CAAM,EAEvE,IAAM9B,EAAe,MAAM,CAAC,EAE5BA,EAAa,CAAoB,EAAI,CAAC6B,EAAME,EAAOD,IAAWD,EAAK,SAASC,EAAQC,CAAK,EACzF/B,EAAa,CAAW,EAAI,CAAC6B,EAAME,EAAOD,IAAWD,EAAK,QAAQC,EAAQC,CAAK,EAE/E/B,EAAa,CAAqB,EAAI,CAAC6B,EAAME,EAAOD,IAAWD,EAAK,UAAUC,EAAQC,CAAK,EAC3F/B,EAAa,CAAY,EAAI,CAAC6B,EAAME,EAAOD,IAAWD,EAAK,SAASC,EAAQC,CAAK,EAEjF/B,EAAa,CAAqB,EAAI,CAAC6B,EAAME,EAAOD,IAAWD,EAAK,UAAUC,EAAQC,CAAK,EAC3F/B,EAAa,CAAY,EAAI,CAAC6B,EAAME,EAAOD,IAAWD,EAAK,SAASC,EAAQC,CAAK,EACjF/B,EAAa,CAAc,EAAI,CAAC6B,EAAME,EAAOD,IAAWD,EAAK,WAAWC,EAAQC,CAAK,EAErF/B,EAAa,CAAc,EAAI,CAAC6B,EAAME,EAAOD,IAAWD,EAAK,WAAWC,EAAQC,CAAK,EAErF,IAAMjC,EAAmB,MAAM,CAAC,EAE5BF,IACFE,EAAiB,CAAoB,EAAI,CAAC+B,EAAME,EAAOD,IAAWD,EAAK,WAAWE,EAAOD,CAAM,EAC/FhC,EAAiB,CAAW,EAAI,CAAC+B,EAAME,EAAOD,IAAWD,EAAK,UAAUE,EAAOD,CAAM,EAErFhC,EAAiB,CAAqB,EAAI,CAAC+B,EAAME,EAAOD,IACtDD,EAAK,cAAcE,EAAOD,CAAM,EAClChC,EAAiB,CAAY,EAAI,CAAC+B,EAAME,EAAOD,IAAWD,EAAK,aAAaE,EAAOD,CAAM,EAEzFhC,EAAiB,CAAqB,EAAI,CAAC+B,EAAME,EAAOD,IACtDD,EAAK,cAAcE,EAAOD,CAAM,EAClChC,EAAiB,CAAY,EAAI,CAAC+B,EAAME,EAAOD,IAAWD,EAAK,aAAaE,EAAOD,CAAM,EACzFhC,EAAiB,CAAc,EAAI,CAAC+B,EAAME,EAAOD,IAAWD,EAAK,aAAaE,EAAOD,CAAM,EAE3FhC,EAAiB,CAAc,EAAI,CAAC+B,EAAME,EAAOD,IAAWD,EAAK,cAAcE,EAAOD,CAAM,GAG9F,IAAMvC,EAAmB,MAAM,CAAC,EAE5BK,IACFL,EAAiB,CAAoB,EAAI,CAACsC,EAAMC,IAAWD,EAAK,UAAUC,CAAM,EAChFvC,EAAiB,CAAW,EAAI,CAACsC,EAAMC,IAAWD,EAAK,SAASC,CAAM,EAEtEvC,EAAiB,CAAqB,EAAI,CAACsC,EAAMC,IAAWD,EAAK,aAAaC,CAAM,EACpFvC,EAAiB,CAAY,EAAI,CAACsC,EAAMC,IAAWD,EAAK,YAAYC,CAAM,EAE1EvC,EAAiB,CAAqB,EAAI,CAACsC,EAAMC,IAAWD,EAAK,aAAaC,CAAM,EACpFvC,EAAiB,CAAY,EAAI,CAACsC,EAAMC,IAAWD,EAAK,YAAYC,CAAM,EAC1EvC,EAAiB,CAAc,EAAI,CAACsC,EAAMC,IAAWD,EAAK,YAAYC,CAAM,EAE5EvC,EAAiB,CAAc,EAAI,CAACsC,EAAMC,IAAWD,EAAK,aAAaC,CAAM","names":["src_exports","__export","BinaryPacket","Field","FieldArray","FieldBitFlags","FieldFixedArray","__toCommonJS","hasNodeBuffers","growDataView","dataview","newByteLength","resizedBuffer","amountToCopy","length","offset","growNodeBuffer","buffer","newBuffer","Field","FieldArray","item","FieldFixedArray","length","FieldBitFlags","flags","BinaryPacket","_BinaryPacket","packetId","definition","sortEntries","inspection","inspectEntries","buffer","byteOffset","dataview","arraybuffer","visitors","GET_FUNCTION_BUF","GET_FUNCTION","byteLength","dataIn","offsetPointer","hasNodeBuffers","dataOut","SET_FUNCTION_BUF","growNodeBuffer","SET_FUNCTION","growDataView","buf","onVisit","readFunctions","Packet","result","name","def","array","itemType","i","itemSize","BYTE_SIZE","bit","writeFunctions","growBufferFunction","data","maxByteLength","isDynamicArray","neededBytesForElements","object","number","fieldName1","fieldName2","entries","minimumByteLength","canFastWrite","type","view","offset","value"]}

package/dist/index.mjs

@@ -1,2 +1,2 @@
-var B=typeof Buffer=="function";function E(n,e){let t=new ArrayBuffer(e),r=Math.min(n.byteLength,t.byteLength),i=Math.trunc(r/8);new Float64Array(t,0,i).set(new Float64Array(n.buffer,0,i));let s=i*8;return i=r-s,new Uint8Array(t,s,i).set(new Uint8Array(n.buffer,s,i)),new DataView(t)}function U(n,e){let t=Buffer.allocUnsafe(e);return n.copy(t),t}var h=(a=>(a[a.UNSIGNED_INT_8=0]="UNSIGNED_INT_8",a[a.UNSIGNED_INT_16=1]="UNSIGNED_INT_16",a[a.UNSIGNED_INT_32=2]="UNSIGNED_INT_32",a[a.INT_8=3]="INT_8",a[a.INT_16=4]="INT_16",a[a.INT_32=5]="INT_32",a[a.FLOAT_32=6]="FLOAT_32",a[a.FLOAT_64=7]="FLOAT_64",a))(h||{});function g(n){return[n]}function S(n,e){if(e<0||!Number.isFinite(e))throw new RangeError("Length of a FixedArray must be a positive integer.");return[n,e]}var p=class n{constructor(e,t){this.packetId=e;this.entries=t?w(t):[];let r=A(this.entries);this.minimumByteLength=r.minimumByteLength,this.canFastWrite=r.canFastWrite}static define(e,t){if(e<0||!Number.isFinite(e))throw new RangeError("Packet IDs must be positive integers.");if(e>255)throw new RangeError("Packet IDs greater than 255 are not supported. Do you REALLY need more than 255 different kinds of packets?");return new n(e,t)}static readPacketIdNodeBuffer(e,t=0){return e.readUint8(t)}static readPacketIdDataView(e,t=0){return e.getUint8(t)}static readPacketIdArrayBuffer(e,t){return new Uint8Array(e,t,1)[0]}readNodeBuffer(e,t={offset:0},r=e.byteLength){return this.read(e,t,r,l)}readDataView(e,t={offset:0},r=e.byteLength){return this.read(e,t,r,m)}readArrayBuffer(e,t,r){return this.read(B?Buffer.from(e,t,r):new DataView(e,t,r),{offset:0},r,B?l:m)}writeNodeBuffer(e){let t=Buffer.allocUnsafe(this.minimumByteLength);return this.write(t,e,{offset:0},d,U)}writeDataView(e){let t=new DataView(new ArrayBuffer(this.minimumByteLength));return this.write(t,e,{offset:0},I,E)}writeArrayBuffer(e){let t=B?this.writeNodeBuffer(e):this.writeDataView(e);return{buffer:t.buffer,byteLength:t.byteLength,byteOffset:t.byteOffset}}entries;canFastWrite;minimumByteLength;read(e,t,r,i){if(r+t.offset<this.minimumByteLength)throw new Error(`There is no space available to fit a packet of type ${this.packetId} at offset ${t.offset}`);if(i[0](e,t.offset)!==this.packetId)throw new Error(`Data at offset ${t.offset} is not a packet of type ${this.packetId}`);t.offset+=1;let s={};for(let[f,o]of this.entries)if(Array.isArray(o)){let a=o[1]??i[0](e,t.offset++),y=Array(a),T=o[0];if(typeof T=="object")for(let u=0;u<a;++u)y[u]=T.read(e,t,r,i);else{let u=N[T];for(let _=0;_<a;++_)y[_]=i[T](e,t.offset),t.offset+=u}s[f]=y}else typeof o=="object"?s[f]=o.read(e,t,r,i):(s[f]=i[o](e,t.offset),t.offset+=N[o]);return s}write(e,t,r,i,s){return i[0](e,this.packetId,r.offset),r.offset+=1,this.canFastWrite?(this.fastWrite(e,t,r,i),e):this.slowWrite(e,t,r,this.minimumByteLength,this.minimumByteLength,i,s)}fastWrite(e,t,r,i){for(let[s,f]of this.entries)if(Array.isArray(f)){let o=f[0],a=f[1],y=t[s];if(typeof o=="object")for(let T=0;T<a;++T)o.fastWrite(e,y[T],r,i);else{let T=N[o];for(let u=0;u<a;++u)i[o](e,y[u],r.offset),r.offset+=T}}else typeof f=="object"?f.fastWrite(e,t[s],r,i):(i[f](e,t[s],r.offset),r.offset+=N[f])}slowWrite(e,t,r,i,s,f,o){for(let[a,y]of this.entries){let T=t[a];if(Array.isArray(y)){let u=T.length,_=y[1]===void 0;if(_&&(f[0](e,u,r.offset),r.offset+=1),u>0){let D=y[0];if(typeof D=="object"){if(_){let c=u*D.minimumByteLength;i+=c,s+=c,e.byteLength<s&&(e=o(e,s))}for(let c of T)f[0](e,D.packetId,r.offset),r.offset+=1,e=D.slowWrite(e,c,r,i,s,f,o),i=r.offset,s=e.byteLength}else{let c=N[D];if(_){let F=u*c;i+=F,s+=F,e.byteLength<s&&(e=o(e,s))}for(let F of T)f[D](e,F,r.offset),r.offset+=c}}}else typeof y=="object"?(f[0](e,y.packetId,r.offset),r.offset+=1,e=y.slowWrite(e,T,r,i,s,f,o),i=r.offset,s=e.byteLength):(f[y](e,T,r.offset),r.offset+=N[y])}return e}};function w(n){return Object.entries(n).sort(([e],[t])=>e.localeCompare(t))}function A(n){let e=1,t=!0;for(let[,r]of n)if(Array.isArray(r))if(r.length===2){let i=typeof r[0]=="object"?r[0].minimumByteLength:N[r[0]];e+=r[1]*i}else e+=1,t=!1;else r instanceof p?(e+=r.minimumByteLength,t&&=r.canFastWrite):e+=N[r];return{minimumByteLength:e,canFastWrite:t}}var N=Array(8);N[0]=1;N[3]=1;N[1]=2;N[4]=2;N[2]=4;N[5]=4;N[6]=4;N[7]=8;var m=Array(8);m[0]=(n,e)=>n.getUint8(e);m[3]=(n,e)=>n.getInt8(e);m[1]=(n,e)=>n.getUint16(e);m[4]=(n,e)=>n.getInt16(e);m[2]=(n,e)=>n.getUint32(e);m[5]=(n,e)=>n.getInt32(e);m[6]=(n,e)=>n.getFloat32(e);m[7]=(n,e)=>n.getFloat64(e);var I=Array(8);I[0]=(n,e,t)=>n.setUint8(t,e);I[3]=(n,e,t)=>n.setInt8(t,e);I[1]=(n,e,t)=>n.setUint16(t,e);I[4]=(n,e,t)=>n.setInt16(t,e);I[2]=(n,e,t)=>n.setUint32(t,e);I[5]=(n,e,t)=>n.setInt32(t,e);I[6]=(n,e,t)=>n.setFloat32(t,e);I[7]=(n,e,t)=>n.setFloat64(t,e);var d=Array(8);B&&(d[0]=(n,e,t)=>n.writeUint8(e,t),d[3]=(n,e,t)=>n.writeInt8(e,t),d[1]=(n,e,t)=>n.writeUint16LE(e,t),d[4]=(n,e,t)=>n.writeInt16LE(e,t),d[2]=(n,e,t)=>n.writeUint32LE(e,t),d[5]=(n,e,t)=>n.writeInt32LE(e,t),d[6]=(n,e,t)=>n.writeFloatLE(e,t),d[7]=(n,e,t)=>n.writeDoubleLE(e,t));var l=Array(8);B&&(l[0]=(n,e)=>n.readUint8(e),l[3]=(n,e)=>n.readInt8(e),l[1]=(n,e)=>n.readUint16LE(e),l[4]=(n,e)=>n.readInt16LE(e),l[2]=(n,e)=>n.readUint32LE(e),l[5]=(n,e)=>n.readInt32LE(e),l[6]=(n,e)=>n.readFloatLE(e),l[7]=(n,e)=>n.readDoubleLE(e));export{p as BinaryPacket,h as Field,g as FieldArray,S as FieldFixedArray};
+var F=typeof Buffer=="function";function D(r,e){let t=new ArrayBuffer(e),i=Math.min(r.byteLength,t.byteLength),n=Math.trunc(i/8);new Float64Array(t,0,n).set(new Float64Array(r.buffer,0,n));let f=n*8;return n=i-f,new Uint8Array(t,f,n).set(new Uint8Array(r.buffer,f,n)),new DataView(t)}function E(r,e){let t=Buffer.allocUnsafe(e);return r.copy(t),t}var h=(s=>(s[s.UNSIGNED_INT_8=0]="UNSIGNED_INT_8",s[s.UNSIGNED_INT_16=1]="UNSIGNED_INT_16",s[s.UNSIGNED_INT_32=2]="UNSIGNED_INT_32",s[s.INT_8=3]="INT_8",s[s.INT_16=4]="INT_16",s[s.INT_32=5]="INT_32",s[s.FLOAT_32=6]="FLOAT_32",s[s.FLOAT_64=7]="FLOAT_64",s))(h||{});function S(r){return[r]}function L(r,e){if(e<0||!Number.isFinite(e))throw new RangeError("Length of a FixedArray must be a positive integer.");return[r,e]}function G(r){if(r.length>8)throw new Error(`Invalid BinaryPacket definition: a BitFlags field can have only up to 8 flags, given: ${r.join(", ")}`);return{flags:r}}var g=class r{constructor(e,t){this.packetId=e;this.entries=t?U(t):[];let i=w(this.entries);this.minimumByteLength=i.minimumByteLength,this.canFastWrite=i.canFastWrite}static define(e,t){if(e<0||!Number.isFinite(e))throw new RangeError("Packet IDs must be positive integers.");if(e>255)throw new RangeError("Packet IDs greater than 255 are not supported. Do you REALLY need more than 255 different kinds of packets?");return new r(e,t)}static readPacketIdNodeBuffer(e,t=0){return e.readUint8(t)}static readPacketIdDataView(e,t=0){return e.getUint8(t)}static readPacketIdArrayBuffer(e,t){return new Uint8Array(e,t,1)[0]}static visitNodeBuffer(e,...t){return r.visit(e,I,t)}static visitDataView(e,...t){return r.visit(e,d,t)}static visitArrayBuffer(e,t,i,...n){return r.visit(new DataView(e,t,i),d,n)}readNodeBuffer(e,t={offset:0},i=e.byteLength){return this.read(e,t,i,I)}readDataView(e,t={offset:0},i=e.byteLength){return this.read(e,t,i,d)}readArrayBuffer(e,t,i){return this.read(F?Buffer.from(e,t,i):new DataView(e,t,i),{offset:0},i,F?I:d)}writeNodeBuffer(e){let t=Buffer.allocUnsafe(this.minimumByteLength);return this.write(t,e,{offset:0},_,E)}writeDataView(e){let t=new DataView(new ArrayBuffer(this.minimumByteLength));return this.write(t,e,{offset:0},m,D)}writeArrayBuffer(e){let t=F?this.writeNodeBuffer(e):this.writeDataView(e);return{buffer:t.buffer,byteLength:t.byteLength,byteOffset:t.byteOffset}}visitor(e){return[this,e]}entries;canFastWrite;minimumByteLength;static visit(e,t,i){for(let[n,f]of i)if(n.packetId===t[0](e,0))return f(n.read(e,{offset:0},e.byteLength,t))}read(e,t,i,n){if(i+t.offset<this.minimumByteLength)throw new Error(`There is no space available to fit a packet of type ${this.packetId} at offset ${t.offset}`);if(n[0](e,t.offset)!==this.packetId)throw new Error(`Data at offset ${t.offset} is not a packet of type ${this.packetId}`);t.offset+=1;let f={};for(let[o,T]of this.entries)if(Array.isArray(T)){let s=T[1]??n[0](e,t.offset++),a=Array(s),l=T[0];if(typeof l=="object")for(let N=0;N<s;++N)a[N]=l.read(e,t,i,n);else{let N=y[l];for(let u=0;u<s;++u)a[u]=n[l](e,t.offset),t.offset+=N}f[o]=a}else if(typeof T=="number")f[o]=n[T](e,t.offset),t.offset+=y[T];else if("flags"in T){let s=n[0](e,t.offset);t.offset+=1,f[o]={};for(let a=0;a<T.flags.length;++a)f[o][T.flags[a]]=!!(s&1<<a)}else f[o]=T.read(e,t,i,n);return f}write(e,t,i,n,f){return n[0](e,this.packetId,i.offset),i.offset+=1,this.canFastWrite?(this.fastWrite(e,t,i,n),e):this.slowWrite(e,t,i,this.minimumByteLength,this.minimumByteLength,n,f)}fastWrite(e,t,i,n){for(let[f,o]of this.entries){let T=t[f];if(Array.isArray(o)){let s=o[0],a=o[1];if(typeof s=="object")for(let l=0;l<a;++l)s.fastWrite(e,T[l],i,n);else{let l=y[s];for(let N=0;N<a;++N)n[s](e,T[N],i.offset),i.offset+=l}}else if(typeof o=="number")n[o](e,T,i.offset),i.offset+=y[o];else if("flags"in o){let s=0;for(let a=0;a<o.flags.length;++a)T[o.flags[a]]&&(s|=1<<a);n[0](e,s,i.offset),i.offset+=1}else o.fastWrite(e,T,i,n)}}slowWrite(e,t,i,n,f,o,T){for(let[s,a]of this.entries){let l=t[s];if(Array.isArray(a)){let N=l.length,u=a[1]===void 0;if(u&&(o[0](e,N,i.offset),i.offset+=1),N>0){let B=a[0];if(typeof B=="object"){if(u){let c=N*B.minimumByteLength;n+=c,f+=c,e.byteLength<f&&(e=T(e,f))}for(let c of l)o[0](e,B.packetId,i.offset),i.offset+=1,e=B.slowWrite(e,c,i,n,f,o,T),n=i.offset,f=e.byteLength}else{let c=y[B];if(u){let p=N*c;n+=p,f+=p,e.byteLength<f&&(e=T(e,f))}for(let p of l)o[B](e,p,i.offset),i.offset+=c}}}else if(typeof a=="number")o[a](e,l,i.offset),i.offset+=y[a];else if("flags"in a){let N=0;for(let u=0;u<a.flags.length;++u)l[a.flags[u]]&&(N|=1<<u);o[0](e,N,i.offset),i.offset+=1}else o[0](e,a.packetId,i.offset),i.offset+=1,e=a.slowWrite(e,l,i,n,f,o,T),n=i.offset,f=e.byteLength}return e}};function U(r){return Object.entries(r).sort(([e],[t])=>e.localeCompare(t))}function w(r){let e=1,t=!0;for(let[,i]of r)if(Array.isArray(i))if(i.length===2){let n=typeof i[0]=="object"?i[0].minimumByteLength:y[i[0]];e+=i[1]*n}else e+=1,t=!1;else i instanceof g?(e+=i.minimumByteLength,t&&=i.canFastWrite):typeof i=="object"?e+=1:e+=y[i];return{minimumByteLength:e,canFastWrite:t}}var y=Array(8);y[0]=1;y[3]=1;y[1]=2;y[4]=2;y[2]=4;y[5]=4;y[6]=4;y[7]=8;var d=Array(8);d[0]=(r,e)=>r.getUint8(e);d[3]=(r,e)=>r.getInt8(e);d[1]=(r,e)=>r.getUint16(e);d[4]=(r,e)=>r.getInt16(e);d[2]=(r,e)=>r.getUint32(e);d[5]=(r,e)=>r.getInt32(e);d[6]=(r,e)=>r.getFloat32(e);d[7]=(r,e)=>r.getFloat64(e);var m=Array(8);m[0]=(r,e,t)=>r.setUint8(t,e);m[3]=(r,e,t)=>r.setInt8(t,e);m[1]=(r,e,t)=>r.setUint16(t,e);m[4]=(r,e,t)=>r.setInt16(t,e);m[2]=(r,e,t)=>r.setUint32(t,e);m[5]=(r,e,t)=>r.setInt32(t,e);m[6]=(r,e,t)=>r.setFloat32(t,e);m[7]=(r,e,t)=>r.setFloat64(t,e);var _=Array(8);F&&(_[0]=(r,e,t)=>r.writeUint8(e,t),_[3]=(r,e,t)=>r.writeInt8(e,t),_[1]=(r,e,t)=>r.writeUint16LE(e,t),_[4]=(r,e,t)=>r.writeInt16LE(e,t),_[2]=(r,e,t)=>r.writeUint32LE(e,t),_[5]=(r,e,t)=>r.writeInt32LE(e,t),_[6]=(r,e,t)=>r.writeFloatLE(e,t),_[7]=(r,e,t)=>r.writeDoubleLE(e,t));var I=Array(8);F&&(I[0]=(r,e)=>r.readUint8(e),I[3]=(r,e)=>r.readInt8(e),I[1]=(r,e)=>r.readUint16LE(e),I[4]=(r,e)=>r.readInt16LE(e),I[2]=(r,e)=>r.readUint32LE(e),I[5]=(r,e)=>r.readInt32LE(e),I[6]=(r,e)=>r.readFloatLE(e),I[7]=(r,e)=>r.readDoubleLE(e));export{g as BinaryPacket,h as Field,S as FieldArray,G as FieldBitFlags,L as FieldFixedArray};
 //# sourceMappingURL=index.mjs.map

package/dist/index.mjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/buffers.ts","../src/index.ts"],"sourcesContent":["export const hasNodeBuffers = typeof Buffer === 'function'\r\n\r\nexport function growDataView(dataview: DataView, newByteLength: number) {\r\n  const resizedBuffer = new ArrayBuffer(newByteLength)\r\n  const amountToCopy = Math.min(dataview.byteLength, resizedBuffer.byteLength)\r\n\r\n  // Treat the buffer as if it was a Float64Array so we can copy 8 bytes at a time, to finish faster\r\n  let length = Math.trunc(amountToCopy / 8)\r\n  new Float64Array(resizedBuffer, 0, length).set(new Float64Array(dataview.buffer, 0, length))\r\n\r\n  // Copy the remaining up to 7 bytes\r\n  const offset = length * 8\r\n  length = amountToCopy - offset\r\n  new Uint8Array(resizedBuffer, offset, length).set(new Uint8Array(dataview.buffer, offset, length))\r\n\r\n  return new DataView(resizedBuffer)\r\n}\r\n\r\nexport function growNodeBuffer(buffer: Buffer, newByteLength: number) {\r\n  const newBuffer = Buffer.allocUnsafe(newByteLength)\r\n  buffer.copy(newBuffer)\r\n  return newBuffer\r\n}\r\n","import { growDataView, growNodeBuffer, hasNodeBuffers } from './buffers'\r\n\r\nexport const enum Field {\r\n  /**\r\n   * Defines a 1 byte (8 bits) unsigned integer field. \\\r\n   * (Range: 0 - 255)\r\n   */\r\n  UNSIGNED_INT_8 = 0,\r\n\r\n  /**\r\n   * Defines a 2 bytes (16 bits) unsigned integer field. \\\r\n   * (Range: 0 - 65535)\r\n   */\r\n  UNSIGNED_INT_16,\r\n\r\n  /**\r\n   * Defines a 4 bytes (32 bits) unsigned integer field. \\\r\n   * (Range: 0 - 4294967295)\r\n   */\r\n  UNSIGNED_INT_32,\r\n\r\n  /**\r\n   * Defines a 1 byte (8 bits) signed integer field. \\\r\n   * (Range: -128 - 127)\r\n   */\r\n  INT_8,\r\n\r\n  /**\r\n   * Defines a 2 bytes (16 bits) signed integer field. \\\r\n   * (Range: -32768 - 32767)\r\n   */\r\n  INT_16,\r\n\r\n  /**\r\n   * Defines a 4 bytes (32 bits) signed integer field. \\\r\n   * (Range: -2147483648 - 2147483647)\r\n   */\r\n  INT_32,\r\n\r\n  /**\r\n   * Defines a 4 bytes (32 bits) floating-point field. \\\r\n   */\r\n  FLOAT_32,\r\n\r\n  /**\r\n   * Defines a 8 bytes (64 bits) floating-point field. \\\r\n   */\r\n  FLOAT_64\r\n}\r\n\r\n/**\r\n * Defines a dynamically-sized array with elements of a certain type. \\\r\n * Dynamically-sized arrays are useful when a packet's field is an array of a non pre-defined length. \\\r\n * Although, this makes dynamically-sized arrays more memory expensive as the internal buffer needs to be grown accordingly.\r\n *\r\n * NOTE: If an array will ALWAYS have the same length, prefer using the `FieldFixedArray` type, for both better performance and memory efficiency. \\\r\n * NOTE: As of now, dynamic arrays can have at most 256 elements.\r\n */\r\nexport function FieldArray<T extends Field | BinaryPacket<Definition>>(item: T): [itemType: T] {\r\n  return [item]\r\n}\r\n\r\n/**\r\n * Defines a statically-sized array with elements of a certain type. \\\r\n * Fixed arrays are useful when a packet's field is an array of a pre-defined length. \\\r\n * Fixed arrays much more memory efficient and performant than non-fixed ones.\r\n *\r\n * NOTE: If an array will not always have the same length, use the `FieldArray` type.\r\n */\r\nexport function FieldFixedArray<T extends Field | BinaryPacket<Definition>, Length extends number>(\r\n  item: T,\r\n  length: Length\r\n): [itemType: T, length: Length] {\r\n  if (length < 0 || !Number.isFinite(length)) {\r\n    throw new RangeError('Length of a FixedArray must be a positive integer.')\r\n  }\r\n\r\n  return [item, length]\r\n}\r\n\r\nexport class BinaryPacket<T extends Definition> {\r\n  /**\r\n   * Defines a new binary packet. \\\r\n   * Make sure that every `packetId` is unique.\r\n   * @throws RangeError If packetId is negative, floating-point, or greater than 255.\r\n   */\r\n  static define<T extends Definition>(packetId: number, definition?: T) {\r\n    if (packetId < 0 || !Number.isFinite(packetId)) {\r\n      throw new RangeError('Packet IDs must be positive integers.')\r\n    }\r\n\r\n    if (packetId > 255) {\r\n      throw new RangeError(\r\n        'Packet IDs greater than 255 are not supported. Do you REALLY need more than 255 different kinds of packets?'\r\n      )\r\n    }\r\n\r\n    return new BinaryPacket(packetId, definition)\r\n  }\r\n\r\n  /**\r\n   * Reads just the packetId from the given Buffer. \\\r\n   * This method practically just reads the uint8 at offset `byteOffset` (default: 0). \\\r\n   * Useful if the receiving side receives multiple types of packets.\r\n   */\r\n  static readPacketIdNodeBuffer(buffer: Buffer, byteOffset = 0) {\r\n    return buffer.readUint8(byteOffset)\r\n  }\r\n\r\n  /**\r\n   * Reads just the packetId from the given DataView. \\\r\n   * This method practically just reads the uint8 at offset `byteOffset` (default: 0). \\\r\n   * Useful if the receiving side receives multiple types of packets.\r\n   */\r\n  static readPacketIdDataView(dataview: DataView, byteOffset = 0) {\r\n    return dataview.getUint8(byteOffset)\r\n  }\r\n\r\n  /**\r\n   * Reads just the packetId from the given ArrayBuffer. \\\r\n   * This method practically just reads the uint8 at offset `byteOffset`. \\\r\n   * Useful if the receiving side receives multiple types of packets.\r\n   *\r\n   * NOTE: Due to security issues, the `byteOffset` argument cannot be defaulted and must be provided by the user. \\\r\n   * NOTE: For more information read the `readArrayBuffer` method documentation.\r\n   */\r\n  static readPacketIdArrayBuffer(arraybuffer: ArrayBuffer, byteOffset: number) {\r\n    return new Uint8Array(arraybuffer, byteOffset, 1)[0]\r\n  }\r\n\r\n  /**\r\n   * Reads/deserializes from the given Buffer. \\\r\n   * Method available ONLY on NodeJS and Bun.\r\n   *\r\n   * If possible, always prefer reading using this method, as it is much faster than the other ones.\r\n   *\r\n   * NOTE: if you have an ArrayBuffer do not bother wrapping it into a node Buffer yourself. \\\r\n   * NOTE: if you have an ArrayBuffer use the appropriate `readArrayBuffer`.\r\n   */\r\n  readNodeBuffer(\r\n    dataIn: Buffer,\r\n    offsetPointer = { offset: 0 },\r\n    byteLength = dataIn.byteLength\r\n  ): ToJson<T> {\r\n    return this.read(dataIn, offsetPointer, byteLength, GET_FUNCTION_BUF)\r\n  }\r\n\r\n  /**\r\n   * Reads/deserializes from the given DataView.\r\n   *\r\n   * NOTE: if you have an ArrayBuffer do not bother wrapping it into a DataView yourself. \\\r\n   * NOTE: if you have an ArrayBuffer use the appropriate `readArrayBuffer`.\r\n   */\r\n  readDataView(\r\n    dataIn: DataView,\r\n    offsetPointer = { offset: 0 },\r\n    byteLength = dataIn.byteLength\r\n  ): ToJson<T> {\r\n    return this.read(dataIn, offsetPointer, byteLength, GET_FUNCTION)\r\n  }\r\n\r\n  /**\r\n   * Reads/deserializes from the given ArrayBuffer. \\\r\n   * WARNING: this method is practically a HACK.\r\n   *\r\n   * When using this method both the `byteOffset` and `byteLength` are REQUIRED and cannot be defaulted. \\\r\n   * This is to prevent serious bugs and security issues. \\\r\n   * That is because often raw ArrayBuffers come from a pre-allocated buffer pool and do not start at byteOffset 0.\r\n   *\r\n   * NOTE: if you have a node Buffer do not bother wrapping it into an ArrayBuffer yourself. \\\r\n   * NOTE: if you have a node Buffer use the appropriate `readNodeBuffer` as it is much faster and less error prone.\r\n   */\r\n  readArrayBuffer(\r\n    dataIn: ArrayBuffer & { buffer?: undefined },\r\n    byteOffset: number,\r\n    byteLength: number\r\n  ) {\r\n    return this.read(\r\n      hasNodeBuffers\r\n        ? Buffer.from(dataIn, byteOffset, byteLength)\r\n        : new DataView(dataIn, byteOffset, byteLength),\r\n      { offset: 0 }, // The underlying buffer has already been offsetted\r\n      byteLength,\r\n      hasNodeBuffers ? GET_FUNCTION_BUF : GET_FUNCTION\r\n    )\r\n  }\r\n\r\n  /**\r\n   * Writes/serializes the given object into a Buffer. \\\r\n   * Method available ONLY on NodeJS and Bun.\r\n   *\r\n   * If possible, always prefer writing using this method, as it is much faster than the other ones.\r\n   */\r\n  writeNodeBuffer(dataOut: ToJson<T>) {\r\n    const buffer = Buffer.allocUnsafe(this.minimumByteLength)\r\n    return this.write(buffer, dataOut, { offset: 0 }, SET_FUNCTION_BUF, growNodeBuffer)\r\n  }\r\n\r\n  /**\r\n   * Writes/serializes the given object into a DataView. \\\r\n   */\r\n  writeDataView(dataOut: ToJson<T>) {\r\n    const dataview = new DataView(new ArrayBuffer(this.minimumByteLength))\r\n    return this.write(dataview, dataOut, { offset: 0 }, SET_FUNCTION, growDataView)\r\n  }\r\n\r\n  /**\r\n   * Writes/serializes the given object into an ArrayBuffer. \\\r\n   * This method is just a wrapper around either  `writeNodeBuffer` or `writeDataView`. \\\r\n   *\r\n   * This method works with JavaScript standard raw ArrayBuffer(s) and, as such, is very error prone: \\\r\n   * Make sure you're using the returned byteLength and byteOffset fields in the read counterpart. \\\r\n   *\r\n   * Always consider whether is possible to use directly `writeNodeBuffer` or `writeDataView` instead of `writeArrayBuffer`. \\\r\n   * For more information read the `readArrayBuffer` documentation.\r\n   */\r\n  writeArrayBuffer(dataOut: ToJson<T>) {\r\n    const buf = hasNodeBuffers ? this.writeNodeBuffer(dataOut) : this.writeDataView(dataOut)\r\n    return { buffer: buf.buffer, byteLength: buf.byteLength, byteOffset: buf.byteOffset }\r\n  }\r\n\r\n  private readonly entries: Entries\r\n  readonly canFastWrite: boolean\r\n  readonly minimumByteLength: number\r\n\r\n  private constructor(\r\n    private readonly packetId: number,\r\n    definition?: T\r\n  ) {\r\n    this.entries = definition ? sortEntries(definition) : []\r\n    const inspection = inspectEntries(this.entries)\r\n\r\n    this.minimumByteLength = inspection.minimumByteLength\r\n    this.canFastWrite = inspection.canFastWrite\r\n  }\r\n\r\n  private read(\r\n    dataIn: DataView | Buffer,\r\n    offsetPointer: { offset: number },\r\n    byteLength: number,\r\n    readFunctions: typeof GET_FUNCTION | typeof GET_FUNCTION_BUF\r\n  ): ToJson<T> {\r\n    if (byteLength + offsetPointer.offset < this.minimumByteLength) {\r\n      throw new Error(\r\n        `There is no space available to fit a packet of type ${this.packetId} at offset ${offsetPointer.offset}`\r\n      )\r\n    }\r\n\r\n    if (\r\n      readFunctions[Field.UNSIGNED_INT_8](dataIn as any, offsetPointer.offset) !== this.packetId\r\n    ) {\r\n      throw new Error(\r\n        `Data at offset ${offsetPointer.offset} is not a packet of type ${this.packetId}`\r\n      )\r\n    }\r\n\r\n    offsetPointer.offset += 1\r\n    const result: any = {}\r\n\r\n    for (const [name, def] of this.entries) {\r\n      if (Array.isArray(def)) {\r\n        const length =\r\n          // def[1] is the length of a statically-sized array, if undefined: must read the length from the buffer as it means it's a dynamically-sized array\r\n          def[1] ?? readFunctions[Field.UNSIGNED_INT_8](dataIn as any, offsetPointer.offset++)\r\n\r\n        const array = Array(length)\r\n\r\n        const itemType = def[0]\r\n\r\n        if (typeof itemType === 'object') {\r\n          // Array of \"subpackets\"\r\n          for (let i = 0; i < length; ++i) {\r\n            array[i] = itemType.read(dataIn, offsetPointer, byteLength, readFunctions)\r\n          }\r\n        } else {\r\n          // Array of primitives (numbers)\r\n          const itemSize = BYTE_SIZE[itemType]\r\n\r\n          // It seems like looping over each element is actually much faster than using TypedArrays bulk copy.\r\n          // TODO: properly benchmark with various array sizes to see if it's actually the case.\r\n          for (let i = 0; i < length; ++i) {\r\n            array[i] = readFunctions[itemType](dataIn as any, offsetPointer.offset)\r\n            offsetPointer.offset += itemSize\r\n          }\r\n        }\r\n\r\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access\r\n        result[name] = array\r\n      } else if (typeof def === 'object') {\r\n        // Single \"subpacket\"\r\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access\r\n        result[name] = def.read(dataIn, offsetPointer, byteLength, readFunctions)\r\n      } else {\r\n        // Single primitive (number)\r\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access\r\n        result[name] = readFunctions[def](dataIn as any, offsetPointer.offset)\r\n        offsetPointer.offset += BYTE_SIZE[def]\r\n      }\r\n    }\r\n\r\n    return result as ToJson<T>\r\n  }\r\n\r\n  private write<Buf extends DataView | Buffer>(\r\n    buffer: Buf,\r\n    dataOut: ToJson<T>,\r\n    offsetPointer: { offset: number },\r\n    writeFunctions: typeof SET_FUNCTION | typeof SET_FUNCTION_BUF,\r\n    growBufferFunction: (buffer: Buf, newByteLength: number) => Buf\r\n  ): Buf {\r\n    writeFunctions[Field.UNSIGNED_INT_8](buffer as any, this.packetId, offsetPointer.offset)\r\n    offsetPointer.offset += 1\r\n\r\n    if (this.canFastWrite) {\r\n      // If there are no arrays, the minimumByteLength always equals to the full needed byteLength.\r\n      // So we can take the fast path, since we know beforehand that the buffer isn't going to grow.\r\n      this.fastWrite(buffer, dataOut, offsetPointer, writeFunctions)\r\n      return buffer\r\n    } else {\r\n      // If non-empty arrays are encountered, the buffer must grow.\r\n      // If every array is empty, the speed of this path is comparable to the fast path.\r\n      return this.slowWrite(\r\n        buffer,\r\n        dataOut,\r\n        offsetPointer,\r\n        this.minimumByteLength,\r\n        this.minimumByteLength,\r\n        writeFunctions,\r\n        growBufferFunction\r\n      )\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Fast write does not support writing dynamically-sized arrays.\r\n   */\r\n  private fastWrite<Buf extends DataView | Buffer>(\r\n    buffer: Buf,\r\n    dataOut: ToJson<T>,\r\n    offsetPointer: { offset: number },\r\n    writeFunctions: typeof SET_FUNCTION | typeof SET_FUNCTION_BUF\r\n  ) {\r\n    for (const [name, def] of this.entries) {\r\n      if (Array.isArray(def)) {\r\n        // Statically-sized array\r\n        const itemType = def[0]\r\n        const length = def[1]!\r\n        const data = dataOut[name] as any[]\r\n\r\n        if (typeof itemType === 'object') {\r\n          for (let i = 0; i < length; ++i) {\r\n            itemType.fastWrite(buffer, data[i] as ToJson<Definition>, offsetPointer, writeFunctions)\r\n          }\r\n        } else {\r\n          const itemSize = BYTE_SIZE[itemType]\r\n\r\n          for (let i = 0; i < length; ++i) {\r\n            writeFunctions[itemType](buffer as any, data[i] as number, offsetPointer.offset)\r\n            offsetPointer.offset += itemSize\r\n          }\r\n        }\r\n      } else if (typeof def === 'object') {\r\n        // Single \"subpacket\"\r\n        // In fastWrite there cannot be arrays, but the cast is needed because TypeScript can't possibly know that.\r\n        def.fastWrite(buffer, dataOut[name] as ToJson<Definition>, offsetPointer, writeFunctions)\r\n      } else {\r\n        // Single primitive (number)\r\n        writeFunctions[def](buffer as any, dataOut[name] as number, offsetPointer.offset)\r\n        offsetPointer.offset += BYTE_SIZE[def]\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * The slow writing path tries writing data into the buffer as fast as the fast writing path does. \\\r\n   * But, if a non-empty dynamically-sized array is encountered, the buffer needs to grow, slightly reducing performance.\r\n   */\r\n  private slowWrite<Buf extends DataView | Buffer>(\r\n    buffer: Buf,\r\n    dataOut: ToJson<T>,\r\n    offsetPointer: { offset: number },\r\n    byteLength: number,\r\n    maxByteLength: number,\r\n    writeFunctions: typeof SET_FUNCTION | typeof SET_FUNCTION_BUF,\r\n    growBufferFunction: (buffer: Buf, newByteLength: number) => Buf\r\n  ): Buf {\r\n    for (const [name, def] of this.entries) {\r\n      const data = dataOut[name]\r\n\r\n      if (Array.isArray(def)) {\r\n        // Could be both an array of just numbers or \"subpackets\"\r\n\r\n        const length = (data as any[]).length\r\n        const isDynamicArray = def[1] === undefined\r\n\r\n        // Check if it is a dynamically-sized array, if it is, the length of the array must be serialized in the buffer before its elements\r\n        // Explicitly check for undefined and not falsy values because it could be a statically-sized array of 0 elements.\r\n        if (isDynamicArray) {\r\n          writeFunctions[Field.UNSIGNED_INT_8](buffer as any, length, offsetPointer.offset)\r\n          offsetPointer.offset += 1\r\n        }\r\n\r\n        if (length > 0) {\r\n          const itemType = def[0]\r\n\r\n          if (typeof itemType === 'object') {\r\n            // Array of \"subpackets\"\r\n\r\n            if (isDynamicArray) {\r\n              const neededBytesForElements = length * itemType.minimumByteLength\r\n\r\n              byteLength += neededBytesForElements\r\n              maxByteLength += neededBytesForElements\r\n\r\n              if (buffer.byteLength < maxByteLength) {\r\n                buffer = growBufferFunction(buffer, maxByteLength)\r\n              }\r\n            }\r\n\r\n            for (const object of data as unknown as ToJson<Definition>[]) {\r\n              writeFunctions[Field.UNSIGNED_INT_8](\r\n                buffer as any,\r\n                itemType.packetId,\r\n                offsetPointer.offset\r\n              )\r\n\r\n              offsetPointer.offset += 1\r\n\r\n              buffer = itemType.slowWrite(\r\n                buffer,\r\n                object,\r\n                offsetPointer,\r\n                byteLength,\r\n                maxByteLength,\r\n                writeFunctions,\r\n                growBufferFunction\r\n              )\r\n\r\n              byteLength = offsetPointer.offset\r\n              maxByteLength = buffer.byteLength\r\n            }\r\n          } else {\r\n            // Array of primitives (numbers)\r\n            const itemSize = BYTE_SIZE[itemType]\r\n\r\n            if (isDynamicArray) {\r\n              const neededBytesForElements = length * itemSize\r\n\r\n              byteLength += neededBytesForElements\r\n              maxByteLength += neededBytesForElements\r\n\r\n              if (buffer.byteLength < maxByteLength) {\r\n                buffer = growBufferFunction(buffer, maxByteLength)\r\n              }\r\n            }\r\n\r\n            // It seems like looping over each element is actually much faster than using TypedArrays bulk copy.\r\n            // TODO: properly benchmark with various array sizes to see if it's actually the case.\r\n            for (const number of data as number[]) {\r\n              writeFunctions[itemType](buffer as any, number, offsetPointer.offset)\r\n              offsetPointer.offset += itemSize\r\n            }\r\n          }\r\n        }\r\n      } else if (typeof def === 'object') {\r\n        // Single \"subpacket\"\r\n        writeFunctions[Field.UNSIGNED_INT_8](buffer as any, def.packetId, offsetPointer.offset)\r\n        offsetPointer.offset += 1\r\n\r\n        buffer = def.slowWrite(\r\n          buffer,\r\n          data as ToJson<Definition>,\r\n          offsetPointer,\r\n          byteLength,\r\n          maxByteLength,\r\n          writeFunctions,\r\n          growBufferFunction\r\n        )\r\n\r\n        byteLength = offsetPointer.offset\r\n        maxByteLength = buffer.byteLength\r\n      } else {\r\n        // Single primitive (number)\r\n        writeFunctions[def](buffer as any, data as number, offsetPointer.offset)\r\n        offsetPointer.offset += BYTE_SIZE[def]\r\n      }\r\n    }\r\n\r\n    return buffer\r\n  }\r\n}\r\n\r\n/**\r\n * BinaryPacket definition: \\\r\n * Any packet can be defined through a \"schema\" object explaining its fields names and types.\r\n *\r\n * @example\r\n * // Imagine we have a game board where each cell is a square and is one unit big.\r\n * // A cell can be then defined by its X and Y coordinates.\r\n * // For simplicity, let's say there cannot be more than 256 cells, so we can use 8 bits for each coordinate.\r\n * const Cell = {\r\n *  x: Field.UNSIGNED_INT_8,\r\n *  y: Field.UNSIGNED_INT_8\r\n * }\r\n *\r\n * // When done with the cell definition we can create its BinaryPacket writer/reader.\r\n * // NOTE: each BinaryPacket needs an unique ID, for identification purposes and error checking.\r\n * const CellPacket = BinaryPacket.define(0, Cell)\r\n *\r\n * // Let's now make the definition of the whole game board.\r\n * // You can also specify arrays of both \"primitive\" fields and other BinaryPackets.\r\n * const Board = {\r\n *  numPlayers: Field.UNSIGNED_INT_8,\r\n *  cells: FieldArray(CellPacket)\r\n * }\r\n *\r\n * // When done with the board definition we can create its BinaryPacket writer/reader.\r\n * // NOTE: each BinaryPacket needs an unique ID, for identification purposes and error checking.\r\n * const BoardPacket = BinaryPacket.define(1, Board)\r\n *\r\n * // And use it.\r\n * const buffer = BoardPacket.writeNodeBuffer({\r\n *  numPlayers: 1,\r\n *  cells: [\r\n *    { x: 0, y: 0 },\r\n *    { x: 1, y: 1 }\r\n *  ]\r\n * })\r\n *\r\n * // sendTheBufferOver(buffer)\r\n * // ...\r\n * // const buffer = receiveTheBuffer()\r\n * const board = BoardPacket.readNodeBuffer(buffer)\r\n * // ...\r\n */\r\nexport type Definition = {\r\n  [fieldName: string]: MaybeArray<Field> | MaybeArray<BinaryPacket<Definition>>\r\n}\r\n\r\ntype MaybeArray<T> = T | [itemType: T] | [itemType: T, length: number]\r\n\r\n/**\r\n * Meta-type that converts a `Definition` schema to the type of the actual JavaScript object that will be written into a packet or read from. \\\r\n */\r\ntype ToJson<T extends Definition> = {\r\n  [K in keyof T]: T[K] extends [infer Item]\r\n    ? Item extends BinaryPacket<infer BPDef>\r\n      ? ToJson<BPDef>[]\r\n      : number[]\r\n    : T[K] extends [infer Item, infer Length]\r\n      ? Item extends BinaryPacket<infer BPDef>\r\n        ? ToJson<BPDef>[] & { length: Length }\r\n        : number[] & { length: Length }\r\n      : T[K] extends BinaryPacket<infer BPDef>\r\n        ? ToJson<BPDef>\r\n        : number\r\n}\r\n\r\n/**\r\n * In a JavaScript object, the order of its keys is not strictly defined: sort them by field name. \\\r\n * Thus, we cannot trust iterating over an object keys: we MUST iterate over its entries array. \\\r\n * This is important to make sure that whoever shares BinaryPacket definitions can correctly write/read packets independently of their JS engines.\r\n */\r\nfunction sortEntries(definition: Definition) {\r\n  return Object.entries(definition).sort(([fieldName1], [fieldName2]) =>\r\n    fieldName1.localeCompare(fieldName2)\r\n  )\r\n}\r\n\r\ntype Entries = ReturnType<typeof sortEntries>\r\n\r\n/**\r\n * Helper function that \"inspects\" the entries of a BinaryPacket definition\r\n * and returns useful \"stats\" needed for writing and reading buffers.\r\n *\r\n * This function is ever called only once per BinaryPacket definition.\r\n */\r\nfunction inspectEntries(entries: Entries) {\r\n  // The PacketID is already 1 byte, that's why we aren't starting from 0.\r\n  let minimumByteLength = 1\r\n  let canFastWrite = true\r\n\r\n  for (const [, type] of entries) {\r\n    if (Array.isArray(type)) {\r\n      if (type.length === 2) {\r\n        // Statically-sized array\r\n        const itemSize =\r\n          typeof type[0] === 'object' ? type[0].minimumByteLength : BYTE_SIZE[type[0]]\r\n\r\n        minimumByteLength += type[1] * itemSize\r\n      } else {\r\n        // Dynamically-sized array\r\n        // Adding 1 byte to serialize the array length\r\n        minimumByteLength += 1\r\n        canFastWrite = false\r\n      }\r\n    } else if (type instanceof BinaryPacket) {\r\n      minimumByteLength += type.minimumByteLength\r\n      canFastWrite &&= type.canFastWrite\r\n    } else {\r\n      minimumByteLength += BYTE_SIZE[type]\r\n    }\r\n  }\r\n\r\n  return { minimumByteLength, canFastWrite }\r\n}\r\n\r\n//////////////////////////////////////////////\r\n// The logic here is practically over       //\r\n// Here below there are needed constants    //\r\n// that map a field-type to a functionality //\r\n//////////////////////////////////////////////\r\n\r\nconst BYTE_SIZE = Array(8) as number[]\r\n\r\nBYTE_SIZE[Field.UNSIGNED_INT_8] = 1\r\nBYTE_SIZE[Field.INT_8] = 1\r\n\r\nBYTE_SIZE[Field.UNSIGNED_INT_16] = 2\r\nBYTE_SIZE[Field.INT_16] = 2\r\n\r\nBYTE_SIZE[Field.UNSIGNED_INT_32] = 4\r\nBYTE_SIZE[Field.INT_32] = 4\r\nBYTE_SIZE[Field.FLOAT_32] = 4\r\n\r\nBYTE_SIZE[Field.FLOAT_64] = 8\r\n\r\nconst GET_FUNCTION = Array(8) as ((view: DataView, offset: number) => number)[]\r\n\r\nGET_FUNCTION[Field.UNSIGNED_INT_8] = (view, offset) => view.getUint8(offset)\r\nGET_FUNCTION[Field.INT_8] = (view, offset) => view.getInt8(offset)\r\n\r\nGET_FUNCTION[Field.UNSIGNED_INT_16] = (view, offset) => view.getUint16(offset)\r\nGET_FUNCTION[Field.INT_16] = (view, offset) => view.getInt16(offset)\r\n\r\nGET_FUNCTION[Field.UNSIGNED_INT_32] = (view, offset) => view.getUint32(offset)\r\nGET_FUNCTION[Field.INT_32] = (view, offset) => view.getInt32(offset)\r\nGET_FUNCTION[Field.FLOAT_32] = (view, offset) => view.getFloat32(offset)\r\n\r\nGET_FUNCTION[Field.FLOAT_64] = (view, offset) => view.getFloat64(offset)\r\n\r\nconst SET_FUNCTION = Array(8) as ((view: DataView, value: number, offset: number) => void)[]\r\n\r\nSET_FUNCTION[Field.UNSIGNED_INT_8] = (view, value, offset) => view.setUint8(offset, value)\r\nSET_FUNCTION[Field.INT_8] = (view, value, offset) => view.setInt8(offset, value)\r\n\r\nSET_FUNCTION[Field.UNSIGNED_INT_16] = (view, value, offset) => view.setUint16(offset, value)\r\nSET_FUNCTION[Field.INT_16] = (view, value, offset) => view.setInt16(offset, value)\r\n\r\nSET_FUNCTION[Field.UNSIGNED_INT_32] = (view, value, offset) => view.setUint32(offset, value)\r\nSET_FUNCTION[Field.INT_32] = (view, value, offset) => view.setInt32(offset, value)\r\nSET_FUNCTION[Field.FLOAT_32] = (view, value, offset) => view.setFloat32(offset, value)\r\n\r\nSET_FUNCTION[Field.FLOAT_64] = (view, value, offset) => view.setFloat64(offset, value)\r\n\r\nconst SET_FUNCTION_BUF = Array(8) as ((nodeBuffer: Buffer, value: number, offset: number) => void)[]\r\n\r\nif (hasNodeBuffers) {\r\n  SET_FUNCTION_BUF[Field.UNSIGNED_INT_8] = (view, value, offset) => view.writeUint8(value, offset)\r\n  SET_FUNCTION_BUF[Field.INT_8] = (view, value, offset) => view.writeInt8(value, offset)\r\n\r\n  SET_FUNCTION_BUF[Field.UNSIGNED_INT_16] = (view, value, offset) =>\r\n    view.writeUint16LE(value, offset)\r\n  SET_FUNCTION_BUF[Field.INT_16] = (view, value, offset) => view.writeInt16LE(value, offset)\r\n\r\n  SET_FUNCTION_BUF[Field.UNSIGNED_INT_32] = (view, value, offset) =>\r\n    view.writeUint32LE(value, offset)\r\n  SET_FUNCTION_BUF[Field.INT_32] = (view, value, offset) => view.writeInt32LE(value, offset)\r\n  SET_FUNCTION_BUF[Field.FLOAT_32] = (view, value, offset) => view.writeFloatLE(value, offset)\r\n\r\n  SET_FUNCTION_BUF[Field.FLOAT_64] = (view, value, offset) => view.writeDoubleLE(value, offset)\r\n}\r\n\r\nconst GET_FUNCTION_BUF = Array(8) as ((nodeBuffer: Buffer, offset: number) => number)[]\r\n\r\nif (hasNodeBuffers) {\r\n  GET_FUNCTION_BUF[Field.UNSIGNED_INT_8] = (view, offset) => view.readUint8(offset)\r\n  GET_FUNCTION_BUF[Field.INT_8] = (view, offset) => view.readInt8(offset)\r\n\r\n  GET_FUNCTION_BUF[Field.UNSIGNED_INT_16] = (view, offset) => view.readUint16LE(offset)\r\n  GET_FUNCTION_BUF[Field.INT_16] = (view, offset) => view.readInt16LE(offset)\r\n\r\n  GET_FUNCTION_BUF[Field.UNSIGNED_INT_32] = (view, offset) => view.readUint32LE(offset)\r\n  GET_FUNCTION_BUF[Field.INT_32] = (view, offset) => view.readInt32LE(offset)\r\n  GET_FUNCTION_BUF[Field.FLOAT_32] = (view, offset) => view.readFloatLE(offset)\r\n\r\n  GET_FUNCTION_BUF[Field.FLOAT_64] = (view, offset) => view.readDoubleLE(offset)\r\n}\r\n"],"mappings":"AAAO,IAAMA,EAAiB,OAAO,QAAW,WAEzC,SAASC,EAAaC,EAAoBC,EAAuB,CACtE,IAAMC,EAAgB,IAAI,YAAYD,CAAa,EAC7CE,EAAe,KAAK,IAAIH,EAAS,WAAYE,EAAc,UAAU,EAGvEE,EAAS,KAAK,MAAMD,EAAe,CAAC,EACxC,IAAI,aAAaD,EAAe,EAAGE,CAAM,EAAE,IAAI,IAAI,aAAaJ,EAAS,OAAQ,EAAGI,CAAM,CAAC,EAG3F,IAAMC,EAASD,EAAS,EACxB,OAAAA,EAASD,EAAeE,EACxB,IAAI,WAAWH,EAAeG,EAAQD,CAAM,EAAE,IAAI,IAAI,WAAWJ,EAAS,OAAQK,EAAQD,CAAM,CAAC,EAE1F,IAAI,SAASF,CAAa,CACnC,CAEO,SAASI,EAAeC,EAAgBN,EAAuB,CACpE,IAAMO,EAAY,OAAO,YAAYP,CAAa,EAClD,OAAAM,EAAO,KAAKC,CAAS,EACdA,CACT,CCpBO,IAAWC,OAKhBA,IAAA,eAAiB,GAAjB,iBAMAA,IAAA,qCAMAA,IAAA,qCAMAA,IAAA,iBAMAA,IAAA,mBAMAA,IAAA,mBAKAA,IAAA,uBAKAA,IAAA,uBA7CgBA,OAAA,IAwDX,SAASC,EAAuDC,EAAwB,CAC7F,MAAO,CAACA,CAAI,CACd,CASO,SAASC,EACdD,EACAE,EAC+B,CAC/B,GAAIA,EAAS,GAAK,CAAC,OAAO,SAASA,CAAM,EACvC,MAAM,IAAI,WAAW,oDAAoD,EAG3E,MAAO,CAACF,EAAME,CAAM,CACtB,CAEO,IAAMC,EAAN,MAAMC,CAAmC,CAiJtC,YACWC,EACjBC,EACA,CAFiB,cAAAD,EAGjB,KAAK,QAAUC,EAAaC,EAAYD,CAAU,EAAI,CAAC,EACvD,IAAME,EAAaC,EAAe,KAAK,OAAO,EAE9C,KAAK,kBAAoBD,EAAW,kBACpC,KAAK,aAAeA,EAAW,YACjC,CApJA,OAAO,OAA6BH,EAAkBC,EAAgB,CACpE,GAAID,EAAW,GAAK,CAAC,OAAO,SAASA,CAAQ,EAC3C,MAAM,IAAI,WAAW,uCAAuC,EAG9D,GAAIA,EAAW,IACb,MAAM,IAAI,WACR,6GACF,EAGF,OAAO,IAAID,EAAaC,EAAUC,CAAU,CAC9C,CAOA,OAAO,uBAAuBI,EAAgBC,EAAa,EAAG,CAC5D,OAAOD,EAAO,UAAUC,CAAU,CACpC,CAOA,OAAO,qBAAqBC,EAAoBD,EAAa,EAAG,CAC9D,OAAOC,EAAS,SAASD,CAAU,CACrC,CAUA,OAAO,wBAAwBE,EAA0BF,EAAoB,CAC3E,OAAO,IAAI,WAAWE,EAAaF,EAAY,CAAC,EAAE,CAAC,CACrD,CAWA,eACEG,EACAC,EAAgB,CAAE,OAAQ,CAAE,EAC5BC,EAAaF,EAAO,WACT,CACX,OAAO,KAAK,KAAKA,EAAQC,EAAeC,EAAYC,CAAgB,CACtE,CAQA,aACEH,EACAC,EAAgB,CAAE,OAAQ,CAAE,EAC5BC,EAAaF,EAAO,WACT,CACX,OAAO,KAAK,KAAKA,EAAQC,EAAeC,EAAYE,CAAY,CAClE,CAaA,gBACEJ,EACAH,EACAK,EACA,CACA,OAAO,KAAK,KACVG,EACI,OAAO,KAAKL,EAAQH,EAAYK,CAAU,EAC1C,IAAI,SAASF,EAAQH,EAAYK,CAAU,EAC/C,CAAE,OAAQ,CAAE,EACZA,EACAG,EAAiBF,EAAmBC,CACtC,CACF,CAQA,gBAAgBE,EAAoB,CAClC,IAAMV,EAAS,OAAO,YAAY,KAAK,iBAAiB,EACxD,OAAO,KAAK,MAAMA,EAAQU,EAAS,CAAE,OAAQ,CAAE,EAAGC,EAAkBC,CAAc,CACpF,CAKA,cAAcF,EAAoB,CAChC,IAAMR,EAAW,IAAI,SAAS,IAAI,YAAY,KAAK,iBAAiB,CAAC,EACrE,OAAO,KAAK,MAAMA,EAAUQ,EAAS,CAAE,OAAQ,CAAE,EAAGG,EAAcC,CAAY,CAChF,CAYA,iBAAiBJ,EAAoB,CACnC,IAAMK,EAAMN,EAAiB,KAAK,gBAAgBC,CAAO,EAAI,KAAK,cAAcA,CAAO,EACvF,MAAO,CAAE,OAAQK,EAAI,OAAQ,WAAYA,EAAI,WAAY,WAAYA,EAAI,UAAW,CACtF,CAEiB,QACR,aACA,kBAaD,KACNX,EACAC,EACAC,EACAU,EACW,CACX,GAAIV,EAAaD,EAAc,OAAS,KAAK,kBAC3C,MAAM,IAAI,MACR,uDAAuD,KAAK,QAAQ,cAAcA,EAAc,MAAM,EACxG,EAGF,GACEW,EAAc,CAAoB,EAAEZ,EAAeC,EAAc,MAAM,IAAM,KAAK,SAElF,MAAM,IAAI,MACR,kBAAkBA,EAAc,MAAM,4BAA4B,KAAK,QAAQ,EACjF,EAGFA,EAAc,QAAU,EACxB,IAAMY,EAAc,CAAC,EAErB,OAAW,CAACC,EAAMC,CAAG,IAAK,KAAK,QAC7B,GAAI,MAAM,QAAQA,CAAG,EAAG,CACtB,IAAM3B,EAEJ2B,EAAI,CAAC,GAAKH,EAAc,CAAoB,EAAEZ,EAAeC,EAAc,QAAQ,EAE/Ee,EAAQ,MAAM5B,CAAM,EAEpB6B,EAAWF,EAAI,CAAC,EAEtB,GAAI,OAAOE,GAAa,SAEtB,QAASC,EAAI,EAAGA,EAAI9B,EAAQ,EAAE8B,EAC5BF,EAAME,CAAC,EAAID,EAAS,KAAKjB,EAAQC,EAAeC,EAAYU,CAAa,MAEtE,CAEL,IAAMO,EAAWC,EAAUH,CAAQ,EAInC,QAASC,EAAI,EAAGA,EAAI9B,EAAQ,EAAE8B,EAC5BF,EAAME,CAAC,EAAIN,EAAcK,CAAQ,EAAEjB,EAAeC,EAAc,MAAM,EACtEA,EAAc,QAAUkB,CAE5B,CAGAN,EAAOC,CAAI,EAAIE,CACjB,MAAW,OAAOD,GAAQ,SAGxBF,EAAOC,CAAI,EAAIC,EAAI,KAAKf,EAAQC,EAAeC,EAAYU,CAAa,GAIxEC,EAAOC,CAAI,EAAIF,EAAcG,CAAG,EAAEf,EAAeC,EAAc,MAAM,EACrEA,EAAc,QAAUmB,EAAUL,CAAG,GAIzC,OAAOF,CACT,CAEQ,MACNjB,EACAU,EACAL,EACAoB,EACAC,EACK,CAIL,OAHAD,EAAe,CAAoB,EAAEzB,EAAe,KAAK,SAAUK,EAAc,MAAM,EACvFA,EAAc,QAAU,EAEpB,KAAK,cAGP,KAAK,UAAUL,EAAQU,EAASL,EAAeoB,CAAc,EACtDzB,GAIA,KAAK,UACVA,EACAU,EACAL,EACA,KAAK,kBACL,KAAK,kBACLoB,EACAC,CACF,CAEJ,CAKQ,UACN1B,EACAU,EACAL,EACAoB,EACA,CACA,OAAW,CAACP,EAAMC,CAAG,IAAK,KAAK,QAC7B,GAAI,MAAM,QAAQA,CAAG,EAAG,CAEtB,IAAME,EAAWF,EAAI,CAAC,EAChB3B,EAAS2B,EAAI,CAAC,EACdQ,EAAOjB,EAAQQ,CAAI,EAEzB,GAAI,OAAOG,GAAa,SACtB,QAASC,EAAI,EAAGA,EAAI9B,EAAQ,EAAE8B,EAC5BD,EAAS,UAAUrB,EAAQ2B,EAAKL,CAAC,EAAyBjB,EAAeoB,CAAc,MAEpF,CACL,IAAMF,EAAWC,EAAUH,CAAQ,EAEnC,QAASC,EAAI,EAAGA,EAAI9B,EAAQ,EAAE8B,EAC5BG,EAAeJ,CAAQ,EAAErB,EAAe2B,EAAKL,CAAC,EAAajB,EAAc,MAAM,EAC/EA,EAAc,QAAUkB,CAE5B,CACF,MAAW,OAAOJ,GAAQ,SAGxBA,EAAI,UAAUnB,EAAQU,EAAQQ,CAAI,EAAyBb,EAAeoB,CAAc,GAGxFA,EAAeN,CAAG,EAAEnB,EAAeU,EAAQQ,CAAI,EAAab,EAAc,MAAM,EAChFA,EAAc,QAAUmB,EAAUL,CAAG,EAG3C,CAMQ,UACNnB,EACAU,EACAL,EACAC,EACAsB,EACAH,EACAC,EACK,CACL,OAAW,CAACR,EAAMC,CAAG,IAAK,KAAK,QAAS,CACtC,IAAMQ,EAAOjB,EAAQQ,CAAI,EAEzB,GAAI,MAAM,QAAQC,CAAG,EAAG,CAGtB,IAAM3B,EAAUmC,EAAe,OACzBE,EAAiBV,EAAI,CAAC,IAAM,OASlC,GALIU,IACFJ,EAAe,CAAoB,EAAEzB,EAAeR,EAAQa,EAAc,MAAM,EAChFA,EAAc,QAAU,GAGtBb,EAAS,EAAG,CACd,IAAM6B,EAAWF,EAAI,CAAC,EAEtB,GAAI,OAAOE,GAAa,SAAU,CAGhC,GAAIQ,EAAgB,CAClB,IAAMC,EAAyBtC,EAAS6B,EAAS,kBAEjDf,GAAcwB,EACdF,GAAiBE,EAEb9B,EAAO,WAAa4B,IACtB5B,EAAS0B,EAAmB1B,EAAQ4B,CAAa,EAErD,CAEA,QAAWG,KAAUJ,EACnBF,EAAe,CAAoB,EACjCzB,EACAqB,EAAS,SACThB,EAAc,MAChB,EAEAA,EAAc,QAAU,EAExBL,EAASqB,EAAS,UAChBrB,EACA+B,EACA1B,EACAC,EACAsB,EACAH,EACAC,CACF,EAEApB,EAAaD,EAAc,OAC3BuB,EAAgB5B,EAAO,UAE3B,KAAO,CAEL,IAAMuB,EAAWC,EAAUH,CAAQ,EAEnC,GAAIQ,EAAgB,CAClB,IAAMC,EAAyBtC,EAAS+B,EAExCjB,GAAcwB,EACdF,GAAiBE,EAEb9B,EAAO,WAAa4B,IACtB5B,EAAS0B,EAAmB1B,EAAQ4B,CAAa,EAErD,CAIA,QAAWI,KAAUL,EACnBF,EAAeJ,CAAQ,EAAErB,EAAegC,EAAQ3B,EAAc,MAAM,EACpEA,EAAc,QAAUkB,CAE5B,CACF,CACF,MAAW,OAAOJ,GAAQ,UAExBM,EAAe,CAAoB,EAAEzB,EAAemB,EAAI,SAAUd,EAAc,MAAM,EACtFA,EAAc,QAAU,EAExBL,EAASmB,EAAI,UACXnB,EACA2B,EACAtB,EACAC,EACAsB,EACAH,EACAC,CACF,EAEApB,EAAaD,EAAc,OAC3BuB,EAAgB5B,EAAO,aAGvByB,EAAeN,CAAG,EAAEnB,EAAe2B,EAAgBtB,EAAc,MAAM,EACvEA,EAAc,QAAUmB,EAAUL,CAAG,EAEzC,CAEA,OAAOnB,CACT,CACF,EAyEA,SAASH,EAAYD,EAAwB,CAC3C,OAAO,OAAO,QAAQA,CAAU,EAAE,KAAK,CAAC,CAACqC,CAAU,EAAG,CAACC,CAAU,IAC/DD,EAAW,cAAcC,CAAU,CACrC,CACF,CAUA,SAASnC,EAAeoC,EAAkB,CAExC,IAAIC,EAAoB,EACpBC,EAAe,GAEnB,OAAW,CAAC,CAAEC,CAAI,IAAKH,EACrB,GAAI,MAAM,QAAQG,CAAI,EACpB,GAAIA,EAAK,SAAW,EAAG,CAErB,IAAMf,EACJ,OAAOe,EAAK,CAAC,GAAM,SAAWA,EAAK,CAAC,EAAE,kBAAoBd,EAAUc,EAAK,CAAC,CAAC,EAE7EF,GAAqBE,EAAK,CAAC,EAAIf,CACjC,MAGEa,GAAqB,EACrBC,EAAe,QAERC,aAAgB7C,GACzB2C,GAAqBE,EAAK,kBAC1BD,IAAiBC,EAAK,cAEtBF,GAAqBZ,EAAUc,CAAI,EAIvC,MAAO,CAAE,kBAAAF,EAAmB,aAAAC,CAAa,CAC3C,CAQA,IAAMb,EAAY,MAAM,CAAC,EAEzBA,EAAU,CAAoB,EAAI,EAClCA,EAAU,CAAW,EAAI,EAEzBA,EAAU,CAAqB,EAAI,EACnCA,EAAU,CAAY,EAAI,EAE1BA,EAAU,CAAqB,EAAI,EACnCA,EAAU,CAAY,EAAI,EAC1BA,EAAU,CAAc,EAAI,EAE5BA,EAAU,CAAc,EAAI,EAE5B,IAAMhB,EAAe,MAAM,CAAC,EAE5BA,EAAa,CAAoB,EAAI,CAAC+B,EAAMC,IAAWD,EAAK,SAASC,CAAM,EAC3EhC,EAAa,CAAW,EAAI,CAAC+B,EAAMC,IAAWD,EAAK,QAAQC,CAAM,EAEjEhC,EAAa,CAAqB,EAAI,CAAC+B,EAAMC,IAAWD,EAAK,UAAUC,CAAM,EAC7EhC,EAAa,CAAY,EAAI,CAAC+B,EAAMC,IAAWD,EAAK,SAASC,CAAM,EAEnEhC,EAAa,CAAqB,EAAI,CAAC+B,EAAMC,IAAWD,EAAK,UAAUC,CAAM,EAC7EhC,EAAa,CAAY,EAAI,CAAC+B,EAAMC,IAAWD,EAAK,SAASC,CAAM,EACnEhC,EAAa,CAAc,EAAI,CAAC+B,EAAMC,IAAWD,EAAK,WAAWC,CAAM,EAEvEhC,EAAa,CAAc,EAAI,CAAC+B,EAAMC,IAAWD,EAAK,WAAWC,CAAM,EAEvE,IAAM3B,EAAe,MAAM,CAAC,EAE5BA,EAAa,CAAoB,EAAI,CAAC0B,EAAME,EAAOD,IAAWD,EAAK,SAASC,EAAQC,CAAK,EACzF5B,EAAa,CAAW,EAAI,CAAC0B,EAAME,EAAOD,IAAWD,EAAK,QAAQC,EAAQC,CAAK,EAE/E5B,EAAa,CAAqB,EAAI,CAAC0B,EAAME,EAAOD,IAAWD,EAAK,UAAUC,EAAQC,CAAK,EAC3F5B,EAAa,CAAY,EAAI,CAAC0B,EAAME,EAAOD,IAAWD,EAAK,SAASC,EAAQC,CAAK,EAEjF5B,EAAa,CAAqB,EAAI,CAAC0B,EAAME,EAAOD,IAAWD,EAAK,UAAUC,EAAQC,CAAK,EAC3F5B,EAAa,CAAY,EAAI,CAAC0B,EAAME,EAAOD,IAAWD,EAAK,SAASC,EAAQC,CAAK,EACjF5B,EAAa,CAAc,EAAI,CAAC0B,EAAME,EAAOD,IAAWD,EAAK,WAAWC,EAAQC,CAAK,EAErF5B,EAAa,CAAc,EAAI,CAAC0B,EAAME,EAAOD,IAAWD,EAAK,WAAWC,EAAQC,CAAK,EAErF,IAAM9B,EAAmB,MAAM,CAAC,EAE5BF,IACFE,EAAiB,CAAoB,EAAI,CAAC4B,EAAME,EAAOD,IAAWD,EAAK,WAAWE,EAAOD,CAAM,EAC/F7B,EAAiB,CAAW,EAAI,CAAC4B,EAAME,EAAOD,IAAWD,EAAK,UAAUE,EAAOD,CAAM,EAErF7B,EAAiB,CAAqB,EAAI,CAAC4B,EAAME,EAAOD,IACtDD,EAAK,cAAcE,EAAOD,CAAM,EAClC7B,EAAiB,CAAY,EAAI,CAAC4B,EAAME,EAAOD,IAAWD,EAAK,aAAaE,EAAOD,CAAM,EAEzF7B,EAAiB,CAAqB,EAAI,CAAC4B,EAAME,EAAOD,IACtDD,EAAK,cAAcE,EAAOD,CAAM,EAClC7B,EAAiB,CAAY,EAAI,CAAC4B,EAAME,EAAOD,IAAWD,EAAK,aAAaE,EAAOD,CAAM,EACzF7B,EAAiB,CAAc,EAAI,CAAC4B,EAAME,EAAOD,IAAWD,EAAK,aAAaE,EAAOD,CAAM,EAE3F7B,EAAiB,CAAc,EAAI,CAAC4B,EAAME,EAAOD,IAAWD,EAAK,cAAcE,EAAOD,CAAM,GAG9F,IAAMjC,EAAmB,MAAM,CAAC,EAE5BE,IACFF,EAAiB,CAAoB,EAAI,CAACgC,EAAMC,IAAWD,EAAK,UAAUC,CAAM,EAChFjC,EAAiB,CAAW,EAAI,CAACgC,EAAMC,IAAWD,EAAK,SAASC,CAAM,EAEtEjC,EAAiB,CAAqB,EAAI,CAACgC,EAAMC,IAAWD,EAAK,aAAaC,CAAM,EACpFjC,EAAiB,CAAY,EAAI,CAACgC,EAAMC,IAAWD,EAAK,YAAYC,CAAM,EAE1EjC,EAAiB,CAAqB,EAAI,CAACgC,EAAMC,IAAWD,EAAK,aAAaC,CAAM,EACpFjC,EAAiB,CAAY,EAAI,CAACgC,EAAMC,IAAWD,EAAK,YAAYC,CAAM,EAC1EjC,EAAiB,CAAc,EAAI,CAACgC,EAAMC,IAAWD,EAAK,YAAYC,CAAM,EAE5EjC,EAAiB,CAAc,EAAI,CAACgC,EAAMC,IAAWD,EAAK,aAAaC,CAAM","names":["hasNodeBuffers","growDataView","dataview","newByteLength","resizedBuffer","amountToCopy","length","offset","growNodeBuffer","buffer","newBuffer","Field","FieldArray","item","FieldFixedArray","length","BinaryPacket","_BinaryPacket","packetId","definition","sortEntries","inspection","inspectEntries","buffer","byteOffset","dataview","arraybuffer","dataIn","offsetPointer","byteLength","GET_FUNCTION_BUF","GET_FUNCTION","hasNodeBuffers","dataOut","SET_FUNCTION_BUF","growNodeBuffer","SET_FUNCTION","growDataView","buf","readFunctions","result","name","def","array","itemType","i","itemSize","BYTE_SIZE","writeFunctions","growBufferFunction","data","maxByteLength","isDynamicArray","neededBytesForElements","object","number","fieldName1","fieldName2","entries","minimumByteLength","canFastWrite","type","view","offset","value"]}
+{"version":3,"sources":["../src/buffers.ts","../src/index.ts"],"sourcesContent":["/**\r\n * Exclusively matches objects of type `ArrayBuffer` and no other types that inherit from it. \\\r\n * This is needed because the `DataView` constructor explicitly requires a \"true\" ArrayBuffer, or else it throws.\r\n */\r\nexport type TrueArrayBuffer = ArrayBuffer & { buffer?: undefined }\r\n\r\nexport const hasNodeBuffers = typeof Buffer === 'function'\r\n\r\nexport function growDataView(dataview: DataView, newByteLength: number) {\r\n  const resizedBuffer = new ArrayBuffer(newByteLength)\r\n  const amountToCopy = Math.min(dataview.byteLength, resizedBuffer.byteLength)\r\n\r\n  // Treat the buffer as if it was a Float64Array so we can copy 8 bytes at a time, to finish faster\r\n  let length = Math.trunc(amountToCopy / 8)\r\n  new Float64Array(resizedBuffer, 0, length).set(new Float64Array(dataview.buffer, 0, length))\r\n\r\n  // Copy the remaining up to 7 bytes\r\n  const offset = length * 8\r\n  length = amountToCopy - offset\r\n  new Uint8Array(resizedBuffer, offset, length).set(new Uint8Array(dataview.buffer, offset, length))\r\n\r\n  return new DataView(resizedBuffer)\r\n}\r\n\r\nexport function growNodeBuffer(buffer: Buffer, newByteLength: number) {\r\n  const newBuffer = Buffer.allocUnsafe(newByteLength)\r\n  buffer.copy(newBuffer)\r\n  return newBuffer\r\n}\r\n","import { growDataView, growNodeBuffer, hasNodeBuffers, type TrueArrayBuffer } from './buffers'\r\n\r\nexport const enum Field {\r\n  /**\r\n   * Defines a 1 byte (8 bits) unsigned integer field. \\\r\n   * (Range: 0 - 255)\r\n   */\r\n  UNSIGNED_INT_8 = 0,\r\n\r\n  /**\r\n   * Defines a 2 bytes (16 bits) unsigned integer field. \\\r\n   * (Range: 0 - 65535)\r\n   */\r\n  UNSIGNED_INT_16,\r\n\r\n  /**\r\n   * Defines a 4 bytes (32 bits) unsigned integer field. \\\r\n   * (Range: 0 - 4294967295)\r\n   */\r\n  UNSIGNED_INT_32,\r\n\r\n  /**\r\n   * Defines a 1 byte (8 bits) signed integer field. \\\r\n   * (Range: -128 - 127)\r\n   */\r\n  INT_8,\r\n\r\n  /**\r\n   * Defines a 2 bytes (16 bits) signed integer field. \\\r\n   * (Range: -32768 - 32767)\r\n   */\r\n  INT_16,\r\n\r\n  /**\r\n   * Defines a 4 bytes (32 bits) signed integer field. \\\r\n   * (Range: -2147483648 - 2147483647)\r\n   */\r\n  INT_32,\r\n\r\n  /**\r\n   * Defines a 4 bytes (32 bits) floating-point field. \\\r\n   */\r\n  FLOAT_32,\r\n\r\n  /**\r\n   * Defines a 8 bytes (64 bits) floating-point field. \\\r\n   */\r\n  FLOAT_64\r\n}\r\n\r\n/**\r\n * Defines a dynamically-sized array with elements of a certain type. \\\r\n * Dynamically-sized arrays are useful when a packet's field is an array of a non pre-defined length. \\\r\n * Although, this makes dynamically-sized arrays more memory expensive as the internal buffer needs to be grown accordingly.\r\n *\r\n * NOTE: If an array will ALWAYS have the same length, prefer using the `FieldFixedArray` type, for both better performance and memory efficiency. \\\r\n * NOTE: As of now, dynamic arrays can have at most 256 elements.\r\n */\r\nexport function FieldArray<T extends Field | BinaryPacket<Definition>>(item: T): [itemType: T] {\r\n  return [item]\r\n}\r\n\r\n/**\r\n * Defines a statically-sized array with elements of a certain type. \\\r\n * Fixed arrays are useful when a packet's field is an array of a pre-defined length. \\\r\n * Fixed arrays much more memory efficient and performant than non-fixed ones.\r\n *\r\n * NOTE: If an array will not always have the same length, use the `FieldArray` type.\r\n */\r\nexport function FieldFixedArray<T extends Field | BinaryPacket<Definition>, Length extends number>(\r\n  item: T,\r\n  length: Length\r\n): [itemType: T, length: Length] {\r\n  if (length < 0 || !Number.isFinite(length)) {\r\n    throw new RangeError('Length of a FixedArray must be a positive integer.')\r\n  }\r\n\r\n  return [item, length]\r\n}\r\n\r\ntype BitFlags = (string[] | ReadonlyArray<string>) & {\r\n  length: 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8\r\n}\r\n\r\n/**\r\n * Defines a sequence of up to 8 \"flags\" (basically single bits/booleans) that can be packed together into a single 8 bits value. \\\r\n * This is useful for minimizing bytes usage when there are lots of boolean fields/flags, instead of saving each flag separately as its own 8 bits value.\r\n *\r\n * The input should be an array of strings (with at most 8 elements) where each string defines the name of a flag. \\\r\n * This is just for definition purposes, then when actually writing or reading packets it'll just be a record-object with those names as keys and boolean values.\r\n */\r\nexport function FieldBitFlags<const FlagsArray extends BitFlags>(flags: FlagsArray) {\r\n  if (flags.length > 8) {\r\n    throw new Error(\r\n      `Invalid BinaryPacket definition: a BitFlags field can have only up to 8 flags, given: ${flags.join(', ')}`\r\n    )\r\n  }\r\n\r\n  return { flags }\r\n}\r\n\r\n/**\r\n * Do not manually construct this type: an object of this kind is returned by a BinaryPacket `createVisitor` method. \\\r\n * Used in the `BinaryPacket::visit` static method to perform a sort of \"pattern matching\" on an incoming packet (of yet unknown type) buffer.\r\n */\r\ntype Visitor = [BinaryPacket<Definition>, (packet: any) => void]\r\n\r\nexport class BinaryPacket<T extends Definition> {\r\n  /**\r\n   * Defines a new binary packet. \\\r\n   * Make sure that every `packetId` is unique.\r\n   * @throws RangeError If packetId is negative, floating-point, or greater than 255.\r\n   */\r\n  static define<T extends Definition>(packetId: number, definition?: T) {\r\n    if (packetId < 0 || !Number.isFinite(packetId)) {\r\n      throw new RangeError('Packet IDs must be positive integers.')\r\n    }\r\n\r\n    if (packetId > 255) {\r\n      throw new RangeError(\r\n        'Packet IDs greater than 255 are not supported. Do you REALLY need more than 255 different kinds of packets?'\r\n      )\r\n    }\r\n\r\n    return new BinaryPacket(packetId, definition)\r\n  }\r\n\r\n  /**\r\n   * Reads just the packetId from the given Buffer. \\\r\n   * This method practically just reads the uint8 at offset `byteOffset` (default: 0). \\\r\n   * Useful if the receiving side receives multiple types of packets.\r\n   */\r\n  static readPacketIdNodeBuffer(buffer: Buffer, byteOffset = 0) {\r\n    return buffer.readUint8(byteOffset)\r\n  }\r\n\r\n  /**\r\n   * Reads just the packetId from the given DataView. \\\r\n   * This method practically just reads the uint8 at offset `byteOffset` (default: 0). \\\r\n   * Useful if the receiving side receives multiple types of packets.\r\n   */\r\n  static readPacketIdDataView(dataview: DataView, byteOffset = 0) {\r\n    return dataview.getUint8(byteOffset)\r\n  }\r\n\r\n  /**\r\n   * Reads just the packetId from the given ArrayBuffer. \\\r\n   * This method practically just reads the uint8 at offset `byteOffset`. \\\r\n   * Useful if the receiving side receives multiple types of packets.\r\n   *\r\n   * NOTE: Due to security issues, the `byteOffset` argument cannot be defaulted and must be provided by the user. \\\r\n   * NOTE: For more information read the `readArrayBuffer` method documentation.\r\n   */\r\n  static readPacketIdArrayBuffer(arraybuffer: TrueArrayBuffer, byteOffset: number) {\r\n    return new Uint8Array(arraybuffer, byteOffset, 1)[0]\r\n  }\r\n\r\n  /**\r\n   * Visits and \"pattern matches\" the given Buffer through the given visitors. \\\r\n   * The Buffer is compared to the series of visitors through its Packet ID, and, if an appropriate visitor is found: its callback is called.\r\n   *\r\n   * NOTE: If visiting packets in a loop, for both performance and memory efficiency reasons, it is much better to create each visitor only once before the loop starts and not every iteration.\r\n   */\r\n  static visitNodeBuffer(buffer: Buffer, ...visitors: Visitor[]) {\r\n    return BinaryPacket.visit(buffer, GET_FUNCTION_BUF, visitors)\r\n  }\r\n\r\n  /**\r\n   * Visits and \"pattern matches\" the given DataView through the given visitors. \\\r\n   * The DataView is compared to the series of visitors through its Packet ID, and, if an appropriate visitor is found: its callback is called.\r\n   *\r\n   * NOTE: If visiting packets in a loop, for both performance and memory efficiency reasons, it is much better to create each visitor only once before the loop starts and not every iteration.\r\n   */\r\n  static visitDataView(dataview: DataView, ...visitors: Visitor[]) {\r\n    return BinaryPacket.visit(dataview, GET_FUNCTION, visitors)\r\n  }\r\n\r\n  /**\r\n   * Visits and \"pattern matches\" the given ArrayBuffer through the given visitors. \\\r\n   * The ArrayBuffer is compared to the series of visitors through its Packet ID, and, if an appropriate visitor is found: its callback is called.\r\n   *\r\n   * NOTE: Due to security issues, the `byteOffset` and `byteLength` arguments must be provided by the user. \\\r\n   * NOTE: For more information read the `readArrayBuffer` method documentation. \\\r\n   * NOTE: If visiting packets in a loop, for both performance and memory efficiency reasons, it is much better to create each visitor only once before the loop starts and not every iteration.\r\n   */\r\n  static visitArrayBuffer(\r\n    arraybuffer: TrueArrayBuffer,\r\n    byteOffset: number,\r\n    byteLength: number,\r\n    ...visitors: Visitor[]\r\n  ) {\r\n    return BinaryPacket.visit(\r\n      new DataView(arraybuffer, byteOffset, byteLength),\r\n      GET_FUNCTION,\r\n      visitors\r\n    )\r\n  }\r\n\r\n  /**\r\n   * Reads/deserializes from the given Buffer. \\\r\n   * Method available ONLY on NodeJS and Bun.\r\n   *\r\n   * If possible, always prefer reading using this method, as it is much faster than the other ones.\r\n   *\r\n   * NOTE: if you have an ArrayBuffer do not bother wrapping it into a node Buffer yourself. \\\r\n   * NOTE: if you have an ArrayBuffer use the appropriate `readArrayBuffer`.\r\n   */\r\n  readNodeBuffer(\r\n    dataIn: Buffer,\r\n    offsetPointer = { offset: 0 },\r\n    byteLength = dataIn.byteLength\r\n  ): ToJson<T> {\r\n    return this.read(dataIn, offsetPointer, byteLength, GET_FUNCTION_BUF)\r\n  }\r\n\r\n  /**\r\n   * Reads/deserializes from the given DataView.\r\n   *\r\n   * NOTE: if you have an ArrayBuffer do not bother wrapping it into a DataView yourself. \\\r\n   * NOTE: if you have an ArrayBuffer use the appropriate `readArrayBuffer`.\r\n   */\r\n  readDataView(\r\n    dataIn: DataView,\r\n    offsetPointer = { offset: 0 },\r\n    byteLength = dataIn.byteLength\r\n  ): ToJson<T> {\r\n    return this.read(dataIn, offsetPointer, byteLength, GET_FUNCTION)\r\n  }\r\n\r\n  /**\r\n   * Reads/deserializes from the given ArrayBuffer. \\\r\n   * WARNING: this method is practically a HACK.\r\n   *\r\n   * When using this method both the `byteOffset` and `byteLength` are REQUIRED and cannot be defaulted. \\\r\n   * This is to prevent serious bugs and security issues. \\\r\n   * That is because often raw ArrayBuffers come from a pre-allocated buffer pool and do not start at byteOffset 0.\r\n   *\r\n   * NOTE: if you have a node Buffer do not bother wrapping it into an ArrayBuffer yourself. \\\r\n   * NOTE: if you have a node Buffer use the appropriate `readNodeBuffer` as it is much faster and less error prone.\r\n   */\r\n  readArrayBuffer(dataIn: TrueArrayBuffer, byteOffset: number, byteLength: number) {\r\n    return this.read(\r\n      hasNodeBuffers\r\n        ? Buffer.from(dataIn, byteOffset, byteLength)\r\n        : new DataView(dataIn, byteOffset, byteLength),\r\n      { offset: 0 }, // The underlying buffer has already been offsetted\r\n      byteLength,\r\n      hasNodeBuffers ? GET_FUNCTION_BUF : GET_FUNCTION\r\n    )\r\n  }\r\n\r\n  /**\r\n   * Writes/serializes the given object into a Buffer. \\\r\n   * Method available ONLY on NodeJS and Bun.\r\n   *\r\n   * If possible, always prefer writing using this method, as it is much faster than the other ones.\r\n   */\r\n  writeNodeBuffer(dataOut: ToJson<T>) {\r\n    const buffer = Buffer.allocUnsafe(this.minimumByteLength)\r\n    return this.write(buffer, dataOut, { offset: 0 }, SET_FUNCTION_BUF, growNodeBuffer)\r\n  }\r\n\r\n  /**\r\n   * Writes/serializes the given object into a DataView. \\\r\n   */\r\n  writeDataView(dataOut: ToJson<T>) {\r\n    const dataview = new DataView(new ArrayBuffer(this.minimumByteLength))\r\n    return this.write(dataview, dataOut, { offset: 0 }, SET_FUNCTION, growDataView)\r\n  }\r\n\r\n  /**\r\n   * Writes/serializes the given object into an ArrayBuffer. \\\r\n   * This method is just a wrapper around either  `writeNodeBuffer` or `writeDataView`. \\\r\n   *\r\n   * This method works with JavaScript standard raw ArrayBuffer(s) and, as such, is very error prone: \\\r\n   * Make sure you're using the returned byteLength and byteOffset fields in the read counterpart. \\\r\n   *\r\n   * Always consider whether is possible to use directly `writeNodeBuffer` or `writeDataView` instead of `writeArrayBuffer`. \\\r\n   * For more information read the `readArrayBuffer` documentation.\r\n   */\r\n  writeArrayBuffer(dataOut: ToJson<T>) {\r\n    const buf = hasNodeBuffers ? this.writeNodeBuffer(dataOut) : this.writeDataView(dataOut)\r\n    return { buffer: buf.buffer, byteLength: buf.byteLength, byteOffset: buf.byteOffset }\r\n  }\r\n\r\n  /**\r\n   * Creates a \"visitor\" object for this BinaryPacket definition. \\\r\n   * Used when visiting and \"pattern matching\" buffers with the `BinaryPacket::visit` static utility methods. \\\r\n   *\r\n   * For more information read the `BinaryPacket::visitNodeBuffer` documentation. \\\r\n   * NOTE: If visiting packets in a loop, for both performance and memory efficiency reasons, it is much better to create each visitor only once before the loop starts and not every iteration.\r\n   */\r\n  visitor(onVisit: (packet: ToJson<T>) => void): Visitor {\r\n    return [this, onVisit]\r\n  }\r\n\r\n  /// PRIVATE\r\n\r\n  private readonly entries: Entries\r\n  readonly canFastWrite: boolean\r\n  readonly minimumByteLength: number\r\n\r\n  private constructor(\r\n    private readonly packetId: number,\r\n    definition?: T\r\n  ) {\r\n    this.entries = definition ? sortEntries(definition) : []\r\n    const inspection = inspectEntries(this.entries)\r\n\r\n    this.minimumByteLength = inspection.minimumByteLength\r\n    this.canFastWrite = inspection.canFastWrite\r\n  }\r\n\r\n  private static visit(\r\n    dataIn: Buffer | DataView,\r\n    readFunctions: typeof GET_FUNCTION | typeof GET_FUNCTION_BUF,\r\n    visitors: Visitor[]\r\n  ) {\r\n    for (const [Packet, onVisit] of visitors) {\r\n      if (Packet.packetId === readFunctions[Field.UNSIGNED_INT_8](dataIn as any, 0)) {\r\n        return onVisit(Packet.read(dataIn, { offset: 0 }, dataIn.byteLength, readFunctions))\r\n      }\r\n    }\r\n  }\r\n\r\n  private read(\r\n    dataIn: DataView | Buffer,\r\n    offsetPointer: { offset: number },\r\n    byteLength: number,\r\n    readFunctions: typeof GET_FUNCTION | typeof GET_FUNCTION_BUF\r\n  ): ToJson<T> {\r\n    if (byteLength + offsetPointer.offset < this.minimumByteLength) {\r\n      throw new Error(\r\n        `There is no space available to fit a packet of type ${this.packetId} at offset ${offsetPointer.offset}`\r\n      )\r\n    }\r\n\r\n    if (\r\n      readFunctions[Field.UNSIGNED_INT_8](dataIn as any, offsetPointer.offset) !== this.packetId\r\n    ) {\r\n      throw new Error(\r\n        `Data at offset ${offsetPointer.offset} is not a packet of type ${this.packetId}`\r\n      )\r\n    }\r\n\r\n    offsetPointer.offset += 1\r\n    const result: any = {}\r\n\r\n    for (const [name, def] of this.entries) {\r\n      if (Array.isArray(def)) {\r\n        const length =\r\n          // def[1] is the length of a statically-sized array, if undefined: must read the length from the buffer as it means it's a dynamically-sized array\r\n          def[1] ?? readFunctions[Field.UNSIGNED_INT_8](dataIn as any, offsetPointer.offset++)\r\n\r\n        const array = Array(length)\r\n\r\n        const itemType = def[0]\r\n\r\n        if (typeof itemType === 'object') {\r\n          // Array of \"subpackets\"\r\n          for (let i = 0; i < length; ++i) {\r\n            array[i] = itemType.read(dataIn, offsetPointer, byteLength, readFunctions)\r\n          }\r\n        } else {\r\n          // Array of primitives (numbers)\r\n          const itemSize = BYTE_SIZE[itemType]\r\n\r\n          // It seems like looping over each element is actually much faster than using TypedArrays bulk copy.\r\n          // TODO: properly benchmark with various array sizes to see if it's actually the case.\r\n          for (let i = 0; i < length; ++i) {\r\n            array[i] = readFunctions[itemType](dataIn as any, offsetPointer.offset)\r\n            offsetPointer.offset += itemSize\r\n          }\r\n        }\r\n\r\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access\r\n        result[name] = array\r\n      } else if (typeof def === 'number') {\r\n        // Single primitive (number)\r\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access\r\n        result[name] = readFunctions[def](dataIn as any, offsetPointer.offset)\r\n        offsetPointer.offset += BYTE_SIZE[def]\r\n      } else if ('flags' in def) {\r\n        // BitFlags\r\n        const flags = readFunctions[Field.UNSIGNED_INT_8](dataIn as any, offsetPointer.offset)\r\n        offsetPointer.offset += 1\r\n\r\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access\r\n        result[name] = {}\r\n\r\n        for (let bit = 0; bit < def.flags.length; ++bit) {\r\n          // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access\r\n          result[name][def.flags[bit]] = !!(flags & (1 << bit))\r\n        }\r\n      } else {\r\n        // Single \"subpacket\"\r\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-member-access\r\n        result[name] = def.read(dataIn, offsetPointer, byteLength, readFunctions)\r\n      }\r\n    }\r\n\r\n    return result as ToJson<T>\r\n  }\r\n\r\n  private write<Buf extends DataView | Buffer>(\r\n    buffer: Buf,\r\n    dataOut: ToJson<T>,\r\n    offsetPointer: { offset: number },\r\n    writeFunctions: typeof SET_FUNCTION | typeof SET_FUNCTION_BUF,\r\n    growBufferFunction: (buffer: Buf, newByteLength: number) => Buf\r\n  ): Buf {\r\n    writeFunctions[Field.UNSIGNED_INT_8](buffer as any, this.packetId, offsetPointer.offset)\r\n    offsetPointer.offset += 1\r\n\r\n    if (this.canFastWrite) {\r\n      // If there are no arrays, the minimumByteLength always equals to the full needed byteLength.\r\n      // So we can take the fast path, since we know beforehand that the buffer isn't going to grow.\r\n      this.fastWrite(buffer, dataOut, offsetPointer, writeFunctions)\r\n      return buffer\r\n    } else {\r\n      // If non-empty arrays are encountered, the buffer must grow.\r\n      // If every array is empty, the speed of this path is comparable to the fast path.\r\n      return this.slowWrite(\r\n        buffer,\r\n        dataOut,\r\n        offsetPointer,\r\n        this.minimumByteLength,\r\n        this.minimumByteLength,\r\n        writeFunctions,\r\n        growBufferFunction\r\n      )\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Fast write does not support writing dynamically-sized arrays.\r\n   */\r\n  private fastWrite<Buf extends DataView | Buffer>(\r\n    buffer: Buf,\r\n    dataOut: ToJson<T>,\r\n    offsetPointer: { offset: number },\r\n    writeFunctions: typeof SET_FUNCTION | typeof SET_FUNCTION_BUF\r\n  ) {\r\n    for (const [name, def] of this.entries) {\r\n      const data = dataOut[name]\r\n\r\n      if (Array.isArray(def)) {\r\n        // Statically-sized array\r\n        const itemType = def[0]\r\n        const length = def[1]!\r\n\r\n        if (typeof itemType === 'object') {\r\n          for (let i = 0; i < length; ++i) {\r\n            itemType.fastWrite(\r\n              buffer,\r\n              (data as any[])[i] as ToJson<Definition>,\r\n              offsetPointer,\r\n              writeFunctions\r\n            )\r\n          }\r\n        } else {\r\n          const itemSize = BYTE_SIZE[itemType]\r\n\r\n          for (let i = 0; i < length; ++i) {\r\n            writeFunctions[itemType](buffer as any, (data as number[])[i], offsetPointer.offset)\r\n            offsetPointer.offset += itemSize\r\n          }\r\n        }\r\n      } else if (typeof def === 'number') {\r\n        // Single primitive (number)\r\n        writeFunctions[def](buffer as any, data as number, offsetPointer.offset)\r\n        offsetPointer.offset += BYTE_SIZE[def]\r\n      } else if ('flags' in def) {\r\n        // BitFlags\r\n        let flags = 0\r\n\r\n        for (let bit = 0; bit < def.flags.length; ++bit) {\r\n          if ((data as Record<string, boolean>)[def.flags[bit]]) {\r\n            flags |= 1 << bit\r\n          }\r\n        }\r\n\r\n        writeFunctions[Field.UNSIGNED_INT_8](buffer as any, flags, offsetPointer.offset)\r\n        offsetPointer.offset += 1\r\n      } else {\r\n        // Single \"subpacket\"\r\n        // In fastWrite there cannot be arrays, but the cast is needed because TypeScript can't possibly know that.\r\n        def.fastWrite(buffer, data as ToJson<Definition>, offsetPointer, writeFunctions)\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * The slow writing path tries writing data into the buffer as fast as the fast writing path does. \\\r\n   * But, if a non-empty dynamically-sized array is encountered, the buffer needs to grow, slightly reducing performance.\r\n   */\r\n  private slowWrite<Buf extends DataView | Buffer>(\r\n    buffer: Buf,\r\n    dataOut: ToJson<T>,\r\n    offsetPointer: { offset: number },\r\n    byteLength: number,\r\n    maxByteLength: number,\r\n    writeFunctions: typeof SET_FUNCTION | typeof SET_FUNCTION_BUF,\r\n    growBufferFunction: (buffer: Buf, newByteLength: number) => Buf\r\n  ): Buf {\r\n    for (const [name, def] of this.entries) {\r\n      const data = dataOut[name]\r\n\r\n      if (Array.isArray(def)) {\r\n        // Could be both an array of just numbers or \"subpackets\"\r\n\r\n        const length = (data as any[]).length\r\n        const isDynamicArray = def[1] === undefined\r\n\r\n        // Check if it is a dynamically-sized array, if it is, the length of the array must be serialized in the buffer before its elements\r\n        // Explicitly check for undefined and not falsy values because it could be a statically-sized array of 0 elements.\r\n        if (isDynamicArray) {\r\n          writeFunctions[Field.UNSIGNED_INT_8](buffer as any, length, offsetPointer.offset)\r\n          offsetPointer.offset += 1\r\n        }\r\n\r\n        if (length > 0) {\r\n          const itemType = def[0]\r\n\r\n          if (typeof itemType === 'object') {\r\n            // Array of \"subpackets\"\r\n\r\n            if (isDynamicArray) {\r\n              const neededBytesForElements = length * itemType.minimumByteLength\r\n\r\n              byteLength += neededBytesForElements\r\n              maxByteLength += neededBytesForElements\r\n\r\n              if (buffer.byteLength < maxByteLength) {\r\n                buffer = growBufferFunction(buffer, maxByteLength)\r\n              }\r\n            }\r\n\r\n            for (const object of data as unknown as ToJson<Definition>[]) {\r\n              writeFunctions[Field.UNSIGNED_INT_8](\r\n                buffer as any,\r\n                itemType.packetId,\r\n                offsetPointer.offset\r\n              )\r\n\r\n              offsetPointer.offset += 1\r\n\r\n              buffer = itemType.slowWrite(\r\n                buffer,\r\n                object,\r\n                offsetPointer,\r\n                byteLength,\r\n                maxByteLength,\r\n                writeFunctions,\r\n                growBufferFunction\r\n              )\r\n\r\n              byteLength = offsetPointer.offset\r\n              maxByteLength = buffer.byteLength\r\n            }\r\n          } else {\r\n            // Array of primitives (numbers)\r\n            const itemSize = BYTE_SIZE[itemType]\r\n\r\n            if (isDynamicArray) {\r\n              const neededBytesForElements = length * itemSize\r\n\r\n              byteLength += neededBytesForElements\r\n              maxByteLength += neededBytesForElements\r\n\r\n              if (buffer.byteLength < maxByteLength) {\r\n                buffer = growBufferFunction(buffer, maxByteLength)\r\n              }\r\n            }\r\n\r\n            // It seems like looping over each element is actually much faster than using TypedArrays bulk copy.\r\n            // TODO: properly benchmark with various array sizes to see if it's actually the case.\r\n            for (const number of data as number[]) {\r\n              writeFunctions[itemType](buffer as any, number, offsetPointer.offset)\r\n              offsetPointer.offset += itemSize\r\n            }\r\n          }\r\n        }\r\n      } else if (typeof def === 'number') {\r\n        // Single primitive (number)\r\n        writeFunctions[def](buffer as any, data as number, offsetPointer.offset)\r\n        offsetPointer.offset += BYTE_SIZE[def]\r\n      } else if ('flags' in def) {\r\n        // BitFlags\r\n        let flags = 0\r\n\r\n        for (let bit = 0; bit < def.flags.length; ++bit) {\r\n          if ((data as Record<string, boolean>)[def.flags[bit]]) {\r\n            flags |= 1 << bit\r\n          }\r\n        }\r\n\r\n        writeFunctions[Field.UNSIGNED_INT_8](buffer as any, flags, offsetPointer.offset)\r\n        offsetPointer.offset += 1\r\n      } else {\r\n        // Single \"subpacket\"\r\n        writeFunctions[Field.UNSIGNED_INT_8](buffer as any, def.packetId, offsetPointer.offset)\r\n        offsetPointer.offset += 1\r\n\r\n        buffer = def.slowWrite(\r\n          buffer,\r\n          data as ToJson<Definition>,\r\n          offsetPointer,\r\n          byteLength,\r\n          maxByteLength,\r\n          writeFunctions,\r\n          growBufferFunction\r\n        )\r\n\r\n        byteLength = offsetPointer.offset\r\n        maxByteLength = buffer.byteLength\r\n      }\r\n    }\r\n\r\n    return buffer\r\n  }\r\n}\r\n\r\n/**\r\n * BinaryPacket definition: \\\r\n * Any packet can be defined through a \"schema\" object explaining its fields names and types.\r\n *\r\n * @example\r\n * // Imagine we have a game board where each cell is a square and is one unit big.\r\n * // A cell can be then defined by its X and Y coordinates.\r\n * // For simplicity, let's say there cannot be more than 256 cells, so we can use 8 bits for each coordinate.\r\n * const Cell = {\r\n *  x: Field.UNSIGNED_INT_8,\r\n *  y: Field.UNSIGNED_INT_8\r\n * }\r\n *\r\n * // When done with the cell definition we can create its BinaryPacket writer/reader.\r\n * // NOTE: each BinaryPacket needs an unique ID, for identification purposes and error checking.\r\n * const CellPacket = BinaryPacket.define(0, Cell)\r\n *\r\n * // Let's now make the definition of the whole game board.\r\n * // You can also specify arrays of both \"primitive\" fields and other BinaryPackets.\r\n * const Board = {\r\n *  numPlayers: Field.UNSIGNED_INT_8,\r\n *  cells: FieldArray(CellPacket)\r\n * }\r\n *\r\n * // When done with the board definition we can create its BinaryPacket writer/reader.\r\n * // NOTE: each BinaryPacket needs an unique ID, for identification purposes and error checking.\r\n * const BoardPacket = BinaryPacket.define(1, Board)\r\n *\r\n * // And use it.\r\n * const buffer = BoardPacket.writeNodeBuffer({\r\n *  numPlayers: 1,\r\n *  cells: [\r\n *    { x: 0, y: 0 },\r\n *    { x: 1, y: 1 }\r\n *  ]\r\n * })\r\n *\r\n * // sendTheBufferOver(buffer)\r\n * // ...\r\n * // const buffer = receiveTheBuffer()\r\n * const board = BoardPacket.readNodeBuffer(buffer)\r\n * // ...\r\n */\r\nexport type Definition = {\r\n  [fieldName: string]:\r\n    | MaybeArray<Field>\r\n    | MaybeArray<BinaryPacket<Definition>>\r\n    | { flags: BitFlags }\r\n}\r\n\r\ntype MaybeArray<T> = T | [itemType: T] | [itemType: T, length: number]\r\n\r\ntype BitFlagsToJson<FlagsArray extends BitFlags> = {\r\n  [key in FlagsArray[number]]: boolean\r\n}\r\n\r\n/**\r\n * Meta-type that converts a `Definition` schema to the type of the actual JavaScript object that will be written into a packet or read from. \\\r\n */\r\nexport type ToJson<T extends Definition> = {\r\n  [K in keyof T]: T[K] extends [infer Item]\r\n    ? Item extends BinaryPacket<infer BPDef>\r\n      ? ToJson<BPDef>[]\r\n      : number[]\r\n    : T[K] extends [infer Item, infer Length]\r\n      ? Item extends BinaryPacket<infer BPDef>\r\n        ? ToJson<BPDef>[] & { length: Length }\r\n        : number[] & { length: Length }\r\n      : T[K] extends BinaryPacket<infer BPDef>\r\n        ? ToJson<BPDef>\r\n        : T[K] extends { flags: infer FlagsArray extends BitFlags }\r\n          ? BitFlagsToJson<FlagsArray>\r\n          : number\r\n}\r\n\r\n/**\r\n * In a JavaScript object, the order of its keys is not strictly defined: sort them by field name. \\\r\n * Thus, we cannot trust iterating over an object keys: we MUST iterate over its entries array. \\\r\n * This is important to make sure that whoever shares BinaryPacket definitions can correctly write/read packets independently of their JS engines.\r\n */\r\nfunction sortEntries(definition: Definition) {\r\n  return Object.entries(definition).sort(([fieldName1], [fieldName2]) =>\r\n    fieldName1.localeCompare(fieldName2)\r\n  )\r\n}\r\n\r\ntype Entries = ReturnType<typeof sortEntries>\r\n\r\n/**\r\n * Helper function that \"inspects\" the entries of a BinaryPacket definition\r\n * and returns useful \"stats\" needed for writing and reading buffers.\r\n *\r\n * This function is ever called only once per BinaryPacket definition.\r\n */\r\nfunction inspectEntries(entries: Entries) {\r\n  // The PacketID is already 1 byte, that's why we aren't starting from 0.\r\n  let minimumByteLength = 1\r\n  let canFastWrite = true\r\n\r\n  for (const [, type] of entries) {\r\n    if (Array.isArray(type)) {\r\n      if (type.length === 2) {\r\n        // Statically-sized array\r\n        const itemSize =\r\n          typeof type[0] === 'object' ? type[0].minimumByteLength : BYTE_SIZE[type[0]]\r\n\r\n        minimumByteLength += type[1] * itemSize\r\n      } else {\r\n        // Dynamically-sized array\r\n        // Adding 1 byte to serialize the array length\r\n        minimumByteLength += 1\r\n        canFastWrite = false\r\n      }\r\n    } else if (type instanceof BinaryPacket) {\r\n      minimumByteLength += type.minimumByteLength\r\n      canFastWrite &&= type.canFastWrite\r\n    } else if (typeof type === 'object') {\r\n      // BitFlags\r\n      // BitFlags are always 1 byte long, because they can hold up to 8 booleans\r\n      minimumByteLength += 1\r\n    } else {\r\n      minimumByteLength += BYTE_SIZE[type]\r\n    }\r\n  }\r\n\r\n  return { minimumByteLength, canFastWrite }\r\n}\r\n\r\n//////////////////////////////////////////////\r\n// The logic here is practically over       //\r\n// Here below there are needed constants    //\r\n// that map a field-type to a functionality //\r\n//////////////////////////////////////////////\r\n\r\nconst BYTE_SIZE = Array(8) as number[]\r\n\r\nBYTE_SIZE[Field.UNSIGNED_INT_8] = 1\r\nBYTE_SIZE[Field.INT_8] = 1\r\n\r\nBYTE_SIZE[Field.UNSIGNED_INT_16] = 2\r\nBYTE_SIZE[Field.INT_16] = 2\r\n\r\nBYTE_SIZE[Field.UNSIGNED_INT_32] = 4\r\nBYTE_SIZE[Field.INT_32] = 4\r\nBYTE_SIZE[Field.FLOAT_32] = 4\r\n\r\nBYTE_SIZE[Field.FLOAT_64] = 8\r\n\r\nconst GET_FUNCTION = Array(8) as ((view: DataView, offset: number) => number)[]\r\n\r\nGET_FUNCTION[Field.UNSIGNED_INT_8] = (view, offset) => view.getUint8(offset)\r\nGET_FUNCTION[Field.INT_8] = (view, offset) => view.getInt8(offset)\r\n\r\nGET_FUNCTION[Field.UNSIGNED_INT_16] = (view, offset) => view.getUint16(offset)\r\nGET_FUNCTION[Field.INT_16] = (view, offset) => view.getInt16(offset)\r\n\r\nGET_FUNCTION[Field.UNSIGNED_INT_32] = (view, offset) => view.getUint32(offset)\r\nGET_FUNCTION[Field.INT_32] = (view, offset) => view.getInt32(offset)\r\nGET_FUNCTION[Field.FLOAT_32] = (view, offset) => view.getFloat32(offset)\r\n\r\nGET_FUNCTION[Field.FLOAT_64] = (view, offset) => view.getFloat64(offset)\r\n\r\nconst SET_FUNCTION = Array(8) as ((view: DataView, value: number, offset: number) => void)[]\r\n\r\nSET_FUNCTION[Field.UNSIGNED_INT_8] = (view, value, offset) => view.setUint8(offset, value)\r\nSET_FUNCTION[Field.INT_8] = (view, value, offset) => view.setInt8(offset, value)\r\n\r\nSET_FUNCTION[Field.UNSIGNED_INT_16] = (view, value, offset) => view.setUint16(offset, value)\r\nSET_FUNCTION[Field.INT_16] = (view, value, offset) => view.setInt16(offset, value)\r\n\r\nSET_FUNCTION[Field.UNSIGNED_INT_32] = (view, value, offset) => view.setUint32(offset, value)\r\nSET_FUNCTION[Field.INT_32] = (view, value, offset) => view.setInt32(offset, value)\r\nSET_FUNCTION[Field.FLOAT_32] = (view, value, offset) => view.setFloat32(offset, value)\r\n\r\nSET_FUNCTION[Field.FLOAT_64] = (view, value, offset) => view.setFloat64(offset, value)\r\n\r\nconst SET_FUNCTION_BUF = Array(8) as ((nodeBuffer: Buffer, value: number, offset: number) => void)[]\r\n\r\nif (hasNodeBuffers) {\r\n  SET_FUNCTION_BUF[Field.UNSIGNED_INT_8] = (view, value, offset) => view.writeUint8(value, offset)\r\n  SET_FUNCTION_BUF[Field.INT_8] = (view, value, offset) => view.writeInt8(value, offset)\r\n\r\n  SET_FUNCTION_BUF[Field.UNSIGNED_INT_16] = (view, value, offset) =>\r\n    view.writeUint16LE(value, offset)\r\n  SET_FUNCTION_BUF[Field.INT_16] = (view, value, offset) => view.writeInt16LE(value, offset)\r\n\r\n  SET_FUNCTION_BUF[Field.UNSIGNED_INT_32] = (view, value, offset) =>\r\n    view.writeUint32LE(value, offset)\r\n  SET_FUNCTION_BUF[Field.INT_32] = (view, value, offset) => view.writeInt32LE(value, offset)\r\n  SET_FUNCTION_BUF[Field.FLOAT_32] = (view, value, offset) => view.writeFloatLE(value, offset)\r\n\r\n  SET_FUNCTION_BUF[Field.FLOAT_64] = (view, value, offset) => view.writeDoubleLE(value, offset)\r\n}\r\n\r\nconst GET_FUNCTION_BUF = Array(8) as ((nodeBuffer: Buffer, offset: number) => number)[]\r\n\r\nif (hasNodeBuffers) {\r\n  GET_FUNCTION_BUF[Field.UNSIGNED_INT_8] = (view, offset) => view.readUint8(offset)\r\n  GET_FUNCTION_BUF[Field.INT_8] = (view, offset) => view.readInt8(offset)\r\n\r\n  GET_FUNCTION_BUF[Field.UNSIGNED_INT_16] = (view, offset) => view.readUint16LE(offset)\r\n  GET_FUNCTION_BUF[Field.INT_16] = (view, offset) => view.readInt16LE(offset)\r\n\r\n  GET_FUNCTION_BUF[Field.UNSIGNED_INT_32] = (view, offset) => view.readUint32LE(offset)\r\n  GET_FUNCTION_BUF[Field.INT_32] = (view, offset) => view.readInt32LE(offset)\r\n  GET_FUNCTION_BUF[Field.FLOAT_32] = (view, offset) => view.readFloatLE(offset)\r\n\r\n  GET_FUNCTION_BUF[Field.FLOAT_64] = (view, offset) => view.readDoubleLE(offset)\r\n}\r\n"],"mappings":"AAMO,IAAMA,EAAiB,OAAO,QAAW,WAEzC,SAASC,EAAaC,EAAoBC,EAAuB,CACtE,IAAMC,EAAgB,IAAI,YAAYD,CAAa,EAC7CE,EAAe,KAAK,IAAIH,EAAS,WAAYE,EAAc,UAAU,EAGvEE,EAAS,KAAK,MAAMD,EAAe,CAAC,EACxC,IAAI,aAAaD,EAAe,EAAGE,CAAM,EAAE,IAAI,IAAI,aAAaJ,EAAS,OAAQ,EAAGI,CAAM,CAAC,EAG3F,IAAMC,EAASD,EAAS,EACxB,OAAAA,EAASD,EAAeE,EACxB,IAAI,WAAWH,EAAeG,EAAQD,CAAM,EAAE,IAAI,IAAI,WAAWJ,EAAS,OAAQK,EAAQD,CAAM,CAAC,EAE1F,IAAI,SAASF,CAAa,CACnC,CAEO,SAASI,EAAeC,EAAgBN,EAAuB,CACpE,IAAMO,EAAY,OAAO,YAAYP,CAAa,EAClD,OAAAM,EAAO,KAAKC,CAAS,EACdA,CACT,CC1BO,IAAWC,OAKhBA,IAAA,eAAiB,GAAjB,iBAMAA,IAAA,qCAMAA,IAAA,qCAMAA,IAAA,iBAMAA,IAAA,mBAMAA,IAAA,mBAKAA,IAAA,uBAKAA,IAAA,uBA7CgBA,OAAA,IAwDX,SAASC,EAAuDC,EAAwB,CAC7F,MAAO,CAACA,CAAI,CACd,CASO,SAASC,EACdD,EACAE,EAC+B,CAC/B,GAAIA,EAAS,GAAK,CAAC,OAAO,SAASA,CAAM,EACvC,MAAM,IAAI,WAAW,oDAAoD,EAG3E,MAAO,CAACF,EAAME,CAAM,CACtB,CAaO,SAASC,EAAiDC,EAAmB,CAClF,GAAIA,EAAM,OAAS,EACjB,MAAM,IAAI,MACR,yFAAyFA,EAAM,KAAK,IAAI,CAAC,EAC3G,EAGF,MAAO,CAAE,MAAAA,CAAM,CACjB,CAQO,IAAMC,EAAN,MAAMC,CAAmC,CAmMtC,YACWC,EACjBC,EACA,CAFiB,cAAAD,EAGjB,KAAK,QAAUC,EAAaC,EAAYD,CAAU,EAAI,CAAC,EACvD,IAAME,EAAaC,EAAe,KAAK,OAAO,EAE9C,KAAK,kBAAoBD,EAAW,kBACpC,KAAK,aAAeA,EAAW,YACjC,CAtMA,OAAO,OAA6BH,EAAkBC,EAAgB,CACpE,GAAID,EAAW,GAAK,CAAC,OAAO,SAASA,CAAQ,EAC3C,MAAM,IAAI,WAAW,uCAAuC,EAG9D,GAAIA,EAAW,IACb,MAAM,IAAI,WACR,6GACF,EAGF,OAAO,IAAID,EAAaC,EAAUC,CAAU,CAC9C,CAOA,OAAO,uBAAuBI,EAAgBC,EAAa,EAAG,CAC5D,OAAOD,EAAO,UAAUC,CAAU,CACpC,CAOA,OAAO,qBAAqBC,EAAoBD,EAAa,EAAG,CAC9D,OAAOC,EAAS,SAASD,CAAU,CACrC,CAUA,OAAO,wBAAwBE,EAA8BF,EAAoB,CAC/E,OAAO,IAAI,WAAWE,EAAaF,EAAY,CAAC,EAAE,CAAC,CACrD,CAQA,OAAO,gBAAgBD,KAAmBI,EAAqB,CAC7D,OAAOV,EAAa,MAAMM,EAAQK,EAAkBD,CAAQ,CAC9D,CAQA,OAAO,cAAcF,KAAuBE,EAAqB,CAC/D,OAAOV,EAAa,MAAMQ,EAAUI,EAAcF,CAAQ,CAC5D,CAUA,OAAO,iBACLD,EACAF,EACAM,KACGH,EACH,CACA,OAAOV,EAAa,MAClB,IAAI,SAASS,EAAaF,EAAYM,CAAU,EAChDD,EACAF,CACF,CACF,CAWA,eACEI,EACAC,EAAgB,CAAE,OAAQ,CAAE,EAC5BF,EAAaC,EAAO,WACT,CACX,OAAO,KAAK,KAAKA,EAAQC,EAAeF,EAAYF,CAAgB,CACtE,CAQA,aACEG,EACAC,EAAgB,CAAE,OAAQ,CAAE,EAC5BF,EAAaC,EAAO,WACT,CACX,OAAO,KAAK,KAAKA,EAAQC,EAAeF,EAAYD,CAAY,CAClE,CAaA,gBAAgBE,EAAyBP,EAAoBM,EAAoB,CAC/E,OAAO,KAAK,KACVG,EACI,OAAO,KAAKF,EAAQP,EAAYM,CAAU,EAC1C,IAAI,SAASC,EAAQP,EAAYM,CAAU,EAC/C,CAAE,OAAQ,CAAE,EACZA,EACAG,EAAiBL,EAAmBC,CACtC,CACF,CAQA,gBAAgBK,EAAoB,CAClC,IAAMX,EAAS,OAAO,YAAY,KAAK,iBAAiB,EACxD,OAAO,KAAK,MAAMA,EAAQW,EAAS,CAAE,OAAQ,CAAE,EAAGC,EAAkBC,CAAc,CACpF,CAKA,cAAcF,EAAoB,CAChC,IAAMT,EAAW,IAAI,SAAS,IAAI,YAAY,KAAK,iBAAiB,CAAC,EACrE,OAAO,KAAK,MAAMA,EAAUS,EAAS,CAAE,OAAQ,CAAE,EAAGG,EAAcC,CAAY,CAChF,CAYA,iBAAiBJ,EAAoB,CACnC,IAAMK,EAAMN,EAAiB,KAAK,gBAAgBC,CAAO,EAAI,KAAK,cAAcA,CAAO,EACvF,MAAO,CAAE,OAAQK,EAAI,OAAQ,WAAYA,EAAI,WAAY,WAAYA,EAAI,UAAW,CACtF,CASA,QAAQC,EAA+C,CACrD,MAAO,CAAC,KAAMA,CAAO,CACvB,CAIiB,QACR,aACA,kBAaT,OAAe,MACbT,EACAU,EACAd,EACA,CACA,OAAW,CAACe,EAAQF,CAAO,IAAKb,EAC9B,GAAIe,EAAO,WAAaD,EAAc,CAAoB,EAAEV,EAAe,CAAC,EAC1E,OAAOS,EAAQE,EAAO,KAAKX,EAAQ,CAAE,OAAQ,CAAE,EAAGA,EAAO,WAAYU,CAAa,CAAC,CAGzF,CAEQ,KACNV,EACAC,EACAF,EACAW,EACW,CACX,GAAIX,EAAaE,EAAc,OAAS,KAAK,kBAC3C,MAAM,IAAI,MACR,uDAAuD,KAAK,QAAQ,cAAcA,EAAc,MAAM,EACxG,EAGF,GACES,EAAc,CAAoB,EAAEV,EAAeC,EAAc,MAAM,IAAM,KAAK,SAElF,MAAM,IAAI,MACR,kBAAkBA,EAAc,MAAM,4BAA4B,KAAK,QAAQ,EACjF,EAGFA,EAAc,QAAU,EACxB,IAAMW,EAAc,CAAC,EAErB,OAAW,CAACC,EAAMC,CAAG,IAAK,KAAK,QAC7B,GAAI,MAAM,QAAQA,CAAG,EAAG,CACtB,IAAMhC,EAEJgC,EAAI,CAAC,GAAKJ,EAAc,CAAoB,EAAEV,EAAeC,EAAc,QAAQ,EAE/Ec,EAAQ,MAAMjC,CAAM,EAEpBkC,EAAWF,EAAI,CAAC,EAEtB,GAAI,OAAOE,GAAa,SAEtB,QAASC,EAAI,EAAGA,EAAInC,EAAQ,EAAEmC,EAC5BF,EAAME,CAAC,EAAID,EAAS,KAAKhB,EAAQC,EAAeF,EAAYW,CAAa,MAEtE,CAEL,IAAMQ,EAAWC,EAAUH,CAAQ,EAInC,QAASC,EAAI,EAAGA,EAAInC,EAAQ,EAAEmC,EAC5BF,EAAME,CAAC,EAAIP,EAAcM,CAAQ,EAAEhB,EAAeC,EAAc,MAAM,EACtEA,EAAc,QAAUiB,CAE5B,CAGAN,EAAOC,CAAI,EAAIE,CACjB,SAAW,OAAOD,GAAQ,SAGxBF,EAAOC,CAAI,EAAIH,EAAcI,CAAG,EAAEd,EAAeC,EAAc,MAAM,EACrEA,EAAc,QAAUkB,EAAUL,CAAG,UAC5B,UAAWA,EAAK,CAEzB,IAAM9B,EAAQ0B,EAAc,CAAoB,EAAEV,EAAeC,EAAc,MAAM,EACrFA,EAAc,QAAU,EAGxBW,EAAOC,CAAI,EAAI,CAAC,EAEhB,QAASO,EAAM,EAAGA,EAAMN,EAAI,MAAM,OAAQ,EAAEM,EAE1CR,EAAOC,CAAI,EAAEC,EAAI,MAAMM,CAAG,CAAC,EAAI,CAAC,EAAEpC,EAAS,GAAKoC,EAEpD,MAGER,EAAOC,CAAI,EAAIC,EAAI,KAAKd,EAAQC,EAAeF,EAAYW,CAAa,EAI5E,OAAOE,CACT,CAEQ,MACNpB,EACAW,EACAF,EACAoB,EACAC,EACK,CAIL,OAHAD,EAAe,CAAoB,EAAE7B,EAAe,KAAK,SAAUS,EAAc,MAAM,EACvFA,EAAc,QAAU,EAEpB,KAAK,cAGP,KAAK,UAAUT,EAAQW,EAASF,EAAeoB,CAAc,EACtD7B,GAIA,KAAK,UACVA,EACAW,EACAF,EACA,KAAK,kBACL,KAAK,kBACLoB,EACAC,CACF,CAEJ,CAKQ,UACN9B,EACAW,EACAF,EACAoB,EACA,CACA,OAAW,CAACR,EAAMC,CAAG,IAAK,KAAK,QAAS,CACtC,IAAMS,EAAOpB,EAAQU,CAAI,EAEzB,GAAI,MAAM,QAAQC,CAAG,EAAG,CAEtB,IAAME,EAAWF,EAAI,CAAC,EAChBhC,EAASgC,EAAI,CAAC,EAEpB,GAAI,OAAOE,GAAa,SACtB,QAASC,EAAI,EAAGA,EAAInC,EAAQ,EAAEmC,EAC5BD,EAAS,UACPxB,EACC+B,EAAeN,CAAC,EACjBhB,EACAoB,CACF,MAEG,CACL,IAAMH,EAAWC,EAAUH,CAAQ,EAEnC,QAASC,EAAI,EAAGA,EAAInC,EAAQ,EAAEmC,EAC5BI,EAAeL,CAAQ,EAAExB,EAAgB+B,EAAkBN,CAAC,EAAGhB,EAAc,MAAM,EACnFA,EAAc,QAAUiB,CAE5B,CACF,SAAW,OAAOJ,GAAQ,SAExBO,EAAeP,CAAG,EAAEtB,EAAe+B,EAAgBtB,EAAc,MAAM,EACvEA,EAAc,QAAUkB,EAAUL,CAAG,UAC5B,UAAWA,EAAK,CAEzB,IAAI9B,EAAQ,EAEZ,QAASoC,EAAM,EAAGA,EAAMN,EAAI,MAAM,OAAQ,EAAEM,EACrCG,EAAiCT,EAAI,MAAMM,CAAG,CAAC,IAClDpC,GAAS,GAAKoC,GAIlBC,EAAe,CAAoB,EAAE7B,EAAeR,EAAOiB,EAAc,MAAM,EAC/EA,EAAc,QAAU,CAC1B,MAGEa,EAAI,UAAUtB,EAAQ+B,EAA4BtB,EAAeoB,CAAc,CAEnF,CACF,CAMQ,UACN7B,EACAW,EACAF,EACAF,EACAyB,EACAH,EACAC,EACK,CACL,OAAW,CAACT,EAAMC,CAAG,IAAK,KAAK,QAAS,CACtC,IAAMS,EAAOpB,EAAQU,CAAI,EAEzB,GAAI,MAAM,QAAQC,CAAG,EAAG,CAGtB,IAAMhC,EAAUyC,EAAe,OACzBE,EAAiBX,EAAI,CAAC,IAAM,OASlC,GALIW,IACFJ,EAAe,CAAoB,EAAE7B,EAAeV,EAAQmB,EAAc,MAAM,EAChFA,EAAc,QAAU,GAGtBnB,EAAS,EAAG,CACd,IAAMkC,EAAWF,EAAI,CAAC,EAEtB,GAAI,OAAOE,GAAa,SAAU,CAGhC,GAAIS,EAAgB,CAClB,IAAMC,EAAyB5C,EAASkC,EAAS,kBAEjDjB,GAAc2B,EACdF,GAAiBE,EAEblC,EAAO,WAAagC,IACtBhC,EAAS8B,EAAmB9B,EAAQgC,CAAa,EAErD,CAEA,QAAWG,KAAUJ,EACnBF,EAAe,CAAoB,EACjC7B,EACAwB,EAAS,SACTf,EAAc,MAChB,EAEAA,EAAc,QAAU,EAExBT,EAASwB,EAAS,UAChBxB,EACAmC,EACA1B,EACAF,EACAyB,EACAH,EACAC,CACF,EAEAvB,EAAaE,EAAc,OAC3BuB,EAAgBhC,EAAO,UAE3B,KAAO,CAEL,IAAM0B,EAAWC,EAAUH,CAAQ,EAEnC,GAAIS,EAAgB,CAClB,IAAMC,EAAyB5C,EAASoC,EAExCnB,GAAc2B,EACdF,GAAiBE,EAEblC,EAAO,WAAagC,IACtBhC,EAAS8B,EAAmB9B,EAAQgC,CAAa,EAErD,CAIA,QAAWI,KAAUL,EACnBF,EAAeL,CAAQ,EAAExB,EAAeoC,EAAQ3B,EAAc,MAAM,EACpEA,EAAc,QAAUiB,CAE5B,CACF,CACF,SAAW,OAAOJ,GAAQ,SAExBO,EAAeP,CAAG,EAAEtB,EAAe+B,EAAgBtB,EAAc,MAAM,EACvEA,EAAc,QAAUkB,EAAUL,CAAG,UAC5B,UAAWA,EAAK,CAEzB,IAAI9B,EAAQ,EAEZ,QAASoC,EAAM,EAAGA,EAAMN,EAAI,MAAM,OAAQ,EAAEM,EACrCG,EAAiCT,EAAI,MAAMM,CAAG,CAAC,IAClDpC,GAAS,GAAKoC,GAIlBC,EAAe,CAAoB,EAAE7B,EAAeR,EAAOiB,EAAc,MAAM,EAC/EA,EAAc,QAAU,CAC1B,MAEEoB,EAAe,CAAoB,EAAE7B,EAAesB,EAAI,SAAUb,EAAc,MAAM,EACtFA,EAAc,QAAU,EAExBT,EAASsB,EAAI,UACXtB,EACA+B,EACAtB,EACAF,EACAyB,EACAH,EACAC,CACF,EAEAvB,EAAaE,EAAc,OAC3BuB,EAAgBhC,EAAO,UAE3B,CAEA,OAAOA,CACT,CACF,EAkFA,SAASH,EAAYD,EAAwB,CAC3C,OAAO,OAAO,QAAQA,CAAU,EAAE,KAAK,CAAC,CAACyC,CAAU,EAAG,CAACC,CAAU,IAC/DD,EAAW,cAAcC,CAAU,CACrC,CACF,CAUA,SAASvC,EAAewC,EAAkB,CAExC,IAAIC,EAAoB,EACpBC,EAAe,GAEnB,OAAW,CAAC,CAAEC,CAAI,IAAKH,EACrB,GAAI,MAAM,QAAQG,CAAI,EACpB,GAAIA,EAAK,SAAW,EAAG,CAErB,IAAMhB,EACJ,OAAOgB,EAAK,CAAC,GAAM,SAAWA,EAAK,CAAC,EAAE,kBAAoBf,EAAUe,EAAK,CAAC,CAAC,EAE7EF,GAAqBE,EAAK,CAAC,EAAIhB,CACjC,MAGEc,GAAqB,EACrBC,EAAe,QAERC,aAAgBjD,GACzB+C,GAAqBE,EAAK,kBAC1BD,IAAiBC,EAAK,cACb,OAAOA,GAAS,SAGzBF,GAAqB,EAErBA,GAAqBb,EAAUe,CAAI,EAIvC,MAAO,CAAE,kBAAAF,EAAmB,aAAAC,CAAa,CAC3C,CAQA,IAAMd,EAAY,MAAM,CAAC,EAEzBA,EAAU,CAAoB,EAAI,EAClCA,EAAU,CAAW,EAAI,EAEzBA,EAAU,CAAqB,EAAI,EACnCA,EAAU,CAAY,EAAI,EAE1BA,EAAU,CAAqB,EAAI,EACnCA,EAAU,CAAY,EAAI,EAC1BA,EAAU,CAAc,EAAI,EAE5BA,EAAU,CAAc,EAAI,EAE5B,IAAMrB,EAAe,MAAM,CAAC,EAE5BA,EAAa,CAAoB,EAAI,CAACqC,EAAMC,IAAWD,EAAK,SAASC,CAAM,EAC3EtC,EAAa,CAAW,EAAI,CAACqC,EAAMC,IAAWD,EAAK,QAAQC,CAAM,EAEjEtC,EAAa,CAAqB,EAAI,CAACqC,EAAMC,IAAWD,EAAK,UAAUC,CAAM,EAC7EtC,EAAa,CAAY,EAAI,CAACqC,EAAMC,IAAWD,EAAK,SAASC,CAAM,EAEnEtC,EAAa,CAAqB,EAAI,CAACqC,EAAMC,IAAWD,EAAK,UAAUC,CAAM,EAC7EtC,EAAa,CAAY,EAAI,CAACqC,EAAMC,IAAWD,EAAK,SAASC,CAAM,EACnEtC,EAAa,CAAc,EAAI,CAACqC,EAAMC,IAAWD,EAAK,WAAWC,CAAM,EAEvEtC,EAAa,CAAc,EAAI,CAACqC,EAAMC,IAAWD,EAAK,WAAWC,CAAM,EAEvE,IAAM9B,EAAe,MAAM,CAAC,EAE5BA,EAAa,CAAoB,EAAI,CAAC6B,EAAME,EAAOD,IAAWD,EAAK,SAASC,EAAQC,CAAK,EACzF/B,EAAa,CAAW,EAAI,CAAC6B,EAAME,EAAOD,IAAWD,EAAK,QAAQC,EAAQC,CAAK,EAE/E/B,EAAa,CAAqB,EAAI,CAAC6B,EAAME,EAAOD,IAAWD,EAAK,UAAUC,EAAQC,CAAK,EAC3F/B,EAAa,CAAY,EAAI,CAAC6B,EAAME,EAAOD,IAAWD,EAAK,SAASC,EAAQC,CAAK,EAEjF/B,EAAa,CAAqB,EAAI,CAAC6B,EAAME,EAAOD,IAAWD,EAAK,UAAUC,EAAQC,CAAK,EAC3F/B,EAAa,CAAY,EAAI,CAAC6B,EAAME,EAAOD,IAAWD,EAAK,SAASC,EAAQC,CAAK,EACjF/B,EAAa,CAAc,EAAI,CAAC6B,EAAME,EAAOD,IAAWD,EAAK,WAAWC,EAAQC,CAAK,EAErF/B,EAAa,CAAc,EAAI,CAAC6B,EAAME,EAAOD,IAAWD,EAAK,WAAWC,EAAQC,CAAK,EAErF,IAAMjC,EAAmB,MAAM,CAAC,EAE5BF,IACFE,EAAiB,CAAoB,EAAI,CAAC+B,EAAME,EAAOD,IAAWD,EAAK,WAAWE,EAAOD,CAAM,EAC/FhC,EAAiB,CAAW,EAAI,CAAC+B,EAAME,EAAOD,IAAWD,EAAK,UAAUE,EAAOD,CAAM,EAErFhC,EAAiB,CAAqB,EAAI,CAAC+B,EAAME,EAAOD,IACtDD,EAAK,cAAcE,EAAOD,CAAM,EAClChC,EAAiB,CAAY,EAAI,CAAC+B,EAAME,EAAOD,IAAWD,EAAK,aAAaE,EAAOD,CAAM,EAEzFhC,EAAiB,CAAqB,EAAI,CAAC+B,EAAME,EAAOD,IACtDD,EAAK,cAAcE,EAAOD,CAAM,EAClChC,EAAiB,CAAY,EAAI,CAAC+B,EAAME,EAAOD,IAAWD,EAAK,aAAaE,EAAOD,CAAM,EACzFhC,EAAiB,CAAc,EAAI,CAAC+B,EAAME,EAAOD,IAAWD,EAAK,aAAaE,EAAOD,CAAM,EAE3FhC,EAAiB,CAAc,EAAI,CAAC+B,EAAME,EAAOD,IAAWD,EAAK,cAAcE,EAAOD,CAAM,GAG9F,IAAMvC,EAAmB,MAAM,CAAC,EAE5BK,IACFL,EAAiB,CAAoB,EAAI,CAACsC,EAAMC,IAAWD,EAAK,UAAUC,CAAM,EAChFvC,EAAiB,CAAW,EAAI,CAACsC,EAAMC,IAAWD,EAAK,SAASC,CAAM,EAEtEvC,EAAiB,CAAqB,EAAI,CAACsC,EAAMC,IAAWD,EAAK,aAAaC,CAAM,EACpFvC,EAAiB,CAAY,EAAI,CAACsC,EAAMC,IAAWD,EAAK,YAAYC,CAAM,EAE1EvC,EAAiB,CAAqB,EAAI,CAACsC,EAAMC,IAAWD,EAAK,aAAaC,CAAM,EACpFvC,EAAiB,CAAY,EAAI,CAACsC,EAAMC,IAAWD,EAAK,YAAYC,CAAM,EAC1EvC,EAAiB,CAAc,EAAI,CAACsC,EAAMC,IAAWD,EAAK,YAAYC,CAAM,EAE5EvC,EAAiB,CAAc,EAAI,CAACsC,EAAMC,IAAWD,EAAK,aAAaC,CAAM","names":["hasNodeBuffers","growDataView","dataview","newByteLength","resizedBuffer","amountToCopy","length","offset","growNodeBuffer","buffer","newBuffer","Field","FieldArray","item","FieldFixedArray","length","FieldBitFlags","flags","BinaryPacket","_BinaryPacket","packetId","definition","sortEntries","inspection","inspectEntries","buffer","byteOffset","dataview","arraybuffer","visitors","GET_FUNCTION_BUF","GET_FUNCTION","byteLength","dataIn","offsetPointer","hasNodeBuffers","dataOut","SET_FUNCTION_BUF","growNodeBuffer","SET_FUNCTION","growDataView","buf","onVisit","readFunctions","Packet","result","name","def","array","itemType","i","itemSize","BYTE_SIZE","bit","writeFunctions","growBufferFunction","data","maxByteLength","isDynamicArray","neededBytesForElements","object","number","fieldName1","fieldName2","entries","minimumByteLength","canFastWrite","type","view","offset","value"]}

package/package.json

@@ -1,62 +1,63 @@
-{
-  "name": "binary-packet",
-  "version": "1.0.6",
-  "description": "Lightweight and hyper-fast, zero-dependencies, TypeScript-first, schema-based binary packets serialization and deserialization library",
-  "main": "./dist/index.js",
-  "module": "./dist/index.mjs",
-  "types": "./dist/index.d.ts",
-  "files": [
-    "dist"
-  ],
-  "scripts": {
-    "build": "tsup",
-    "test": "node -r ts-node/register/transpile-only src/tests/reads.test.ts && node -r ts-node/register/transpile-only src/tests/writes.test.ts",
-    "benchmark": "node -r ts-node/register/transpile-only src/tests/benchmark.test.ts",
-    "lint": "eslint"
-  },
-  "keywords": [
-    "binary-packet",
-    "binary packet",
-    "silence-cloud",
-    "binary",
-    "bytes",
-    "struct",
-    "schema",
-    "serialize",
-    "deserialize",
-    "encode",
-    "decode",
-    "packer",
-    "unpacker",
-    "packet",
-    "message",
-    "data",
-    "fast",
-    "lightweight",
-    "efficient",
-    "buffer",
-    "arraybuffer",
-    "dataview"
-  ],
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/silence-cloud-com/binary-packet.git"
-  },
-  "author": "silence-cloud.com",
-  "license": "Apache-2.0",
-  "devDependencies": {
-    "colors": "^1.4.0",
-    "eslint": "^9.12.0",
-    "msgpackr": "^1.11.0",
-    "prettier": "^3.3.3",
-    "prettier-plugin-organize-imports": "^4.1.0",
-    "restructure": "^3.0.2",
-    "ts-node": "^10.9.2",
-    "tsup": "^8.3.0",
-    "typescript": "^5.6.2",
-    "typescript-eslint": "^8.8.1"
-  },
-  "engines": {
-    "node": ">=16"
-  }
-}
+{
+  "name": "binary-packet",
+  "version": "1.0.8",
+  "description": "Lightweight and hyper-fast, zero-dependencies, TypeScript-first, schema-based binary packets serialization and deserialization library",
+  "main": "./dist/index.js",
+  "module": "./dist/index.mjs",
+  "types": "./dist/index.d.ts",
+  "files": [
+    "dist"
+  ],
+  "scripts": {
+    "build": "tsup",
+    "test": "node -r ts-node/register/transpile-only src/tests/reads.test.ts && node -r ts-node/register/transpile-only src/tests/writes.test.ts && node -r ts-node/register/transpile-only src/tests/visitors.test.ts",
+    "benchmark": "node -r ts-node/register/transpile-only src/tests/benchmark.test.ts",
+    "lint": "eslint"
+  },
+  "keywords": [
+    "binary-packet",
+    "binary packet",
+    "silence-cloud",
+    "binary",
+    "bytes",
+    "struct",
+    "schema",
+    "bitflags",
+    "serialize",
+    "deserialize",
+    "encode",
+    "decode",
+    "packer",
+    "unpacker",
+    "packet",
+    "message",
+    "data",
+    "fast",
+    "lightweight",
+    "efficient",
+    "buffer",
+    "arraybuffer",
+    "dataview"
+  ],
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/silence-cloud-com/binary-packet.git"
+  },
+  "author": "silence-cloud.com",
+  "license": "Apache-2.0",
+  "devDependencies": {
+    "colors": "^1.4.0",
+    "eslint": "^9.12.0",
+    "msgpackr": "^1.11.0",
+    "prettier": "^3.3.3",
+    "prettier-plugin-organize-imports": "^4.1.0",
+    "restructure": "^3.0.2",
+    "ts-node": "^10.9.2",
+    "tsup": "^8.3.0",
+    "typescript": "^5.6.2",
+    "typescript-eslint": "^8.8.1"
+  },
+  "engines": {
+    "node": ">=16"
+  }
+}