murow 0.0.60 → 0.0.71

package/dist/core/navmesh/navmesh.worker.js

@@ -1,79 +0,0 @@
-/**
- * NavMesh Worker - Offloads pathfinding to background thread
- *
- * Message Protocol:
- * - INIT: Initialize NavMesh with obstacles
- * - FIND_PATH: Request pathfinding (from, to)
- * - ADD_OBSTACLE: Add obstacle dynamically
- * - REMOVE_OBSTACLE: Remove obstacle dynamically
- * - MOVE_OBSTACLE: Move obstacle
- */
-import { NavMesh } from './navmesh';
-let navmesh = null;
-self.onmessage = (e) => {
-    const msg = e.data;
-    try {
-        switch (msg.type) {
-            case 'INIT': {
-                navmesh = new NavMesh(msg.navType);
-                if (msg.obstacles) {
-                    for (const obstacle of msg.obstacles) {
-                        navmesh.addObstacle(obstacle);
-                    }
-                }
-                self.postMessage({ type: 'READY' });
-                break;
-            }
-            case 'FIND_PATH': {
-                if (!navmesh) {
-                    throw new Error('NavMesh not initialized');
-                }
-                const start = performance.now();
-                const path = navmesh.findPath({ from: msg.from, to: msg.to });
-                const duration = performance.now() - start;
-                const result = {
-                    type: 'PATH_RESULT',
-                    id: msg.id,
-                    path,
-                    duration,
-                };
-                self.postMessage(result);
-                break;
-            }
-            case 'ADD_OBSTACLE': {
-                if (!navmesh) {
-                    throw new Error('NavMesh not initialized');
-                }
-                const obstacleId = navmesh.addObstacle(msg.obstacle);
-                const result = {
-                    type: 'OBSTACLE_ADDED',
-                    obstacleId,
-                };
-                self.postMessage(result);
-                break;
-            }
-            case 'REMOVE_OBSTACLE': {
-                if (!navmesh) {
-                    throw new Error('NavMesh not initialized');
-                }
-                navmesh.removeObstacle(msg.obstacleId);
-                self.postMessage({ type: 'OBSTACLE_REMOVED' });
-                break;
-            }
-            case 'MOVE_OBSTACLE': {
-                if (!navmesh) {
-                    throw new Error('NavMesh not initialized');
-                }
-                navmesh.moveObstacle(msg.obstacleId, msg.pos);
-                self.postMessage({ type: 'OBSTACLE_MOVED' });
-                break;
-            }
-        }
-    }
-    catch (error) {
-        self.postMessage({
-            type: 'ERROR',
-            error: error instanceof Error ? error.message : String(error)
-        });
-    }
-};

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

@@ -1 +0,0 @@
-export * from './pooled-codec';

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

