murow 0.0.1 → 0.0.3

package/README.md

@@ -35,7 +35,7 @@ import { FixedTicker } from 'murow/core';
 - `generateId`: Cryptographically secure ID generation
 - `lerp`: Linear interpolation utility
 - `NavMesh`: Pathfinding with dynamic obstacles
-- `PooledCodec`: Object-pooled binary codec
+- `PooledCodec`: Object-pooled binary codec with array support (via `PooledCodec.array()`) for efficient snapshot encoding. Supports zero-copy encoding with `encodeInto()` for minimal allocations
 - `IntentTracker` & `Reconciliator`: Client-side prediction
 
 ### Protocol Layer
@@ -49,6 +49,20 @@ Works harmoniously with core utilities (`FixedTicker`, `IntentTracker`, `Reconci
 
 See [Protocol Layer Documentation](./src/protocol/README.md) for usage.
 
+### Network Layer
+Transport-agnostic client/server abstractions:
+- `ServerNetwork`: Multiplayer game server with per-peer snapshot registries
+- `ClientNetwork`: Game client with intent/snapshot handling
+- `TransportAdapter`: Pluggable transport interface
+- `BunWebSocketTransport`: Bun WebSocket implementation (reference)
+
+Key features:
+- **Per-peer snapshot registries** for fog of war and interest management
+- **Transport agnostic** - works with WebSocket, WebRTC, UDP, etc.
+- **Type-safe** protocol integration with `IntentRegistry` and `SnapshotRegistry`
+
+See [Network Layer Documentation](./src/net/README.md) for usage and [examples/multiplayer-game.ts](./examples/multiplayer-game.ts) for a complete example.
+
 ## Building
 
 ```bash

package/dist/core/binary-codec/binary-codec.d.ts

@@ -146,8 +146,38 @@ export declare class BinaryCodec extends BaseBinaryCodec {
     static readonly u8: Field<number>;
     /** Unsigned 16-bit integer field */
     static readonly u16: Field<number>;
+    /** Unsigned 32-bit integer field */
+    static readonly u32: Field<number>;
+    /** Signed 8-bit integer field */
+    static readonly i8: Field<number>;
+    /** Signed 16-bit integer field */
+    static readonly i16: Field<number>;
+    /** Signed 32-bit integer field */
+    static readonly i32: Field<number>;
     /** 32-bit floating point field */
     static readonly f32: Field<number>;
+    /** Boolean field */
+    static readonly bool: Field<boolean>;
+    /** String field with length prefix */
+    static string: typeof BinaryPrimitives.string;
+    /** 2D vector field */
+    static readonly vec2: Field<{
+        x: number;
+        y: number;
+    }>;
+    /** 3D vector field */
+    static readonly vec3: Field<{
+        x: number;
+        y: number;
+        z: number;
+    }>;
+    /** RGBA color field */
+    static readonly color: Field<{
+        r: number;
+        g: number;
+        b: number;
+        a: number;
+    }>;
     /**
      * Encodes an object into a binary buffer.
      */

package/dist/core/binary-codec/binary-codec.js

@@ -332,5 +332,23 @@ export class BinaryCodec extends BaseBinaryCodec {
 BinaryCodec.u8 = BinaryPrimitives.u8;
 /** Unsigned 16-bit integer field */
 BinaryCodec.u16 = BinaryPrimitives.u16;
+/** Unsigned 32-bit integer field */
+BinaryCodec.u32 = BinaryPrimitives.u32;
+/** Signed 8-bit integer field */
+BinaryCodec.i8 = BinaryPrimitives.i8;
+/** Signed 16-bit integer field */
+BinaryCodec.i16 = BinaryPrimitives.i16;
+/** Signed 32-bit integer field */
+BinaryCodec.i32 = BinaryPrimitives.i32;
 /** 32-bit floating point field */
 BinaryCodec.f32 = BinaryPrimitives.f32;
+/** Boolean field */
+BinaryCodec.bool = BinaryPrimitives.bool;
+/** String field with length prefix */
+BinaryCodec.string = BinaryPrimitives.string;
+/** 2D vector field */
+BinaryCodec.vec2 = BinaryPrimitives.vec2;
+/** 3D vector field */
+BinaryCodec.vec3 = BinaryPrimitives.vec3;
+/** RGBA color field */
+BinaryCodec.color = BinaryPrimitives.color;

package/dist/core/pooled-codec/pooled-codec.d.ts

@@ -1,4 +1,35 @@
-import { Schema } from "../binary-codec";
+import { Schema, Field } from "../binary-codec";
+/**
+ * Type marker for array fields in schemas.
+ *
+ * ArrayField now implements both the Field interface (for use in schemas)
+ * and the Codec interface (for standalone use), making it versatile enough
+ * to be used directly with SnapshotRegistry or as a field in PooledCodec schemas.
+ */
+export type ArrayField<T> = {
+    __arrayType?: T[];
+    encode(items: T[]): Uint8Array;
+    decode(buf: Uint8Array): T[];
+    decodeField(buf: Uint8Array): {
+        value: T[];
+        bytesRead: number;
+    };
+    toNil(): T[];
+    calculateSize(items: T[]): number;
+    encodeInto(items: T[], buffer: Uint8Array, offset: number): number;
+};
+/**
+ * Extended schema type that supports both regular fields and array fields
+ */
+export type ExtendedSchema<T> = {
+    [K in keyof T]: T[K] extends any[] ? ArrayField<T[K][number]> : Field<T[K]>;
+};
+/**
+ * Infer the type from a schema definition
+ */
+type InferSchemaType<S> = {
+    [K in keyof S]: S[K] extends ArrayField<infer U> ? U[] : S[K] extends Field<infer V> ? V : unknown;
+};
 /**
  * Generic object pool for reusing objects and minimizing allocations.
  * @template T Type of objects stored in the pool.
@@ -108,33 +139,74 @@ export declare class PooledEncoder<T extends object> {
 /**
  * Combined pooled encoder and decoder for a single schema.
  * Provides a convenient wrapper around PooledEncoder and PooledDecoder.
- * @template T Type of object to encode/decode.
+ * @template S Schema type
  */
-export declare class PooledCodec<T extends object> {
+export declare class PooledCodec<S extends Record<string, any>> {
+    schema: S;
     /** Pooled encoder for the schema */
-    encoder: PooledEncoder<T>;
+    encoder: PooledEncoder<any>;
     /** Pooled decoder for the schema */
-    decoder: PooledDecoder<T>;
+    decoder: PooledDecoder<any>;
     /**
      * @param schema Schema describing the object structure.
-     * @param initial Initial object used as a template for pooling decoded objects.
      */
-    constructor(schema: Schema<T>);
+    constructor(schema: S);
+    /**
+     * Calculate the size in bytes needed to encode the data.
+     * @param data Object to calculate size for.
+     * @returns Size in bytes.
+     */
+    calculateSize(data: InferSchemaType<S>): number;
+    /**
+     * Encode an object directly into a target buffer at the given offset.
+     * This is a zero-copy operation - no intermediate buffers are allocated.
+     * @param data Object to encode.
+     * @param buffer Target buffer to write into.
+     * @param offset Byte offset in the buffer to start writing.
+     * @returns Number of bytes written.
+     */
+    encodeInto(data: InferSchemaType<S>, buffer: Uint8Array, offset: number): number;
     /**
      * Encode an object into a pooled buffer.
-     * @param {T} data Object to encode.
-     * @returns {Uint8Array} Encoded buffer.
+     * @param data Object to encode.
+     * @returns Encoded buffer.
      */
-    encode(data: T): Uint8Array<ArrayBufferLike>;
+    encode(data: InferSchemaType<S>): Uint8Array;
     /**
      * Decode a buffer into a pooled object.
-     * @param {Uint8Array} buf Buffer to decode.
-     * @returns {T} Decoded object.
+     * @param buf Buffer to decode.
+     * @returns Decoded object.
      */
-    decode(buf: Uint8Array): T;
+    decode(buf: Uint8Array): InferSchemaType<S>;
     /**
      * Release a decoded object back to the pool.
-     * @param {T} obj Object to release.
-     */
-    release(obj: T): void;
+     * @param obj Object to release.
+     */
+    release(obj: InferSchemaType<S>): void;
+    /**
+     * Creates an array field descriptor for use in schemas.
+     * Encodes array length as u16 followed by each item.
+     *
+     * @template U Type of items in the array
+     * @param itemSchema Schema for individual array items
+     * @returns An array field descriptor that can be used in PooledCodec schemas
+     *
+     * @example
+     * ```ts
+     * const PlayerSchema = {
+     *   entityId: BinaryPrimitives.u32,
+     *   x: BinaryPrimitives.f32,
+     *   y: BinaryPrimitives.f32,
+     * };
+     *
+     * const UpdateSchema = {
+     *   tick: BinaryPrimitives.u32,
+     *   players: PooledCodec.array(PlayerSchema),
+     * };
+     *
+     * const codec = new PooledCodec(UpdateSchema);
+     * ```
+     */
+    static array<U extends object>(itemSchema: Schema<U> | Record<string, any>): ArrayField<U>;
 }
+export {};

package/dist/core/pooled-codec/pooled-codec.js

@@ -70,16 +70,31 @@ export class PooledDecoder {
      * @param {T} target Object to write decoded data into.
      */
     decodeInto(buf, target) {
+        let offset = 0;
         for (const key of Object.keys(this.schema)) {
             const field = this.schema[key];
             if ("decodeAll" in field) {
-                target[key] = field.decodeAll(buf);
+                const result = field.decodeAll(buf.subarray(offset));
+                target[key] = result.value;
+                offset += result.bytesRead;
+            }
+            else if ("decodeField" in field) {
+                // Use decodeField for ArrayField (returns { value, bytesRead })
+                const result = field.decodeField(buf.subarray(offset));
+                target[key] = result.value;
+                offset += result.bytesRead;
             }
             else if ("decode" in field) {
-                target[key] = field.decode(buf);
+                const result = field.decode(buf.subarray(offset));
+                target[key] = result.value;
+                offset += result.bytesRead;
             }
             else {
-                BinaryCodec.decodeInto({ [key]: field }, buf, target);
+                // For primitive fields, calculate size and decode
+                const fieldSize = field.size || 0;
+                const fieldBuf = buf.subarray(offset, offset + fieldSize);
+                BinaryCodec.decodeInto({ [key]: field }, fieldBuf, target);
+                offset += fieldSize;
             }
         }
     }
@@ -176,38 +191,220 @@ export class PooledEncoder {
 /**
  * Combined pooled encoder and decoder for a single schema.
  * Provides a convenient wrapper around PooledEncoder and PooledDecoder.
- * @template T Type of object to encode/decode.
+ * @template S Schema type
  */
 export class PooledCodec {
     /**
      * @param schema Schema describing the object structure.
-     * @param initial Initial object used as a template for pooling decoded objects.
      */
     constructor(schema) {
+        this.schema = schema;
         this.encoder = new PooledEncoder(schema);
         this.decoder = new PooledDecoder(schema);
     }
+    /**
+     * Calculate the size in bytes needed to encode the data.
+     * @param data Object to calculate size for.
+     * @returns Size in bytes.
+     */
+    calculateSize(data) {
+        let size = 0;
+        for (const key of Object.keys(this.schema)) {
+            const field = this.schema[key];
+            if ("size" in field) {
+                // Fixed-size primitive field
+                size += field.size;
+            }
+            else if ("calculateSize" in field) {
+                // Variable-size field (like arrays)
+                size += field.calculateSize(data[key]);
+            }
+        }
+        return size;
+    }
+    /**
+     * Encode an object directly into a target buffer at the given offset.
+     * This is a zero-copy operation - no intermediate buffers are allocated.
+     * @param data Object to encode.
+     * @param buffer Target buffer to write into.
+     * @param offset Byte offset in the buffer to start writing.
+     * @returns Number of bytes written.
+     */
+    encodeInto(data, buffer, offset) {
+        const view = new DataView(buffer.buffer, buffer.byteOffset);
+        let currentOffset = offset;
+        for (const key of Object.keys(this.schema)) {
+            const field = this.schema[key];
+            if ("write" in field) {
+                // Primitive field - direct write
+                field.write(view, currentOffset, data[key]);
+                currentOffset += field.size;
+            }
+            else if ("encodeInto" in field) {
+                // Array or nested field - delegate to its encodeInto
+                const bytesWritten = field.encodeInto(data[key], buffer, currentOffset);
+                currentOffset += bytesWritten;
+            }
+            else if ("encode" in field) {
+                // Fallback for fields that only have encode()
+                const nested = field.encode(data[key]);
+                buffer.set(nested, currentOffset);
+                currentOffset += nested.length;
+            }
+        }
+        return currentOffset - offset; // bytes written
+    }
     /**
      * Encode an object into a pooled buffer.
-     * @param {T} data Object to encode.
-     * @returns {Uint8Array} Encoded buffer.
+     * @param data Object to encode.
+     * @returns Encoded buffer.
      */
     encode(data) {
         return this.encoder.encode(data);
     }
     /**
      * Decode a buffer into a pooled object.
-     * @param {Uint8Array} buf Buffer to decode.
-     * @returns {T} Decoded object.
+     * @param buf Buffer to decode.
+     * @returns Decoded object.
      */
     decode(buf) {
         return this.decoder.decode(buf);
     }
     /**
      * Release a decoded object back to the pool.
-     * @param {T} obj Object to release.
+     * @param obj Object to release.
      */
     release(obj) {
         this.decoder.release(obj);
     }
+    /**
+     * Creates an array field descriptor for use in schemas.
+     * Encodes array length as u16 followed by each item.
+     *
+     * @template U Type of items in the array
+     * @param itemSchema Schema for individual array items
+     * @returns An array field descriptor that can be used in PooledCodec schemas
+     *
+     * @example
+     * ```ts
+     * const PlayerSchema = {
+     *   entityId: BinaryPrimitives.u32,
+     *   x: BinaryPrimitives.f32,
+     *   y: BinaryPrimitives.f32,
+     * };
+     *
+     * const UpdateSchema = {
+     *   tick: BinaryPrimitives.u32,
+     *   players: PooledCodec.array(PlayerSchema),
+     * };
+     *
+     * const codec = new PooledCodec(UpdateSchema);
+     * ```
+     */
+    static array(itemSchema) {
+        // Calculate item size once
+        let itemSize = 0;
+        for (const key of Object.keys(itemSchema)) {
+            const field = itemSchema[key];
+            itemSize += field.size || 0;
+        }
+        // Pool for encoding buffers (larger initial size to avoid allocations)
+        const bufferPool = new ObjectPool(() => new Uint8Array(16384));
+        // Pool for decoded objects to avoid allocations
+        const objectPool = new ObjectPool(() => {
+            const obj = {};
+            for (const key of Object.keys(itemSchema)) {
+                const field = itemSchema[key];
+                obj[key] = ("toNil" in field ? field.toNil() : undefined);
+            }
+            return obj;
+        });
+        // Pool for result arrays to avoid allocations
+        const arrayPool = new ObjectPool(() => []);
+        // Reusable DataView for encoding
+        let encodeView = null;
+        // Reusable DataView for decoding
+        let decodeView = null;
+        return {
+            __arrayType: undefined,
+            calculateSize(items) {
+                return 2 + (items.length * itemSize);
+            },
+            encodeInto(items, buffer, offset) {
+                const view = new DataView(buffer.buffer, buffer.byteOffset);
+                // Write array length
+                view.setUint16(offset, items.length, false);
+                let currentOffset = offset + 2;
+                // Write each item directly into buffer
+                for (const item of items) {
+                    for (const key of Object.keys(itemSchema)) {
+                        const field = itemSchema[key];
+                        field.write(view, currentOffset, item[key]);
+                        currentOffset += field.size;
+                    }
+                }
+                return currentOffset - offset; // bytes written
+            },
+            encode(items) {
+                const totalSize = 2 + (items.length * itemSize);
+                let buffer = bufferPool.acquire();
+                // Grow buffer pool if needed (but keep the undersized buffer for next time)
+                if (buffer.length < totalSize) {
+                    bufferPool.release(buffer);
+                    buffer = new Uint8Array(Math.max(totalSize, buffer.length * 2));
+                }
+                // Create or reuse DataView for this buffer
+                if (!encodeView || encodeView.buffer !== buffer.buffer) {
+                    encodeView = new DataView(buffer.buffer, buffer.byteOffset);
+                }
+                // Write array length
+                encodeView.setUint16(0, items.length, false);
+                // Write each item directly into buffer (zero intermediate allocations)
+                let offset = 2;
+                for (const item of items) {
+                    for (const key of Object.keys(itemSchema)) {
+                        const field = itemSchema[key];
+                        field.write(encodeView, offset, item[key]);
+                        offset += field.size;
+                    }
+                }
+                // Create a copy to return (caller owns this memory)
+                const result = new Uint8Array(offset);
+                result.set(buffer.subarray(0, offset));
+                // Return buffer to pool
+                bufferPool.release(buffer);
+                return result;
+            },
+            decodeField(buf) {
+                // Read array length directly from buffer
+                const length = (buf[0] << 8) | buf[1];
+                // Acquire pooled array and resize if needed
+                const items = arrayPool.acquire();
+                items.length = length;
+                // Create or reuse DataView for reading
+                if (!decodeView || decodeView.buffer !== buf.buffer || decodeView.byteOffset !== buf.byteOffset) {
+                    decodeView = new DataView(buf.buffer, buf.byteOffset);
+                }
+                // Read each item using pooled objects
+                let offset = 2;
+                for (let i = 0; i < length; i++) {
+                    const item = objectPool.acquire();
+                    // Decode directly into pooled object
+                    for (const key of Object.keys(itemSchema)) {
+                        const field = itemSchema[key];
+                        item[key] = field.read(decodeView, offset);
+                        offset += field.size;
+                    }
+                    items[i] = item;
+                }
+                return { value: items, bytesRead: offset };
+            },
+            decode(buf) {
+                return this.decodeField(buf).value;
+            },
+            toNil() {
+                return [];
+            }
+        };
+    }
 }

package/dist/core/prediction/prediction.d.ts

@@ -5,7 +5,7 @@
  * Used for prediction and reconciliation in a server-authoritative architecture.
  */
 export declare class IntentTracker<T> {
-    private tracker;
+    tracker: Map<number, T[]>;
     get size(): number;
     /**
      * Adds a new intent for a specific tick.
@@ -34,7 +34,7 @@ export declare class IntentTracker<T> {
  */
 export declare class Reconciliator<T, U> {
     private options;
-    private tracker;
+    tracker: IntentTracker<T>;
     /**
      * @param {Object} options - Callbacks for applying snapshot state and replaying intents.
      * @param {(snapshotState: U) => void} options.onLoadState - Called to load authoritative snapshot state.

package/dist/core/prediction/prediction.js

@@ -17,7 +17,10 @@ export class IntentTracker {
      * @param {T} intent - The intent data.
      */
     track(tick, intent) {
-        this.tracker.set(tick, intent);
+        if (!this.tracker.has(tick)) {
+            this.tracker.set(tick, []);
+        }
+        this.tracker.get(tick).push(intent);
         return intent;
     }
     /**
@@ -28,15 +31,15 @@ export class IntentTracker {
      */
     dropUpTo(tick) {
         const remaining = [];
-        for (const [t, intent] of this.tracker) {
+        for (const [t, intents] of this.tracker) {
             if (t <= tick)
                 this.tracker.delete(t);
             else
-                remaining.push([t, intent]);
+                remaining.push([t, intents]);
         }
         // sort by tick ascending
         remaining.sort(([a], [b]) => a - b);
-        return remaining.map(([_, intent]) => intent);
+        return remaining.map(([_, intents]) => intents).flat();
     }
     /**
      * Returns all currently tracked intents in ascending tick order.
@@ -45,7 +48,8 @@ export class IntentTracker {
     values() {
         return Array.from(this.tracker.entries())
             .sort(([a], [b]) => a - b)
-            .map(([_, intent]) => intent);
+            .map(([_, intents]) => intents)
+            .flat();
     }
 }
 /**
@@ -84,7 +88,9 @@ export class Reconciliator {
         this.options.onLoadState(snapshot.state);
         // 2. Remove confirmed intents and get remaining
         const remainingIntents = this.tracker.dropUpTo(snapshot.tick);
-        // 3. Replay remaining intents for prediction
-        this.options.onReplay(remainingIntents);
+        // 3. Only replay if there are actually remaining intents
+        if (remainingIntents.length > 0) {
+            this.options.onReplay(remainingIntents);
+        }
     }
 }

package/dist/core.esm.js

@@ -1 +1 @@
-var U=Symbol("schemaSize");function V(i){let e=i[U];if(e!==void 0)return e;let t=0;for(let s of Object.keys(i))t+=i[s].size;return i[U]=t,t}var w=class{static encodeInto(e,t){let s=V(e),n=new ArrayBuffer(s),c=new DataView(n),r=0;for(let o of Object.keys(e)){let a=e[o];a.write(c,r,t[o]),r+=a.size}return new Uint8Array(n)}static decodeInto(e,t,s){let n=V(e);if(t.byteLength<n)throw new RangeError(`Buffer too small: expected ${n} bytes, got ${t.byteLength}`);let c=new DataView(t.buffer,t.byteOffset,t.byteLength),r=0;for(let o of Object.keys(e)){let a=e[o];s[o]=a.read(c,r),r+=a.size}return s}},y=class{static{this.u8={size:1,write:(e,t,s)=>e.setUint8(t,s),read:(e,t)=>e.getUint8(t),toNil:()=>0}}static{this.u16={size:2,write:(e,t,s)=>e.setUint16(t,s,!1),read:(e,t)=>e.getUint16(t,!1),toNil:()=>0}}static{this.u32={size:4,write:(e,t,s)=>e.setUint32(t,s,!1),read:(e,t)=>e.getUint32(t,!1),toNil:()=>0}}static{this.i8={size:1,write:(e,t,s)=>e.setInt8(t,s),read:(e,t)=>e.getInt8(t),toNil:()=>0}}static{this.i16={size:2,write:(e,t,s)=>e.setInt16(t,s,!1),read:(e,t)=>e.getInt16(t,!1),toNil:()=>0}}static{this.i32={size:4,write:(e,t,s)=>e.setInt32(t,s,!1),read:(e,t)=>e.getInt32(t,!1),toNil:()=>0}}static{this.f32={size:4,write:(e,t,s)=>e.setFloat32(t,s,!1),read:(e,t)=>e.getFloat32(t,!1),toNil:()=>0}}static{this.f64={size:8,write:(e,t,s)=>e.setFloat64(t,s,!1),read:(e,t)=>e.getFloat64(t,!1),toNil:()=>0}}static{this.bool={size:1,write:(e,t,s)=>e.setUint8(t,s?1:0),read:(e,t)=>e.getUint8(t)!==0,toNil:()=>!1}}static string(e){return{size:e+2,write(t,s,n){let r=new TextEncoder().encode(n);if(r.length>e)throw new RangeError(`String too long, max ${e} bytes`);t.setUint16(s,r.length,!1);for(let o=0;o<r.length;o++)t.setUint8(s+2+o,r[o]);for(let o=r.length;o<e;o++)t.setUint8(s+2+o,0)},read(t,s){let n=t.getUint16(s,!1),c=new Uint8Array(n);for(let r=0;r<n;r++)c[r]=t.getUint8(s+2+r);return new TextDecoder().decode(c)},toNil:()=>""}}static{this.vec2={size:8,write(e,t,s){e.setFloat32(t,s.x,!1),e.setFloat32(t+4,s.y,!1)},read(e,t){return{x:e.getFloat32(t,!1),y:e.getFloat32(t+4,!1)}},toNil:()=>({x:0,y:0})}}static{this.vec3={size:12,write(e,t,s){e.setFloat32(t,s.x,!1),e.setFloat32(t+4,s.y,!1),e.setFloat32(t+8,s.z,!1)},read(e,t){return{x:e.getFloat32(t,!1),y:e.getFloat32(t+4,!1),z:e.getFloat32(t+8,!1)}},toNil:()=>({x:0,y:0,z:0})}}static{this.color={size:4,write(e,t,s){e.setUint8(t,s.r),e.setUint8(t+1,s.g),e.setUint8(t+2,s.b),e.setUint8(t+3,s.a)},read(e,t){return{r:e.getUint8(t),g:e.getUint8(t+1),b:e.getUint8(t+2),a:e.getUint8(t+3)}},toNil:()=>({r:0,g:0,b:0,a:0})}}static{this.f32_le={size:4,write:(e,t,s)=>e.setFloat32(t,s,!0),read:(e,t)=>e.getFloat32(t,!0),toNil:()=>0}}static{this.f64_le={size:8,write:(e,t,s)=>e.setFloat64(t,s,!0),read:(e,t)=>e.getFloat64(t,!0),toNil:()=>0}}static{this.u16_le={size:2,write:(e,t,s)=>e.setUint16(t,s,!0),read:(e,t)=>e.getUint16(t,!0),toNil:()=>0}}static{this.u32_le={size:4,write:(e,t,s)=>e.setUint32(t,s,!0),read:(e,t)=>e.getUint32(t,!0),toNil:()=>0}}static{this.i16_le={size:2,write:(e,t,s)=>e.setInt16(t,s,!0),read:(e,t)=>e.getInt16(t,!0),toNil:()=>0}}static{this.i32_le={size:4,write:(e,t,s)=>e.setInt32(t,s,!0),read:(e,t)=>e.getInt32(t,!0),toNil:()=>0}}static{this.vec2_le={size:8,write:(e,t,s)=>{e.setFloat32(t,s[0],!0),e.setFloat32(t+4,s[1],!0)},read:(e,t)=>[e.getFloat32(t,!0),e.getFloat32(t+4,!0)],toNil:()=>[0,0]}}static{this.vec3_le={size:12,write:(e,t,s)=>{e.setFloat32(t,s[0],!0),e.setFloat32(t+4,s[1],!0),e.setFloat32(t+8,s[2],!0)},read:(e,t)=>[e.getFloat32(t,!0),e.getFloat32(t+4,!0),e.getFloat32(t+8,!0)],toNil:()=>[0,0,0]}}static{this.vec4_le={size:16,write:(e,t,s)=>{e.setFloat32(t,s[0],!0),e.setFloat32(t+4,s[1],!0),e.setFloat32(t+8,s[2],!0),e.setFloat32(t+12,s[3],!0)},read:(e,t)=>[e.getFloat32(t,!0),e.getFloat32(t+4,!0),e.getFloat32(t+8,!0),e.getFloat32(t+12,!0)],toNil:()=>[0,0,0,0]}}},x=class extends w{static{this.u8=y.u8}static{this.u16=y.u16}static{this.f32=y.f32}static encode(e,t){return this.encodeInto(e,t)}static decode(e,t,s){return this.decodeInto(e,t,s)}};var C=class{constructor({events:e}){this.callbacks=new Map,this.events=e;for(let t of this.events)this.callbacks.set(t,new Set)}on(e,t){let s=this.callbacks.get(e);if(!s)return console.warn(`Event "${e}" does not exist.`);s.add(t)}once(e,t){let s=n=>{t(n),this.off(e,s)};this.on(e,s)}emit(e,t){let s=this.callbacks.get(e);if(!s)return console.warn(`Event "${e}" does not exist.`);for(let n of s)n(t)}off(e,t){let s=this.callbacks.get(e);if(!s)return console.warn(`Event "${e}" does not exist.`);s.delete(t)}clear(e){if(!e){this.callbacks.clear();for(let s of this.events)this.callbacks.set(s,new Set);return}let t=this.callbacks.get(e);if(!t)return console.warn(`Event "${e}" does not exist.`);t.clear()}};var A=class{constructor({rate:e,onTick:t}){this.accumulator=0;this._tickCount=0;this.rate=e,this.intervalMs=1e3/this.rate,this.onTick=t,this.maxTicksPerFrame=Math.max(1,Math.floor(e/2))}getTicks(e){this.accumulator+=e*1e3;let t=0;for(;this.accumulator>=this.intervalMs&&t<this.maxTicksPerFrame;)this.accumulator-=this.intervalMs,t++;let s=Math.floor(this.accumulator/this.intervalMs);return s>0&&this.onTickSkipped&&this.onTickSkipped(s),t}tick(e){let t=this.getTicks(e);for(let s=0;s<t;s++)this.onTick(1/this.rate,this._tickCount++)}get tickCount(){return this._tickCount}resetTickCount(){this._tickCount=0}get accumulatedTime(){return this.accumulator/1e3}};function re(i={}){let{prefix:e="",size:t=16}=i,s=Math.max(t-e.length,8),n=Math.ceil(s/8),r=crypto.getRandomValues(new Uint32Array(n)).reduce((o,a)=>o+a.toString(16).padStart(8,"0"),"");return r=r.slice(0,s).padStart(s,"0"),`${e}${r}`}function ce(i,e,t){return i+(e-i)*t}var B=[{x:1,y:0},{x:-1,y:0},{x:0,y:1},{x:0,y:-1}],T=i=>({x:Math.floor(i.x),y:Math.floor(i.y)}),X=i=>({x:i.x+.5,y:i.y+.5}),L=(()=>{let i=1;return()=>i++})(),m=(i,e)=>i&65535|(e&65535)<<16,F=i=>({x:i<<16>>16,y:i>>16}),M=class{constructor(e){this.scoreFn=e;this.heap=[]}push(e){this.heap.push(e),this.bubbleUp(this.heap.length-1)}pop(){let e=this.heap[0],t=this.heap.pop();return this.heap.length>0&&t!==void 0&&(this.heap[0]=t,this.sinkDown(0)),e}get size(){return this.heap.length}bubbleUp(e){let t=this.heap[e],s=this.scoreFn(t);for(;e>0;){let n=(e+1>>1)-1,c=this.heap[n];if(s>=this.scoreFn(c))break;this.heap[n]=t,this.heap[e]=c,e=n}}sinkDown(e){let t=this.heap.length,s=this.heap[e],n=this.scoreFn(s);for(;;){let c=e+1<<1,r=c-1,o=null,a;if(r<t){let l=this.heap[r];a=this.scoreFn(l),a<n&&(o=r)}if(c<t){let l=this.heap[c];this.scoreFn(l)<(o===null?n:a)&&(o=c)}if(o===null)break;this.heap[e]=this.heap[o],this.heap[o]=s,e=o}}},z=class{constructor(e=1){this.grid=new Map;this.obstacleCells=new Map;this.cellSize=e}hash(e,t){let s=Math.floor(e/this.cellSize),n=Math.floor(t/this.cellSize);return m(s,n)}add(e,t){let s=this.getCellsForObstacle(t);for(let n of s)this.grid.has(n)||this.grid.set(n,new Set),this.grid.get(n).add(e);this.obstacleCells.set(e,s)}remove(e){let t=this.obstacleCells.get(e);if(t){for(let s of t){let n=this.grid.get(s);n&&(n.delete(e),n.size===0&&this.grid.delete(s))}this.obstacleCells.delete(e)}}query(e){let t=this.hash(e.x,e.y);return this.grid.get(t)||new Set}clear(){this.grid.clear(),this.obstacleCells.clear()}getCellsForObstacle(e){let t=new Set;if(e.type==="circle"){let s=e.radius,n=Math.floor((e.pos.x-s)/this.cellSize),c=Math.floor((e.pos.x+s)/this.cellSize),r=Math.floor((e.pos.y-s)/this.cellSize),o=Math.floor((e.pos.y+s)/this.cellSize);for(let a=n;a<=c;a++)for(let l=r;l<=o;l++)t.add(m(a,l))}else if(e.type==="rect"){let s=e.pos.x+e.size.x/2,n=e.pos.y+e.size.y/2,c=e.size.x/2,r=e.size.y/2,o=Math.sqrt(c*c+r*r),a=Math.floor((s-o)/this.cellSize),l=Math.floor((s+o)/this.cellSize),h=Math.floor((n-o)/this.cellSize),u=Math.floor((n+o)/this.cellSize);for(let d=a;d<=l;d++)for(let p=h;p<=u;p++)t.add(m(d,p))}else if(e.type==="polygon"){let s=R(e),n=Math.floor(s.minX/this.cellSize),c=Math.floor(s.maxX/this.cellSize),r=Math.floor(s.minY/this.cellSize),o=Math.floor(s.maxY/this.cellSize);for(let a=n;a<=c;a++)for(let l=r;l<=o;l++)t.add(m(a,l))}return t}};function Y(i,e){let t=i.x-e.pos.x,s=i.y-e.pos.y;return t*t+s*s<=e.radius*e.radius}function j(i,e){let t=e.pos.x+e.size.x/2,s=e.pos.y+e.size.y/2;if(e.rotation){let n=Math.cos(-e.rotation),c=Math.sin(-e.rotation),r=i.x-t,o=i.y-s,a=r*n-o*c,l=r*c+o*n;return Math.abs(a)<=e.size.x/2&&Math.abs(l)<=e.size.y/2}return i.x>=e.pos.x&&i.y>=e.pos.y&&i.x<=e.pos.x+e.size.x&&i.y<=e.pos.y+e.size.y}function _(i,e){let t=!1,s=e.points,n=e.rotation?Math.cos(e.rotation):1,c=e.rotation?Math.sin(e.rotation):0;for(let r=0,o=s.length-1;r<s.length;o=r++){let a=s[r].x,l=s[r].y,h=s[o].x,u=s[o].y;if(e.rotation){let p=a*n-l*c,f=a*c+l*n,b=h*n-u*c,g=h*c+u*n;a=p,l=f,h=b,u=g}a+=e.pos.x,l+=e.pos.y,h+=e.pos.x,u+=e.pos.y,l>i.y!=u>i.y&&i.x<(h-a)*(i.y-l)/(u-l)+a&&(t=!t)}return t}function R(i){let e=1/0,t=1/0,s=-1/0,n=-1/0,c=i.rotation?Math.cos(i.rotation):1,r=i.rotation?Math.sin(i.rotation):0;for(let o of i.points){let a=o.x,l=o.y;if(i.rotation){let h=a*c-l*r,u=a*r+l*c;a=h,l=u}a+=i.pos.x,l+=i.pos.y,e=Math.min(e,a),t=Math.min(t,l),s=Math.max(s,a),n=Math.max(n,l)}return{minX:e,minY:t,maxX:s,maxY:n}}var O=class{constructor(){this.items=new Map;this.spatial=new z(1);this._cachedItems=[];this.dirty=!0;this.version=0}add(e){let t=L(),s={...e,id:t};return this.items.set(t,s),this.spatial.add(t,s),this.dirty=!0,this.version++,t}move(e,t){let s=this.items.get(e);if(!s)return;this.spatial.remove(e);let n={...s,pos:{...t}};this.items.set(e,n),this.spatial.add(e,n),this.dirty=!0,this.version++}remove(e){this.spatial.remove(e),this.items.delete(e),this.dirty=!0,this.version++}at(e){let t=this.spatial.query(e);for(let s of t){let n=this.items.get(s);if(!(!n||n.solid===!1)&&(n.type==="circle"&&Y(e,n)||n.type==="rect"&&j(e,n)||n.type==="polygon"&&_(e,n)))return n}}get values(){return this.dirty?(this._cachedItems=[...this.items.values()],this.dirty=!1,this._cachedItems):this._cachedItems}},S=class{constructor(e){this.obstacles=e;this.blocked=new Set}rebuild(){this.blocked.clear();for(let e of this.obstacles.values)if(e.solid!==!1){if(e.type==="circle"){let t=Math.ceil(e.radius),s=Math.floor(e.pos.x),n=Math.floor(e.pos.y);for(let c=-t;c<=t;c++)for(let r=-t;r<=t;r++){let o=s+c,a=n+r,l={x:o+.5,y:a+.5};Y(l,e)&&this.blocked.add(m(o,a))}}else if(e.type==="rect"){let t=e.pos.x+e.size.x/2,s=e.pos.y+e.size.y/2,n=e.size.x/2,c=e.size.y/2,r=Math.sqrt(n*n+c*c),o=Math.floor(t-r),a=Math.ceil(t+r),l=Math.floor(s-r),h=Math.ceil(s+r);for(let u=o;u<=a;u++)for(let d=l;d<=h;d++){let p={x:u+.5,y:d+.5};j(p,e)&&this.blocked.add(m(u,d))}}else if(e.type==="polygon"){let t=R(e),s=Math.floor(t.minX),n=Math.ceil(t.maxX),c=Math.floor(t.minY),r=Math.ceil(t.maxY);for(let o=s;o<=n;o++)for(let a=c;a<=r;a++){let l={x:o+.5,y:a+.5};_(l,e)&&this.blocked.add(m(o,a))}}}}findPath(e,t){return D(T(e),T(t),(s,n)=>!this.blocked.has(m(s,n))).map(X)}},E=class{constructor(e){this.obstacles=e}rebuild(){}findPath(e,t){let s=Math.ceil(Math.hypot(t.x-e.x,t.y-e.y)*2),n=!1;for(let r=1;r<=s;r++){let o=r/s,a={x:e.x+(t.x-e.x)*o,y:e.y+(t.y-e.y)*o};if(this.obstacles.at(a)){n=!0;break}}return n?D(T(e),T(t),(r,o)=>{let a={x:r+.5,y:o+.5};return!this.obstacles.at(a)}).map(X):[e,t]}},P=class{constructor(e){this.type=e;this.lastVersion=-1;this.obstacles=new O,e==="grid"&&(this.grid=new S(this.obstacles)),e==="graph"&&(this.graph=new E(this.obstacles))}addObstacle(e){return this.obstacles.add(e)}moveObstacle(e,t){this.obstacles.move(e,t)}removeObstacle(e){this.obstacles.remove(e)}getObstacles(){return this.obstacles.values}findPath({from:e,to:t}){return this.rebuild(),this.type==="grid"?this.grid.findPath(e,t):this.graph.findPath(e,t)}rebuild(){this.lastVersion!==this.obstacles.version&&(this.grid?.rebuild(),this.graph?.rebuild(),this.lastVersion=this.obstacles.version)}};function D(i,e,t){let s=new Map,n=new Map,c=new Set,r=new Set,o=u=>m(u.x,u.y),a=(u,d)=>Math.abs(u.x-d.x)+Math.abs(u.y-d.y),l=new M(u=>{let d=F(u);return n.get(u)+a(d,e)}),h=o(i);for(n.set(h,0),l.push(h),r.add(h);l.size>0;){let u=l.pop();r.delete(u);let d=F(u);if(d.x===e.x&&d.y===e.y)return G(s,d);c.add(u);for(let p of B){let f={x:d.x+p.x,y:d.y+p.y};if(!t(f.x,f.y))continue;let b=o(f);if(c.has(b))continue;let g=n.get(u)+1;g<(n.get(b)??1/0)&&(n.set(b,g),s.set(b,u),r.has(b)||(l.push(b),r.add(b)))}}return[]}function G(i,e){let t=[e],s=m(e.x,e.y);for(;i.has(s);)s=i.get(s),t.push(F(s));return t.reverse()}var k=class{constructor(e){this.factory=e;this.pool=[]}acquire(){return this.pool.pop()??this.factory()}release(e){this.pool.push(e)}releaseAll(e){this.pool.push(...e)}},v=class{constructor(e){this.schema=e;this.pool=new k(()=>this.createNil())}createNil(){let e={};for(let t of Object.keys(this.schema)){let s=this.schema[t];e[t]="toNil"in s?s.toNil():void 0}return e}decode(e){let t=this.pool.acquire();return this.decodeInto(e,t),t}decodeInto(e,t){for(let s of Object.keys(this.schema)){let n=this.schema[s];"decodeAll"in n?t[s]=n.decodeAll(e):"decode"in n?t[s]=n.decode(e):x.decodeInto({[s]:n},e,t)}}release(e){this.pool.release(e)}},$=class{constructor(e){this.pooledDecoder=new v(e)}decodeAll(e){return e.map(t=>this.pooledDecoder.decode(t))}releaseAll(e){e.forEach(t=>this.pooledDecoder.release(t))}},I=class{constructor(e,t=1024){this.schema=e;this.bufferSize=t;this.pool=new k(()=>new Uint8Array(t))}encode(e){let t=this.pool.acquire(),s=0;for(let n of Object.keys(this.schema)){let c=this.schema[n];if("encode"in c){let r=c.encode(e[n]);t.set(r,s),s+=r.length}else if("encodeAll"in c){let r=c.encodeAll(e[n]),o=0;for(let a of r)t.set(a,s+o),o+=a.length;s+=o}else{let r=x.encode({[n]:c},{[n]:e[n]});t.set(r,s),s+=r.length}}return t.subarray(0,s)}release(e){this.pool.release(e)}},q=class{constructor(e){this.encoder=new I(e),this.decoder=new v(e)}encode(e){return this.encoder.encode(e)}decode(e){return this.decoder.decode(e)}release(e){this.decoder.release(e)}};var N=class{constructor(){this.tracker=new Map}get size(){return this.tracker.size}track(e,t){return this.tracker.set(e,t),t}dropUpTo(e){let t=[];for(let[s,n]of this.tracker)s<=e?this.tracker.delete(s):t.push([s,n]);return t.sort(([s],[n])=>s-n),t.map(([s,n])=>n)}values(){return Array.from(this.tracker.entries()).sort(([e],[t])=>e-t).map(([e,t])=>t)}},K=class{constructor(e){this.options=e;this.tracker=new N}trackIntent(e,t){this.tracker.track(e,t)}onSnapshot(e){this.options.onLoadState(e.state);let t=this.tracker.dropUpTo(e.tick);this.options.onReplay(t)}};export{w as BaseBinaryCodec,x as BinaryCodec,y as BinaryPrimitives,C as EventSystem,A as FixedTicker,N as IntentTracker,P as NavMesh,k as ObjectPool,$ as PooledArrayDecoder,q as PooledCodec,v as PooledDecoder,I as PooledEncoder,K as Reconciliator,re as generateId,ce as lerp};
+var N=Symbol("schemaSize");function V(c){let e=c[N];if(e!==void 0)return e;let t=0;for(let s of Object.keys(c))t+=c[s].size;return c[N]=t,t}var w=class{static encodeInto(e,t){let s=V(e),n=new ArrayBuffer(s),a=new DataView(n),r=0;for(let o of Object.keys(e)){let i=e[o];i.write(a,r,t[o]),r+=i.size}return new Uint8Array(n)}static decodeInto(e,t,s){let n=V(e);if(t.byteLength<n)throw new RangeError(`Buffer too small: expected ${n} bytes, got ${t.byteLength}`);let a=new DataView(t.buffer,t.byteOffset,t.byteLength),r=0;for(let o of Object.keys(e)){let i=e[o];s[o]=i.read(a,r),r+=i.size}return s}},y=class{static{this.u8={size:1,write:(e,t,s)=>e.setUint8(t,s),read:(e,t)=>e.getUint8(t),toNil:()=>0}}static{this.u16={size:2,write:(e,t,s)=>e.setUint16(t,s,!1),read:(e,t)=>e.getUint16(t,!1),toNil:()=>0}}static{this.u32={size:4,write:(e,t,s)=>e.setUint32(t,s,!1),read:(e,t)=>e.getUint32(t,!1),toNil:()=>0}}static{this.i8={size:1,write:(e,t,s)=>e.setInt8(t,s),read:(e,t)=>e.getInt8(t),toNil:()=>0}}static{this.i16={size:2,write:(e,t,s)=>e.setInt16(t,s,!1),read:(e,t)=>e.getInt16(t,!1),toNil:()=>0}}static{this.i32={size:4,write:(e,t,s)=>e.setInt32(t,s,!1),read:(e,t)=>e.getInt32(t,!1),toNil:()=>0}}static{this.f32={size:4,write:(e,t,s)=>e.setFloat32(t,s,!1),read:(e,t)=>e.getFloat32(t,!1),toNil:()=>0}}static{this.f64={size:8,write:(e,t,s)=>e.setFloat64(t,s,!1),read:(e,t)=>e.getFloat64(t,!1),toNil:()=>0}}static{this.bool={size:1,write:(e,t,s)=>e.setUint8(t,s?1:0),read:(e,t)=>e.getUint8(t)!==0,toNil:()=>!1}}static string(e){return{size:e+2,write(t,s,n){let r=new TextEncoder().encode(n);if(r.length>e)throw new RangeError(`String too long, max ${e} bytes`);t.setUint16(s,r.length,!1);for(let o=0;o<r.length;o++)t.setUint8(s+2+o,r[o]);for(let o=r.length;o<e;o++)t.setUint8(s+2+o,0)},read(t,s){let n=t.getUint16(s,!1),a=new Uint8Array(n);for(let r=0;r<n;r++)a[r]=t.getUint8(s+2+r);return new TextDecoder().decode(a)},toNil:()=>""}}static{this.vec2={size:8,write(e,t,s){e.setFloat32(t,s.x,!1),e.setFloat32(t+4,s.y,!1)},read(e,t){return{x:e.getFloat32(t,!1),y:e.getFloat32(t+4,!1)}},toNil:()=>({x:0,y:0})}}static{this.vec3={size:12,write(e,t,s){e.setFloat32(t,s.x,!1),e.setFloat32(t+4,s.y,!1),e.setFloat32(t+8,s.z,!1)},read(e,t){return{x:e.getFloat32(t,!1),y:e.getFloat32(t+4,!1),z:e.getFloat32(t+8,!1)}},toNil:()=>({x:0,y:0,z:0})}}static{this.color={size:4,write(e,t,s){e.setUint8(t,s.r),e.setUint8(t+1,s.g),e.setUint8(t+2,s.b),e.setUint8(t+3,s.a)},read(e,t){return{r:e.getUint8(t),g:e.getUint8(t+1),b:e.getUint8(t+2),a:e.getUint8(t+3)}},toNil:()=>({r:0,g:0,b:0,a:0})}}static{this.f32_le={size:4,write:(e,t,s)=>e.setFloat32(t,s,!0),read:(e,t)=>e.getFloat32(t,!0),toNil:()=>0}}static{this.f64_le={size:8,write:(e,t,s)=>e.setFloat64(t,s,!0),read:(e,t)=>e.getFloat64(t,!0),toNil:()=>0}}static{this.u16_le={size:2,write:(e,t,s)=>e.setUint16(t,s,!0),read:(e,t)=>e.getUint16(t,!0),toNil:()=>0}}static{this.u32_le={size:4,write:(e,t,s)=>e.setUint32(t,s,!0),read:(e,t)=>e.getUint32(t,!0),toNil:()=>0}}static{this.i16_le={size:2,write:(e,t,s)=>e.setInt16(t,s,!0),read:(e,t)=>e.getInt16(t,!0),toNil:()=>0}}static{this.i32_le={size:4,write:(e,t,s)=>e.setInt32(t,s,!0),read:(e,t)=>e.getInt32(t,!0),toNil:()=>0}}static{this.vec2_le={size:8,write:(e,t,s)=>{e.setFloat32(t,s[0],!0),e.setFloat32(t+4,s[1],!0)},read:(e,t)=>[e.getFloat32(t,!0),e.getFloat32(t+4,!0)],toNil:()=>[0,0]}}static{this.vec3_le={size:12,write:(e,t,s)=>{e.setFloat32(t,s[0],!0),e.setFloat32(t+4,s[1],!0),e.setFloat32(t+8,s[2],!0)},read:(e,t)=>[e.getFloat32(t,!0),e.getFloat32(t+4,!0),e.getFloat32(t+8,!0)],toNil:()=>[0,0,0]}}static{this.vec4_le={size:16,write:(e,t,s)=>{e.setFloat32(t,s[0],!0),e.setFloat32(t+4,s[1],!0),e.setFloat32(t+8,s[2],!0),e.setFloat32(t+12,s[3],!0)},read:(e,t)=>[e.getFloat32(t,!0),e.getFloat32(t+4,!0),e.getFloat32(t+8,!0),e.getFloat32(t+12,!0)],toNil:()=>[0,0,0,0]}}},g=class extends w{static{this.u8=y.u8}static{this.u16=y.u16}static{this.u32=y.u32}static{this.i8=y.i8}static{this.i16=y.i16}static{this.i32=y.i32}static{this.f32=y.f32}static{this.bool=y.bool}static{this.string=y.string}static{this.vec2=y.vec2}static{this.vec3=y.vec3}static{this.color=y.color}static encode(e,t){return this.encodeInto(e,t)}static decode(e,t,s){return this.decodeInto(e,t,s)}};var A=class{constructor({events:e}){this.callbacks=new Map,this.events=e;for(let t of this.events)this.callbacks.set(t,new Set)}on(e,t){let s=this.callbacks.get(e);if(!s)return console.warn(`Event "${e}" does not exist.`);s.add(t)}once(e,t){let s=n=>{t(n),this.off(e,s)};this.on(e,s)}emit(e,t){let s=this.callbacks.get(e);if(!s)return console.warn(`Event "${e}" does not exist.`);for(let n of s)n(t)}off(e,t){let s=this.callbacks.get(e);if(!s)return console.warn(`Event "${e}" does not exist.`);s.delete(t)}clear(e){if(!e){this.callbacks.clear();for(let s of this.events)this.callbacks.set(s,new Set);return}let t=this.callbacks.get(e);if(!t)return console.warn(`Event "${e}" does not exist.`);t.clear()}};var C=class{constructor({rate:e,onTick:t}){this.accumulator=0;this._tickCount=0;this.rate=e,this.intervalMs=1e3/this.rate,this.onTick=t,this.maxTicksPerFrame=Math.max(1,Math.floor(e/2))}getTicks(e){this.accumulator+=e*1e3;let t=0;for(;this.accumulator>=this.intervalMs&&t<this.maxTicksPerFrame;)this.accumulator-=this.intervalMs,t++;let s=Math.floor(this.accumulator/this.intervalMs);return s>0&&this.onTickSkipped&&this.onTickSkipped(s),t}tick(e){let t=this.getTicks(e);for(let s=0;s<t;s++)this.onTick(1/this.rate,this._tickCount++)}get tickCount(){return this._tickCount}resetTickCount(){this._tickCount=0}get accumulatedTime(){return this.accumulator/1e3}};function re(c={}){let{prefix:e="",size:t=16}=c,s=Math.max(t-e.length,8),n=Math.ceil(s/8),r=crypto.getRandomValues(new Uint32Array(n)).reduce((o,i)=>o+i.toString(16).padStart(8,"0"),"");return r=r.slice(0,s).padStart(s,"0"),`${e}${r}`}function ce(c,e,t){return c+(e-c)*t}var B=[{x:1,y:0},{x:-1,y:0},{x:0,y:1},{x:0,y:-1}],k=c=>({x:Math.floor(c.x),y:Math.floor(c.y)}),P=c=>({x:c.x+.5,y:c.y+.5}),L=(()=>{let c=1;return()=>c++})(),m=(c,e)=>c&65535|(e&65535)<<16,F=c=>({x:c<<16>>16,y:c>>16}),z=class{constructor(e){this.scoreFn=e;this.heap=[]}push(e){this.heap.push(e),this.bubbleUp(this.heap.length-1)}pop(){let e=this.heap[0],t=this.heap.pop();return this.heap.length>0&&t!==void 0&&(this.heap[0]=t,this.sinkDown(0)),e}get size(){return this.heap.length}bubbleUp(e){let t=this.heap[e],s=this.scoreFn(t);for(;e>0;){let n=(e+1>>1)-1,a=this.heap[n];if(s>=this.scoreFn(a))break;this.heap[n]=t,this.heap[e]=a,e=n}}sinkDown(e){let t=this.heap.length,s=this.heap[e],n=this.scoreFn(s);for(;;){let a=e+1<<1,r=a-1,o=null,i;if(r<t){let l=this.heap[r];i=this.scoreFn(l),i<n&&(o=r)}if(a<t){let l=this.heap[a];this.scoreFn(l)<(o===null?n:i)&&(o=a)}if(o===null)break;this.heap[e]=this.heap[o],this.heap[o]=s,e=o}}},S=class{constructor(e=1){this.grid=new Map;this.obstacleCells=new Map;this.cellSize=e}hash(e,t){let s=Math.floor(e/this.cellSize),n=Math.floor(t/this.cellSize);return m(s,n)}add(e,t){let s=this.getCellsForObstacle(t);for(let n of s)this.grid.has(n)||this.grid.set(n,new Set),this.grid.get(n).add(e);this.obstacleCells.set(e,s)}remove(e){let t=this.obstacleCells.get(e);if(t){for(let s of t){let n=this.grid.get(s);n&&(n.delete(e),n.size===0&&this.grid.delete(s))}this.obstacleCells.delete(e)}}query(e){let t=this.hash(e.x,e.y);return this.grid.get(t)||new Set}clear(){this.grid.clear(),this.obstacleCells.clear()}getCellsForObstacle(e){let t=new Set;if(e.type==="circle"){let s=e.radius,n=Math.floor((e.pos.x-s)/this.cellSize),a=Math.floor((e.pos.x+s)/this.cellSize),r=Math.floor((e.pos.y-s)/this.cellSize),o=Math.floor((e.pos.y+s)/this.cellSize);for(let i=n;i<=a;i++)for(let l=r;l<=o;l++)t.add(m(i,l))}else if(e.type==="rect"){let s=e.pos.x+e.size.x/2,n=e.pos.y+e.size.y/2,a=e.size.x/2,r=e.size.y/2,o=Math.sqrt(a*a+r*r),i=Math.floor((s-o)/this.cellSize),l=Math.floor((s+o)/this.cellSize),u=Math.floor((n-o)/this.cellSize),d=Math.floor((n+o)/this.cellSize);for(let h=i;h<=l;h++)for(let p=u;p<=d;p++)t.add(m(h,p))}else if(e.type==="polygon"){let s=R(e),n=Math.floor(s.minX/this.cellSize),a=Math.floor(s.maxX/this.cellSize),r=Math.floor(s.minY/this.cellSize),o=Math.floor(s.maxY/this.cellSize);for(let i=n;i<=a;i++)for(let l=r;l<=o;l++)t.add(m(i,l))}return t}};function _(c,e){let t=c.x-e.pos.x,s=c.y-e.pos.y;return t*t+s*s<=e.radius*e.radius}function X(c,e){let t=e.pos.x+e.size.x/2,s=e.pos.y+e.size.y/2;if(e.rotation){let n=Math.cos(-e.rotation),a=Math.sin(-e.rotation),r=c.x-t,o=c.y-s,i=r*n-o*a,l=r*a+o*n;return Math.abs(i)<=e.size.x/2&&Math.abs(l)<=e.size.y/2}return c.x>=e.pos.x&&c.y>=e.pos.y&&c.x<=e.pos.x+e.size.x&&c.y<=e.pos.y+e.size.y}function Y(c,e){let t=!1,s=e.points,n=e.rotation?Math.cos(e.rotation):1,a=e.rotation?Math.sin(e.rotation):0;for(let r=0,o=s.length-1;r<s.length;o=r++){let i=s[r].x,l=s[r].y,u=s[o].x,d=s[o].y;if(e.rotation){let p=i*n-l*a,b=i*a+l*n,f=u*n-d*a,T=u*a+d*n;i=p,l=b,u=f,d=T}i+=e.pos.x,l+=e.pos.y,u+=e.pos.x,d+=e.pos.y,l>c.y!=d>c.y&&c.x<(u-i)*(c.y-l)/(d-l)+i&&(t=!t)}return t}function R(c){let e=1/0,t=1/0,s=-1/0,n=-1/0,a=c.rotation?Math.cos(c.rotation):1,r=c.rotation?Math.sin(c.rotation):0;for(let o of c.points){let i=o.x,l=o.y;if(c.rotation){let u=i*a-l*r,d=i*r+l*a;i=u,l=d}i+=c.pos.x,l+=c.pos.y,e=Math.min(e,i),t=Math.min(t,l),s=Math.max(s,i),n=Math.max(n,l)}return{minX:e,minY:t,maxX:s,maxY:n}}var O=class{constructor(){this.items=new Map;this.spatial=new S(1);this._cachedItems=[];this.dirty=!0;this.version=0}add(e){let t=L(),s={...e,id:t};return this.items.set(t,s),this.spatial.add(t,s),this.dirty=!0,this.version++,t}move(e,t){let s=this.items.get(e);if(!s)return;this.spatial.remove(e);let n={...s,pos:{...t}};this.items.set(e,n),this.spatial.add(e,n),this.dirty=!0,this.version++}remove(e){this.spatial.remove(e),this.items.delete(e),this.dirty=!0,this.version++}at(e){let t=this.spatial.query(e);for(let s of t){let n=this.items.get(s);if(!(!n||n.solid===!1)&&(n.type==="circle"&&_(e,n)||n.type==="rect"&&X(e,n)||n.type==="polygon"&&Y(e,n)))return n}}get values(){return this.dirty?(this._cachedItems=[...this.items.values()],this.dirty=!1,this._cachedItems):this._cachedItems}},U=class{constructor(e){this.obstacles=e;this.blocked=new Set}rebuild(){this.blocked.clear();for(let e of this.obstacles.values)if(e.solid!==!1){if(e.type==="circle"){let t=Math.ceil(e.radius),s=Math.floor(e.pos.x),n=Math.floor(e.pos.y);for(let a=-t;a<=t;a++)for(let r=-t;r<=t;r++){let o=s+a,i=n+r,l={x:o+.5,y:i+.5};_(l,e)&&this.blocked.add(m(o,i))}}else if(e.type==="rect"){let t=e.pos.x+e.size.x/2,s=e.pos.y+e.size.y/2,n=e.size.x/2,a=e.size.y/2,r=Math.sqrt(n*n+a*a),o=Math.floor(t-r),i=Math.ceil(t+r),l=Math.floor(s-r),u=Math.ceil(s+r);for(let d=o;d<=i;d++)for(let h=l;h<=u;h++){let p={x:d+.5,y:h+.5};X(p,e)&&this.blocked.add(m(d,h))}}else if(e.type==="polygon"){let t=R(e),s=Math.floor(t.minX),n=Math.ceil(t.maxX),a=Math.floor(t.minY),r=Math.ceil(t.maxY);for(let o=s;o<=n;o++)for(let i=a;i<=r;i++){let l={x:o+.5,y:i+.5};Y(l,e)&&this.blocked.add(m(o,i))}}}}findPath(e,t){return D(k(e),k(t),(s,n)=>!this.blocked.has(m(s,n))).map(P)}},M=class{constructor(e){this.obstacles=e}rebuild(){}findPath(e,t){let s=Math.ceil(Math.hypot(t.x-e.x,t.y-e.y)*2),n=!1;for(let r=1;r<=s;r++){let o=r/s,i={x:e.x+(t.x-e.x)*o,y:e.y+(t.y-e.y)*o};if(this.obstacles.at(i)){n=!0;break}}return n?D(k(e),k(t),(r,o)=>{let i={x:r+.5,y:o+.5};return!this.obstacles.at(i)}).map(P):[e,t]}},j=class{constructor(e){this.type=e;this.lastVersion=-1;this.obstacles=new O,e==="grid"&&(this.grid=new U(this.obstacles)),e==="graph"&&(this.graph=new M(this.obstacles))}addObstacle(e){return this.obstacles.add(e)}moveObstacle(e,t){this.obstacles.move(e,t)}removeObstacle(e){this.obstacles.remove(e)}getObstacles(){return this.obstacles.values}findPath({from:e,to:t}){return this.rebuild(),this.type==="grid"?this.grid.findPath(e,t):this.graph.findPath(e,t)}rebuild(){this.lastVersion!==this.obstacles.version&&(this.grid?.rebuild(),this.graph?.rebuild(),this.lastVersion=this.obstacles.version)}};function D(c,e,t){let s=new Map,n=new Map,a=new Set,r=new Set,o=d=>m(d.x,d.y),i=(d,h)=>Math.abs(d.x-h.x)+Math.abs(d.y-h.y),l=new z(d=>{let h=F(d);return n.get(d)+i(h,e)}),u=o(c);for(n.set(u,0),l.push(u),r.add(u);l.size>0;){let d=l.pop();r.delete(d);let h=F(d);if(h.x===e.x&&h.y===e.y)return G(s,h);a.add(d);for(let p of B){let b={x:h.x+p.x,y:h.y+p.y};if(!t(b.x,b.y))continue;let f=o(b);if(a.has(f))continue;let T=n.get(d)+1;T<(n.get(f)??1/0)&&(n.set(f,T),s.set(f,d),r.has(f)||(l.push(f),r.add(f)))}}return[]}function G(c,e){let t=[e],s=m(e.x,e.y);for(;c.has(s);)s=c.get(s),t.push(F(s));return t.reverse()}var x=class{constructor(e){this.factory=e;this.pool=[]}acquire(){return this.pool.pop()??this.factory()}release(e){this.pool.push(e)}releaseAll(e){this.pool.push(...e)}},v=class{constructor(e){this.schema=e;this.pool=new x(()=>this.createNil())}createNil(){let e={};for(let t of Object.keys(this.schema)){let s=this.schema[t];e[t]="toNil"in s?s.toNil():void 0}return e}decode(e){let t=this.pool.acquire();return this.decodeInto(e,t),t}decodeInto(e,t){let s=0;for(let n of Object.keys(this.schema)){let a=this.schema[n];if("decodeAll"in a){let r=a.decodeAll(e.subarray(s));t[n]=r.value,s+=r.bytesRead}else if("decodeField"in a){let r=a.decodeField(e.subarray(s));t[n]=r.value,s+=r.bytesRead}else if("decode"in a){let r=a.decode(e.subarray(s));t[n]=r.value,s+=r.bytesRead}else{let r=a.size||0,o=e.subarray(s,s+r);g.decodeInto({[n]:a},o,t),s+=r}}}release(e){this.pool.release(e)}},K=class{constructor(e){this.pooledDecoder=new v(e)}decodeAll(e){return e.map(t=>this.pooledDecoder.decode(t))}releaseAll(e){e.forEach(t=>this.pooledDecoder.release(t))}},I=class{constructor(e,t=1024){this.schema=e;this.bufferSize=t;this.pool=new x(()=>new Uint8Array(t))}encode(e){let t=this.pool.acquire(),s=0;for(let n of Object.keys(this.schema)){let a=this.schema[n];if("encode"in a){let r=a.encode(e[n]);t.set(r,s),s+=r.length}else if("encodeAll"in a){let r=a.encodeAll(e[n]),o=0;for(let i of r)t.set(i,s+o),o+=i.length;s+=o}else{let r=g.encode({[n]:a},{[n]:e[n]});t.set(r,s),s+=r.length}}return t.subarray(0,s)}release(e){this.pool.release(e)}},q=class{constructor(e){this.schema=e;this.encoder=new I(e),this.decoder=new v(e)}calculateSize(e){let t=0;for(let s of Object.keys(this.schema)){let n=this.schema[s];"size"in n?t+=n.size:"calculateSize"in n&&(t+=n.calculateSize(e[s]))}return t}encodeInto(e,t,s){let n=new DataView(t.buffer,t.byteOffset),a=s;for(let r of Object.keys(this.schema)){let o=this.schema[r];if("write"in o)o.write(n,a,e[r]),a+=o.size;else if("encodeInto"in o){let i=o.encodeInto(e[r],t,a);a+=i}else if("encode"in o){let i=o.encode(e[r]);t.set(i,a),a+=i.length}}return a-s}encode(e){return this.encoder.encode(e)}decode(e){return this.decoder.decode(e)}release(e){this.decoder.release(e)}static array(e){let t=0;for(let i of Object.keys(e)){let l=e[i];t+=l.size||0}let s=new x(()=>new Uint8Array(16384)),n=new x(()=>{let i={};for(let l of Object.keys(e)){let u=e[l];i[l]="toNil"in u?u.toNil():void 0}return i}),a=new x(()=>[]),r=null,o=null;return{__arrayType:void 0,calculateSize(i){return 2+i.length*t},encodeInto(i,l,u){let d=new DataView(l.buffer,l.byteOffset);d.setUint16(u,i.length,!1);let h=u+2;for(let p of i)for(let b of Object.keys(e)){let f=e[b];f.write(d,h,p[b]),h+=f.size}return h-u},encode(i){let l=2+i.length*t,u=s.acquire();u.length<l&&(s.release(u),u=new Uint8Array(Math.max(l,u.length*2))),(!r||r.buffer!==u.buffer)&&(r=new DataView(u.buffer,u.byteOffset)),r.setUint16(0,i.length,!1);let d=2;for(let p of i)for(let b of Object.keys(e)){let f=e[b];f.write(r,d,p[b]),d+=f.size}let h=new Uint8Array(d);return h.set(u.subarray(0,d)),s.release(u),h},decodeField(i){let l=i[0]<<8|i[1],u=a.acquire();u.length=l,(!o||o.buffer!==i.buffer||o.byteOffset!==i.byteOffset)&&(o=new DataView(i.buffer,i.byteOffset));let d=2;for(let h=0;h<l;h++){let p=n.acquire();for(let b of Object.keys(e)){let f=e[b];p[b]=f.read(o,d),d+=f.size}u[h]=p}return{value:u,bytesRead:d}},decode(i){return this.decodeField(i).value},toNil(){return[]}}}};var E=class{constructor(){this.tracker=new Map}get size(){return this.tracker.size}track(e,t){return this.tracker.has(e)||this.tracker.set(e,[]),this.tracker.get(e).push(t),t}dropUpTo(e){let t=[];for(let[s,n]of this.tracker)s<=e?this.tracker.delete(s):t.push([s,n]);return t.sort(([s],[n])=>s-n),t.map(([s,n])=>n).flat()}values(){return Array.from(this.tracker.entries()).sort(([e],[t])=>e-t).map(([e,t])=>t).flat()}},$=class{constructor(e){this.options=e;this.tracker=new E}trackIntent(e,t){this.tracker.track(e,t)}onSnapshot(e){this.options.onLoadState(e.state);let t=this.tracker.dropUpTo(e.tick);t.length>0&&this.options.onReplay(t)}};export{w as BaseBinaryCodec,g as BinaryCodec,y as BinaryPrimitives,A as EventSystem,C as FixedTicker,E as IntentTracker,j as NavMesh,x as ObjectPool,K as PooledArrayDecoder,q as PooledCodec,v as PooledDecoder,I as PooledEncoder,$ as Reconciliator,re as generateId,ce as lerp};