@@ -1,410 +0,0 @@
-import { BinaryCodec } from "../binary-codec";
-/**
- * Generic object pool for reusing objects and minimizing allocations.
- * @template T Type of objects stored in the pool.
- */
-export class ObjectPool {
-    /**
-     * @param factory Function to create a new instance when the pool is empty.
-     */
-    constructor(factory) {
-        this.factory = factory;
-        this.pool = [];
-    }
-    /**
-     * Acquire an object from the pool, or create a new one if empty.
-     * @returns {T} The acquired object.
-     */
-    acquire() {
-        return this.pool.pop() ?? this.factory();
-    }
-    /**
-     * Return an object to the pool for reuse.
-     * @param {T} obj Object to release.
-     */
-    release(obj) {
-        this.pool.push(obj);
-    }
-    /**
-     * Return multiple objects to the pool at once.
-     * @param {T[]} objs Array of objects to release.
-     */
-    releaseAll(objs) {
-        this.pool.push(...objs);
-    }
-}
-/**
- * Pooled decoder for single objects or nested schemas.
- * @template T Type of object to decode.
- */
-export class PooledDecoder {
-    /**
-     * @param schema Schema or record describing the object structure.
-     * @param initial Initial object used as template for pooling.
-     */
-    constructor(schema) {
-        this.schema = schema;
-        this.pool = new ObjectPool(() => this.createNil());
-    }
-    createNil() {
-        const obj = {};
-        for (const key of Object.keys(this.schema)) {
-            const field = this.schema[key];
-            obj[key] = "toNil" in field ? field.toNil() : undefined;
-        }
-        return obj;
-    }
-    /**
-     * Decode a buffer into a pooled object.
-     * @param {Uint8Array} buf Buffer to decode.
-     * @returns {T} Decoded object.
-     */
-    decode(buf) {
-        const obj = this.pool.acquire();
-        this.decodeInto(buf, obj);
-        return obj;
-    }
-    /**
-     * Decode a buffer into a provided target object.
-     * @param {Uint8Array} buf Buffer to decode.
-     * @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) {
-                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) {
-                const result = field.decode(buf.subarray(offset));
-                target[key] = result.value;
-                offset += result.bytesRead;
-            }
-            else {
-                // 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;
-            }
-        }
-    }
-    /**
-     * Release a decoded object back to the pool.
-     * @param {T} obj Object to release.
-     */
-    release(obj) {
-        this.pool.release(obj);
-    }
-}
-/**
- * Pooled decoder for arrays of objects.
- * @template T Type of object to decode.
- */
-export class PooledArrayDecoder {
-    /**
-     * @param schema Schema or record describing object structure.
-     * @param initial Initial object used as template for pooling.
-     */
-    constructor(schema) {
-        this.pooledDecoder = new PooledDecoder(schema);
-    }
-    /**
-     * Decode multiple buffers into pooled objects.
-     * @param {Uint8Array[]} buffers Array of buffers to decode.
-     * @returns {T[]} Array of decoded objects.
-     */
-    decodeAll(buffers) {
-        return buffers.map((b) => this.pooledDecoder.decode(b));
-    }
-    /**
-     * Release multiple decoded objects back to the pool.
-     * @param {T[]} objs Array of objects to release.
-     */
-    releaseAll(objs) {
-        objs.forEach((o) => this.pooledDecoder.release(o));
-    }
-}
-/**
- * Pooled encoder for single objects or nested schemas.
- * @template T Type of object to encode.
- */
-export class PooledEncoder {
-    /**
-     * @param schema Schema or record describing object structure.
-     * @param bufferSize Size of buffer to allocate per encoding (default: 1024).
-     */
-    constructor(schema, bufferSize = 1024) {
-        this.schema = schema;
-        this.bufferSize = bufferSize;
-        this.pool = new ObjectPool(() => new Uint8Array(bufferSize));
-    }
-    /**
-     * Encode an object into a pooled buffer.
-     * @param {T} obj Object to encode.
-     * @returns {Uint8Array} Encoded buffer.
-     */
-    encode(obj) {
-        const buf = this.pool.acquire();
-        let offset = 0;
-        for (const key of Object.keys(this.schema)) {
-            const field = this.schema[key];
-            if ("encode" in field) {
-                const nested = field.encode(obj[key]);
-                buf.set(nested, offset);
-                offset += nested.length;
-            }
-            else if ("encodeAll" in field) {
-                const nestedArr = field.encodeAll(obj[key]);
-                let arrOffset = 0;
-                for (const item of nestedArr) {
-                    buf.set(item, offset + arrOffset);
-                    arrOffset += item.length;
-                }
-                offset += arrOffset;
-            }
-            else {
-                const tmp = BinaryCodec.encode({ [key]: field }, { [key]: obj[key] });
-                buf.set(tmp, offset);
-                offset += tmp.length;
-            }
-        }
-        return buf.subarray(0, offset);
-    }
-    /**
-     * Release a buffer back to the pool.
-     * @param {Uint8Array} buf Buffer to release.
-     */
-    release(buf) {
-        this.pool.release(buf);
-    }
-}
-/**
- * Combined pooled encoder and decoder for a single schema.
- * Provides a convenient wrapper around PooledEncoder and PooledDecoder.
- * @template S Schema type
- */
-export class PooledCodec {
-    /**
-     * @param schema Schema describing the object structure.
-     */
-    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 data Object to encode.
-     * @returns Encoded buffer.
-     */
-    encode(data) {
-        return this.encoder.encode(data);
-    }
-    /**
-     * Decode a buffer into a pooled 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 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/index.js

@@ -1 +0,0 @@
-export * from './prediction';

package/dist/core/prediction/prediction.js

@@ -1,99 +0,0 @@
-/**
- * @template T
- * @description
- * Tracks client-side intents that have been sent to the server but not yet confirmed.
- * Used for prediction and reconciliation in a server-authoritative architecture.
- */
-export class IntentTracker {
-    constructor() {
-        this.tracker = new Map();
-    }
-    get size() {
-        return this.tracker.size;
-    }
-    /**
-     * Adds a new intent for a specific tick.
-     * @param {number} tick - The tick number associated with the intent.
-     * @param {T} intent - The intent data.
-     */
-    track(tick, intent) {
-        if (!this.tracker.has(tick)) {
-            this.tracker.set(tick, []);
-        }
-        this.tracker.get(tick).push(intent);
-        return intent;
-    }
-    /**
-     * Removes all intents up to and including a given tick.
-     * Returns the remaining intents in ascending tick order.
-     * @param {number} tick - The tick up to which intents should be dropped.
-     * @returns {T[]} Array of remaining intents.
-     */
-    dropUpTo(tick) {
-        const remaining = [];
-        for (const [t, intents] of this.tracker) {
-            if (t <= tick)
-                this.tracker.delete(t);
-            else
-                remaining.push([t, intents]);
-        }
-        // sort by tick ascending
-        remaining.sort(([a], [b]) => a - b);
-        return remaining.map(([_, intents]) => intents).flat();
-    }
-    /**
-     * Returns all currently tracked intents in ascending tick order.
-     * @returns {T[]}
-     */
-    values() {
-        return Array.from(this.tracker.entries())
-            .sort(([a], [b]) => a - b)
-            .map(([_, intents]) => intents)
-            .flat();
-    }
-}
-/**
- * @template T,U
- * @description
- * Handles client-side reconciliation of authoritative snapshots with unconfirmed intents.
- * Used for prediction correction in server-authoritative multiplayer games.
- */
-export class Reconciliator {
-    /**
-     * @param {Object} options - Callbacks for applying snapshot state and replaying intents.
-     * @param {(snapshotState: U) => void} options.onLoadState - Called to load authoritative snapshot state.
-     * @param {(remainingIntents: T[]) => void} options.onReplay - Called to reapply remaining intents for prediction.
-     */
-    constructor(options) {
-        this.options = options;
-        this.tracker = new IntentTracker();
-    }
-    /**
-     * Adds a new intent to the tracker.
-     * @param {number} tick - Tick number associated with the intent.
-     * @param {T} intent - The intent data.
-     */
-    trackIntent(tick, intent) {
-        this.tracker.track(tick, intent);
-    }
-    /**
-     * Called when an authoritative snapshot is received from the server.
-     * Resets client state and replays unconfirmed intents.
-     * @param {Object} snapshot - The snapshot from the server.
-     * @param {number} snapshot.tick - Tick number of the snapshot.
-     * @param {U} snapshot.state - The authoritative state.
-     */
-    onSnapshot(snapshot) {
-        // 1. Load authoritative state
-        this.options.onLoadState(snapshot.state);
-        // 2. Remove confirmed intents and get remaining
-        const remainingIntents = this.tracker.dropUpTo(snapshot.tick);
-        // 3. Only replay if there are actually remaining intents
-        if (remainingIntents.length > 0) {
-            this.options.onReplay(remainingIntents);
-        }
-    }
-    replay(intents) {
-        this.options.onReplay(intents);
-    }
-}

package/dist/core.esm.js

@@ -1 +0,0 @@
-var J=Object.defineProperty;var Q=(l,e)=>()=>(l&&(e=l(l=0)),e);var ee=(l,e)=>{for(var t in e)J(l,t,{get:e[t],enumerable:!0})};var W={};ee(W,{NavMeshWorkerPool:()=>E});var E,j=Q(()=>{E=class{constructor(e,t,s="grid",r=[]){this.poolSize=e;this.workerPath=t;this.navType=s;this.obstacles=r;this.workers=[];this.nextWorkerIndex=0;this.requestId=0;this.pendingRequests=new Map;this.initialized=!1}async init(){if(this.initialized)return;let e=[];for(let t=0;t<this.poolSize;t++){let s=new Worker(this.workerPath,{type:"module"});s.onmessage=o=>{let n=o.data;if(n.type==="PATH_RESULT"){let i=this.pendingRequests.get(n.id);i&&(i.resolve(n.path),this.pendingRequests.delete(n.id))}else if(n.type==="ERROR")for(let[i,a]of this.pendingRequests.entries())a.reject(new Error(n.error)),this.pendingRequests.delete(i)},s.onerror=o=>{console.error("Worker error:",o);for(let[n,i]of this.pendingRequests.entries())i.reject(new Error("Worker error")),this.pendingRequests.delete(n)},this.workers.push(s);let r=new Promise(o=>{let n=i=>{i.data.type==="READY"&&(s.removeEventListener("message",n),o())};s.addEventListener("message",n)});s.postMessage({type:"INIT",navType:this.navType,obstacles:this.obstacles}),e.push(r)}await Promise.all(e),this.initialized=!0}async findPath(e,t){if(!this.initialized)throw new Error("Worker pool not initialized. Call init() first.");let s=this.requestId++,r=this.workers[this.nextWorkerIndex];return this.nextWorkerIndex=(this.nextWorkerIndex+1)%this.workers.length,new Promise((o,n)=>{this.pendingRequests.set(s,{id:s,from:e,to:t,resolve:o,reject:n}),r.postMessage({type:"FIND_PATH",id:s,from:e,to:t})})}async addObstacle(e){if(!this.initialized)throw new Error("Worker pool not initialized. Call init() first.");let t=this.workers.map(r=>new Promise(o=>{let n=i=>{i.data.type==="OBSTACLE_ADDED"&&(r.removeEventListener("message",n),o(i.data.obstacleId))};r.addEventListener("message",n),r.postMessage({type:"ADD_OBSTACLE",obstacle:e})}));return(await Promise.all(t))[0]}async removeObstacle(e){if(!this.initialized)throw new Error("Worker pool not initialized. Call init() first.");let t=this.workers.map(s=>new Promise(r=>{let o=n=>{n.data.type==="OBSTACLE_REMOVED"&&(s.removeEventListener("message",o),r())};s.addEventListener("message",o),s.postMessage({type:"REMOVE_OBSTACLE",obstacleId:e})}));await Promise.all(t)}async moveObstacle(e,t){if(!this.initialized)throw new Error("Worker pool not initialized. Call init() first.");let s=this.workers.map(r=>new Promise(o=>{let n=i=>{i.data.type==="OBSTACLE_MOVED"&&(r.removeEventListener("message",n),o())};r.addEventListener("message",n),r.postMessage({type:"MOVE_OBSTACLE",obstacleId:e,pos:t})}));await Promise.all(s)}terminate(){for(let e of this.workers)e.terminate();this.workers=[],this.pendingRequests.clear(),this.initialized=!1}get pendingCount(){return this.pendingRequests.size}get size(){return this.workers.length}}});var N=Symbol("schemaSize");function C(l){let e=l[N];if(e!==void 0)return e;let t=0;for(let s of Object.keys(l))t+=l[s].size;return l[N]=t,t}var S=class{static encodeInto(e,t){let s=C(e),r=new ArrayBuffer(s),o=new DataView(r),n=0;for(let i of Object.keys(e)){let a=e[i];a.write(o,n,t[i]),n+=a.size}return new Uint8Array(r)}static decodeInto(e,t,s){let r=C(e);if(t.byteLength<r)throw new RangeError(`Buffer too small: expected ${r} bytes, got ${t.byteLength}`);let o=new DataView(t.buffer,t.byteOffset,t.byteLength),n=0;for(let i of Object.keys(e)){let a=e[i];s[i]=a.read(o,n),n+=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,r){let n=new TextEncoder().encode(r);if(n.length>e)throw new RangeError(`String too long, max ${e} bytes`);t.setUint16(s,n.length,!1);for(let i=0;i<n.length;i++)t.setUint8(s+2+i,n[i]);for(let i=n.length;i<e;i++)t.setUint8(s+2+i,0)},read(t,s){let r=t.getUint16(s,!1),o=new Uint8Array(r);for(let n=0;n<r;n++)o[n]=t.getUint8(s+2+n);return new TextDecoder().decode(o)},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 S{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 D=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=r=>{t(r),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 r of s)r(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 _=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}get alpha(){return Math.min(this.accumulatedTime/(1/this.rate),1)}};function me(l={}){let{prefix:e="",size:t=16}=l,s=Math.max(t-e.length,8),r=Math.ceil(s/8),n=crypto.getRandomValues(new Uint32Array(r)).reduce((i,a)=>i+a.toString(16).padStart(8,"0"),"");return n=n.slice(0,s).padStart(s,"0"),`${e}${n}`}function xe(l,e,t){return l+(e-l)*t}var v=class{constructor(e){this.update=e;this.last=performance.now();this.running=!1;this.loop=()=>{if(!this.running)return;let e=performance.now(),t=(e-this.last)/1e3;this.last=e,this.update(t),setImmediate(this.loop)}}start(){this.running=!0,this.last=performance.now(),this.loop()}stop(){this.running=!1}};var w=class{constructor(e){this.update=e;this.last=performance.now();this.running=!1;this.rafId=null;this.loop=()=>{if(!this.running)return;let e=performance.now(),t=(e-this.last)/1e3;this.last=e,this.update(t),requestAnimationFrame(this.loop)}}start(){this.running=!0,this.last=performance.now(),this.rafId=requestAnimationFrame(this.loop)}stop(){this.running=!1,this.rafId!==null&&(cancelAnimationFrame(this.rafId),this.rafId=null)}};var te=1,T=class{constructor(e){this.update=e;this.last=performance.now();this.running=!1;this.loop=()=>{if(!this.running)return;let e=performance.now(),t=(e-this.last)/1e3;this.last=e,this.update(t),setTimeout(this.loop,te)}}start(){this.running=!0,this.last=performance.now(),this.loop()}stop(){this.running=!1}};function Ue(l,e){return l==="server-immediate"?new v(e):l==="server-timeout"?new T(e):new w(e)}var se=[{x:1,y:0},{x:-1,y:0},{x:0,y:1},{x:0,y:-1}],z=l=>({x:Math.floor(l.x),y:Math.floor(l.y)}),L=l=>({x:l.x+.5,y:l.y+.5}),re=(()=>{let l=1;return()=>l++})(),b=(l,e)=>l&65535|(e&65535)<<16,M=l=>({x:l<<16>>16,y:l>>16}),F=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 r=(e+1>>1)-1,o=this.heap[r];if(s>=this.scoreFn(o))break;this.heap[r]=t,this.heap[e]=o,e=r}}sinkDown(e){let t=this.heap.length,s=this.heap[e],r=this.scoreFn(s);for(;;){let o=e+1<<1,n=o-1,i=null,a;if(n<t){let c=this.heap[n];a=this.scoreFn(c),a<r&&(i=n)}if(o<t){let c=this.heap[o];this.scoreFn(c)<(i===null?r:a)&&(i=o)}if(i===null)break;this.heap[e]=this.heap[i],this.heap[i]=s,e=i}}},P=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),r=Math.floor(t/this.cellSize);return b(s,r)}add(e,t){let s=this.getCellsForObstacle(t);for(let r of s)this.grid.has(r)||this.grid.set(r,new Set),this.grid.get(r).add(e);this.obstacleCells.set(e,s)}remove(e){let t=this.obstacleCells.get(e);if(t){for(let s of t){let r=this.grid.get(s);r&&(r.delete(e),r.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,r=Math.floor((e.pos.x-s)/this.cellSize),o=Math.floor((e.pos.x+s)/this.cellSize),n=Math.floor((e.pos.y-s)/this.cellSize),i=Math.floor((e.pos.y+s)/this.cellSize);for(let a=r;a<=o;a++)for(let c=n;c<=i;c++)t.add(b(a,c))}else if(e.type==="rect"){let s=e.pos.x+e.size.x/2,r=e.pos.y+e.size.y/2,o=e.size.x/2,n=e.size.y/2,i=Math.sqrt(o*o+n*n),a=Math.floor((s-i)/this.cellSize),c=Math.floor((s+i)/this.cellSize),u=Math.floor((r-i)/this.cellSize),d=Math.floor((r+i)/this.cellSize);for(let h=a;h<=c;h++)for(let f=u;f<=d;f++)t.add(b(h,f))}else if(e.type==="polygon"){let s=B(e),r=Math.floor(s.minX/this.cellSize),o=Math.floor(s.maxX/this.cellSize),n=Math.floor(s.minY/this.cellSize),i=Math.floor(s.maxY/this.cellSize);for(let a=r;a<=o;a++)for(let c=n;c<=i;c++)t.add(b(a,c))}return t}};function Y(l,e){let t=l.x-e.pos.x,s=l.y-e.pos.y;return t*t+s*s<=e.radius*e.radius}function X(l,e){let t=e.pos.x+e.size.x/2,s=e.pos.y+e.size.y/2;if(e.rotation){let r=Math.cos(-e.rotation),o=Math.sin(-e.rotation),n=l.x-t,i=l.y-s,a=n*r-i*o,c=n*o+i*r;return Math.abs(a)<=e.size.x/2&&Math.abs(c)<=e.size.y/2}return l.x>=e.pos.x&&l.y>=e.pos.y&&l.x<=e.pos.x+e.size.x&&l.y<=e.pos.y+e.size.y}function K(l,e){let t=!1,s=e.points,r=e.rotation?Math.cos(e.rotation):1,o=e.rotation?Math.sin(e.rotation):0;for(let n=0,i=s.length-1;n<s.length;i=n++){let a=s[n].x,c=s[n].y,u=s[i].x,d=s[i].y;if(e.rotation){let f=a*r-c*o,m=a*o+c*r,p=u*r-d*o,k=u*o+d*r;a=f,c=m,u=p,d=k}a+=e.pos.x,c+=e.pos.y,u+=e.pos.x,d+=e.pos.y,c>l.y!=d>l.y&&l.x<(u-a)*(l.y-c)/(d-c)+a&&(t=!t)}return t}function B(l){let e=1/0,t=1/0,s=-1/0,r=-1/0,o=l.rotation?Math.cos(l.rotation):1,n=l.rotation?Math.sin(l.rotation):0;for(let i of l.points){let a=i.x,c=i.y;if(l.rotation){let u=a*o-c*n,d=a*n+c*o;a=u,c=d}a+=l.pos.x,c+=l.pos.y,e=Math.min(e,a),t=Math.min(t,c),s=Math.max(s,a),r=Math.max(r,c)}return{minX:e,minY:t,maxX:s,maxY:r}}var U=class{constructor(){this.items=new Map;this.spatial=new P(1);this._cachedItems=[];this.dirty=!0;this.version=0}add(e){let t=re(),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 r={...s,pos:{...t}};this.items.set(e,r),this.spatial.add(e,r),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 r=this.items.get(s);if(!(!r||r.solid===!1)&&(r.type==="circle"&&Y(e,r)||r.type==="rect"&&X(e,r)||r.type==="polygon"&&K(e,r)))return r}}get values(){return this.dirty?(this._cachedItems=[...this.items.values()],this.dirty=!1,this._cachedItems):this._cachedItems}},I=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),r=Math.floor(e.pos.y);for(let o=-t;o<=t;o++)for(let n=-t;n<=t;n++){let i=s+o,a=r+n,c={x:i+.5,y:a+.5};Y(c,e)&&this.blocked.add(b(i,a))}}else if(e.type==="rect"){let t=e.pos.x+e.size.x/2,s=e.pos.y+e.size.y/2,r=e.size.x/2,o=e.size.y/2,n=Math.sqrt(r*r+o*o),i=Math.floor(t-n),a=Math.ceil(t+n),c=Math.floor(s-n),u=Math.ceil(s+n);for(let d=i;d<=a;d++)for(let h=c;h<=u;h++){let f={x:d+.5,y:h+.5};X(f,e)&&this.blocked.add(b(d,h))}}else if(e.type==="polygon"){let t=B(e),s=Math.floor(t.minX),r=Math.ceil(t.maxX),o=Math.floor(t.minY),n=Math.ceil(t.maxY);for(let i=s;i<=r;i++)for(let a=o;a<=n;a++){let c={x:i+.5,y:a+.5};K(c,e)&&this.blocked.add(b(i,a))}}}}findPath(e,t){return $(z(e),z(t),(s,r)=>!this.blocked.has(b(s,r))).map(L)}},V=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),r=!1;for(let n=1;n<=s;n++){let i=n/s,a={x:e.x+(t.x-e.x)*i,y:e.y+(t.y-e.y)*i};if(this.obstacles.at(a)){r=!0;break}}return r?$(z(e),z(t),(n,i)=>{let a={x:n+.5,y:i+.5};return!this.obstacles.at(a)}).map(L):[e,t]}},q=class{constructor(e,t){this.type=e;this.lastVersion=-1;this.pendingPaths=0;this.AUTO_WORKER_THRESHOLD=20;this.obstacles=new U,this.options={workers:t?.workers??!1,workerPoolSize:t?.workerPoolSize??4,workerPath:t?.workerPath??"./navmesh.worker.js"},e==="grid"&&(this.grid=new I(this.obstacles)),e==="graph"&&(this.graph=new V(this.obstacles)),this.options.workers===!0&&this.initWorkerPool()}async initWorkerPool(){if(!this.workerPool)try{let{NavMeshWorkerPool:e}=await Promise.resolve().then(()=>(j(),W));this.workerPool=new e(this.options.workerPoolSize,this.options.workerPath,this.type,this.obstacles.values),await this.workerPool.init()}catch(e){console.warn("Failed to initialize worker pool, falling back to sync:",e),this.options.workers=!1}}shouldUseWorkers(){return this.options.workers===!1?!1:this.options.workers===!0?!0:this.pendingPaths>=this.AUTO_WORKER_THRESHOLD}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.shouldUseWorkers()&&this.workerPool?(this.pendingPaths++,this.findPathAsync(e,t).finally(()=>{this.pendingPaths--})):(this.rebuild(),this.type==="grid"?this.grid.findPath(e,t):this.graph.findPath(e,t))}async findPathAsync(e,t){return this.options.workers==="auto"&&!this.workerPool&&await this.initWorkerPool(),this.workerPool?this.workerPool.findPath(e,t):(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)}dispose(){this.workerPool&&(this.workerPool.terminate(),this.workerPool=void 0)}getWorkerStatus(){return{workersEnabled:this.options.workers,workerPoolActive:!!this.workerPool,pendingPaths:this.pendingPaths,usingWorkersNow:this.shouldUseWorkers()}}};function $(l,e,t){let s=new Map,r=new Map,o=new Set,n=new Set,i=d=>b(d.x,d.y),a=(d,h)=>Math.abs(d.x-h.x)+Math.abs(d.y-h.y),c=new F(d=>{let h=M(d);return r.get(d)+a(h,e)}),u=i(l);for(r.set(u,0),c.push(u),n.add(u);c.size>0;){let d=c.pop();n.delete(d);let h=M(d);if(h.x===e.x&&h.y===e.y)return ne(s,h);o.add(d);for(let f of se){let m={x:h.x+f.x,y:h.y+f.y};if(!t(m.x,m.y))continue;let p=i(m);if(o.has(p))continue;let k=r.get(d)+1;k<(r.get(p)??1/0)&&(r.set(p,k),s.set(p,d),n.has(p)||(c.push(p),n.add(p)))}}return[]}function ne(l,e){let t=[e],s=b(e.x,e.y);for(;l.has(s);)s=l.get(s),t.push(M(s));return t.reverse()}var g=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)}},O=class{constructor(e){this.schema=e;this.pool=new g(()=>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 r of Object.keys(this.schema)){let o=this.schema[r];if("decodeAll"in o){let n=o.decodeAll(e.subarray(s));t[r]=n.value,s+=n.bytesRead}else if("decodeField"in o){let n=o.decodeField(e.subarray(s));t[r]=n.value,s+=n.bytesRead}else if("decode"in o){let n=o.decode(e.subarray(s));t[r]=n.value,s+=n.bytesRead}else{let n=o.size||0,i=e.subarray(s,s+n);x.decodeInto({[r]:o},i,t),s+=n}}}release(e){this.pool.release(e)}},H=class{constructor(e){this.pooledDecoder=new O(e)}decodeAll(e){return e.map(t=>this.pooledDecoder.decode(t))}releaseAll(e){e.forEach(t=>this.pooledDecoder.release(t))}},A=class{constructor(e,t=1024){this.schema=e;this.bufferSize=t;this.pool=new g(()=>new Uint8Array(t))}encode(e){let t=this.pool.acquire(),s=0;for(let r of Object.keys(this.schema)){let o=this.schema[r];if("encode"in o){let n=o.encode(e[r]);t.set(n,s),s+=n.length}else if("encodeAll"in o){let n=o.encodeAll(e[r]),i=0;for(let a of n)t.set(a,s+i),i+=a.length;s+=i}else{let n=x.encode({[r]:o},{[r]:e[r]});t.set(n,s),s+=n.length}}return t.subarray(0,s)}release(e){this.pool.release(e)}},G=class{constructor(e){this.schema=e;this.encoder=new A(e),this.decoder=new O(e)}calculateSize(e){let t=0;for(let s of Object.keys(this.schema)){let r=this.schema[s];"size"in r?t+=r.size:"calculateSize"in r&&(t+=r.calculateSize(e[s]))}return t}encodeInto(e,t,s){let r=new DataView(t.buffer,t.byteOffset),o=s;for(let n of Object.keys(this.schema)){let i=this.schema[n];if("write"in i)i.write(r,o,e[n]),o+=i.size;else if("encodeInto"in i){let a=i.encodeInto(e[n],t,o);o+=a}else if("encode"in i){let a=i.encode(e[n]);t.set(a,o),o+=a.length}}return o-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 a of Object.keys(e)){let c=e[a];t+=c.size||0}let s=new g(()=>new Uint8Array(16384)),r=new g(()=>{let a={};for(let c of Object.keys(e)){let u=e[c];a[c]="toNil"in u?u.toNil():void 0}return a}),o=new g(()=>[]),n=null,i=null;return{__arrayType:void 0,calculateSize(a){return 2+a.length*t},encodeInto(a,c,u){let d=new DataView(c.buffer,c.byteOffset);d.setUint16(u,a.length,!1);let h=u+2;for(let f of a)for(let m of Object.keys(e)){let p=e[m];p.write(d,h,f[m]),h+=p.size}return h-u},encode(a){let c=2+a.length*t,u=s.acquire();u.length<c&&(s.release(u),u=new Uint8Array(Math.max(c,u.length*2))),(!n||n.buffer!==u.buffer)&&(n=new DataView(u.buffer,u.byteOffset)),n.setUint16(0,a.length,!1);let d=2;for(let f of a)for(let m of Object.keys(e)){let p=e[m];p.write(n,d,f[m]),d+=p.size}let h=new Uint8Array(d);return h.set(u.subarray(0,d)),s.release(u),h},decodeField(a){let c=a[0]<<8|a[1],u=o.acquire();u.length=c,(!i||i.buffer!==a.buffer||i.byteOffset!==a.byteOffset)&&(i=new DataView(a.buffer,a.byteOffset));let d=2;for(let h=0;h<c;h++){let f=r.acquire();for(let m of Object.keys(e)){let p=e[m];f[m]=p.read(i,d),d+=p.size}u[h]=f}return{value:u,bytesRead:d}},decode(a){return this.decodeField(a).value},toNil(){return[]}}}};var R=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,r]of this.tracker)s<=e?this.tracker.delete(s):t.push([s,r]);return t.sort(([s],[r])=>s-r),t.map(([s,r])=>r).flat()}values(){return Array.from(this.tracker.entries()).sort(([e],[t])=>e-t).map(([e,t])=>t).flat()}},Z=class{constructor(e){this.options=e;this.tracker=new R}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)}replay(e){this.options.onReplay(e)}};export{S as BaseBinaryCodec,x as BinaryCodec,y as BinaryPrimitives,D as EventSystem,_ as FixedTicker,v as ImmediateDriver,R as IntentTracker,q as NavMesh,g as ObjectPool,H as PooledArrayDecoder,G as PooledCodec,O as PooledDecoder,A as PooledEncoder,w as RafDriver,Z as Reconciliator,T as TimeoutDriver,Ue as createDriver,me as generateId,xe as lerp};