@flare-engine/ecs 0.2.1 → 0.3.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -1 +1 @@
1
- {"version":3,"sources":["../src/component.ts","../src/query.ts","../src/world.ts","../src/system.ts","../src/prefab.ts","../src/fsm.ts","../src/components.ts","../src/systems.ts"],"sourcesContent":["/**\n * Component definition and factory.\n *\n * Components are plain data objects. Each component type gets a unique\n * bit for archetype-based query matching.\n */\n\n/** A unique component definition. */\nexport interface ComponentDef<T> {\n /** Internal unique ID (auto-assigned). */\n readonly id: number;\n /** Bitmask for this component (1 << id). */\n readonly bit: number;\n /** Component name for debugging. */\n readonly name: string;\n /** Create a new instance with default values. */\n create(): T;\n}\n\nlet nextComponentId = 0;\n\n/**\n * Define a new component type.\n *\n * @param name Debug name for the component.\n * @param defaults Factory function returning default values, or undefined for tag components.\n */\nexport function defineComponent<T = undefined>(name: string, defaults?: () => T): ComponentDef<T> {\n const id = nextComponentId++;\n if (id >= 32) {\n throw new Error(`Maximum 32 component types exceeded (defining \"${name}\")`);\n }\n return {\n id,\n bit: 1 << id,\n name,\n create: defaults ?? (() => undefined as T),\n };\n}\n\n/**\n * Reset the component ID counter. Only for testing.\n * @internal\n */\nexport function _resetComponentIds(): void {\n nextComponentId = 0;\n}\n","import { Signal } from '@flare-engine/events';\nimport type { ComponentDef } from './component.js';\n\n/**\n * Query matches entities based on component archetypes.\n *\n * Uses bitmask matching: entity archetype & requiredMask === requiredMask\n * and entity archetype & excludedMask === 0.\n */\nexport class Query {\n /** Bitmask of required components. */\n readonly requiredMask: number;\n /** Bitmask of excluded components. */\n readonly excludedMask: number;\n\n /** Fires when an entity is added to this query's results. */\n readonly onEntityAdded = new Signal<number>();\n /** Fires when an entity is removed from this query's results. */\n readonly onEntityRemoved = new Signal<number>();\n\n /** Sorted array of matching entity IDs. */\n private entities: number[] = [];\n /** Set for O(1) membership check. */\n private entitySet = new Set<number>();\n\n constructor(requiredMask: number, excludedMask: number) {\n this.requiredMask = requiredMask;\n this.excludedMask = excludedMask;\n }\n\n /** Check if an archetype matches this query. */\n matches(archetype: number): boolean {\n return (\n (archetype & this.requiredMask) === this.requiredMask && (archetype & this.excludedMask) === 0\n );\n }\n\n /** @internal — called by World when an entity's archetype changes. */\n _check(entityId: number, archetype: number): void {\n const isMatch = this.matches(archetype);\n const wasMatch = this.entitySet.has(entityId);\n\n if (isMatch && !wasMatch) {\n this.entitySet.add(entityId);\n this.entities.push(entityId);\n this.onEntityAdded.emit(entityId);\n } else if (!isMatch && wasMatch) {\n this.entitySet.delete(entityId);\n const idx = this.entities.indexOf(entityId);\n if (idx !== -1) this.entities.splice(idx, 1);\n this.onEntityRemoved.emit(entityId);\n }\n }\n\n /** @internal — called by World when an entity is removed entirely. */\n _remove(entityId: number): void {\n if (this.entitySet.has(entityId)) {\n this.entitySet.delete(entityId);\n const idx = this.entities.indexOf(entityId);\n if (idx !== -1) this.entities.splice(idx, 1);\n this.onEntityRemoved.emit(entityId);\n }\n }\n\n /** Iterate matching entity IDs. */\n [Symbol.iterator](): IterableIterator<number> {\n return this.entities[Symbol.iterator]();\n }\n\n /** Number of matching entities. */\n get count(): number {\n return this.entities.length;\n }\n\n /** Check if an entity matches this query. */\n has(entityId: number): boolean {\n return this.entitySet.has(entityId);\n }\n}\n\n/** Builder for creating queries with .with() / .without() chaining. */\nexport class QueryBuilder {\n private required = 0;\n private excluded = 0;\n\n with(...components: ComponentDef<unknown>[]): this {\n for (const c of components) {\n this.required |= c.bit;\n }\n return this;\n }\n\n without(...components: ComponentDef<unknown>[]): this {\n for (const c of components) {\n this.excluded |= c.bit;\n }\n return this;\n }\n\n /** Build the query (called internally by World). */\n build(): Query {\n return new Query(this.required, this.excluded);\n }\n}\n","import type { ComponentDef } from './component.js';\nimport { Query, QueryBuilder } from './query.js';\n\n/**\n * World is the central ECS container.\n *\n * Entities are integer IDs. Components are stored in per-component Maps.\n * Archetype bitmasks enable fast query matching.\n */\nexport class World {\n private nextId = 1;\n private archetypes = new Map<number, number>(); // entityId → bitmask\n private componentStores = new Map<number, Map<number, unknown>>(); // componentId → (entityId → data)\n private queries: Query[] = [];\n private systems: {\n fn: (world: World, dt: number) => void;\n priority: number;\n }[] = [];\n private systemsSorted = false;\n\n /** Create a new entity. Returns the entity ID. */\n spawn(): number {\n const id = this.nextId++;\n this.archetypes.set(id, 0);\n return id;\n }\n\n /** Remove an entity and all its components. */\n destroy(entityId: number): void {\n const arch = this.archetypes.get(entityId);\n if (arch === undefined) return;\n\n // Remove from all component stores\n for (const [, store] of this.componentStores) {\n store.delete(entityId);\n }\n\n this.archetypes.delete(entityId);\n\n // Notify queries\n for (const query of this.queries) {\n query._remove(entityId);\n }\n }\n\n /** Add a component to an entity. */\n add<T>(entityId: number, def: ComponentDef<T>, data?: T): void {\n const arch = this.archetypes.get(entityId);\n if (arch === undefined) return;\n\n // Store component data\n let store = this.componentStores.get(def.id);\n if (!store) {\n store = new Map();\n this.componentStores.set(def.id, store);\n }\n store.set(entityId, data !== undefined ? data : def.create());\n\n // Update archetype\n const newArch = arch | def.bit;\n this.archetypes.set(entityId, newArch);\n\n // Notify queries\n for (const query of this.queries) {\n query._check(entityId, newArch);\n }\n }\n\n /** Remove a component from an entity. */\n remove<T>(entityId: number, def: ComponentDef<T>): void {\n const arch = this.archetypes.get(entityId);\n if (arch === undefined) return;\n\n const store = this.componentStores.get(def.id);\n if (store) store.delete(entityId);\n\n const newArch = arch & ~def.bit;\n this.archetypes.set(entityId, newArch);\n\n // Notify queries\n for (const query of this.queries) {\n query._check(entityId, newArch);\n }\n }\n\n /** Get component data for an entity. */\n get<T>(entityId: number, def: ComponentDef<T>): T | undefined {\n const store = this.componentStores.get(def.id);\n return store?.get(entityId) as T | undefined;\n }\n\n /** Check if entity has a component. */\n has(entityId: number, def: ComponentDef<unknown>): boolean {\n const arch = this.archetypes.get(entityId);\n return arch !== undefined && (arch & def.bit) !== 0;\n }\n\n /** Check if entity exists. */\n exists(entityId: number): boolean {\n return this.archetypes.has(entityId);\n }\n\n /**\n * Create a query. Queries auto-update as entities change.\n * Use the QueryBuilder-style chaining:\n * world.query(Position, Velocity)\n * Or use the builder:\n * world.queryBuilder().with(Position).without(Dead).build()\n */\n query(...components: ComponentDef<unknown>[]): Query {\n let mask = 0;\n for (const c of components) {\n mask |= c.bit;\n }\n const q = new Query(mask, 0);\n this.queries.push(q);\n\n // Populate with existing entities\n for (const [entityId, arch] of this.archetypes) {\n q._check(entityId, arch);\n }\n\n return q;\n }\n\n /** Create a QueryBuilder for complex queries (with/without). */\n queryBuilder(): QueryBuilder {\n return new _WorldQueryBuilder(this);\n }\n\n /** Register a system function. Lower priority runs first. */\n addSystem(fn: (world: World, dt: number) => void, priority = 0): void {\n this.systems.push({ fn, priority });\n this.systemsSorted = false;\n }\n\n /** Remove a system. */\n removeSystem(fn: (world: World, dt: number) => void): void {\n const idx = this.systems.findIndex((s) => s.fn === fn);\n if (idx !== -1) this.systems.splice(idx, 1);\n }\n\n /** Run all systems in priority order. */\n step(dt: number): void {\n if (!this.systemsSorted) {\n this.systems.sort((a, b) => a.priority - b.priority);\n this.systemsSorted = true;\n }\n for (const sys of this.systems) {\n sys.fn(this, dt);\n }\n }\n\n /** @internal Register a query for auto-update. */\n _registerQuery(q: Query): void {\n this.queries.push(q);\n // Populate with existing entities\n for (const [entityId, arch] of this.archetypes) {\n q._check(entityId, arch);\n }\n }\n}\n\n/**\n * Internal query builder that auto-registers with a World.\n */\nclass _WorldQueryBuilder extends QueryBuilder {\n private world: World;\n\n constructor(world: World) {\n super();\n this.world = world;\n }\n\n override build(): Query {\n const q = super.build();\n this.world._registerQuery(q);\n return q;\n }\n}\n","import type { Query } from './query.js';\nimport type { World } from './world.js';\n\n/** A system function that processes entities matching a query. */\nexport type SystemFn = (entities: Query, dt: number, world: World) => void;\n\n/** A defined system with its query and function. */\nexport interface SystemDef {\n readonly query: Query;\n readonly fn: SystemFn;\n /** The wrapper registered on the World (used for removal). */\n readonly _worldFn: (world: World, dt: number) => void;\n}\n\n/**\n * Define a system that processes entities matching a query.\n *\n * Returns a SystemDef that can be added to a World via world.addSystem().\n * The system function receives the query's matching entities, dt, and world.\n *\n * Usage:\n * const q = world.query(Position, Velocity);\n * const moveSys = defineSystem(q, (entities, dt, world) => {\n * for (const id of entities) { ... }\n * });\n * world.addSystem(moveSys._worldFn);\n */\nexport function defineSystem(query: Query, fn: SystemFn): SystemDef {\n const worldFn = (world: World, dt: number) => {\n fn(query, dt, world);\n };\n return { query, fn, _worldFn: worldFn };\n}\n","import type { ComponentDef } from './component.js';\nimport type { World } from './world.js';\n\n/** A component entry in a prefab definition. */\ninterface PrefabEntry<T> {\n def: ComponentDef<T>;\n data?: T | (() => T);\n}\n\n/** A prefab factory that spawns entities with pre-defined components. */\nexport interface Prefab {\n readonly name: string;\n /** Spawn an entity with this prefab's components. */\n spawn(world: World, overrides?: Record<string, unknown>): number;\n}\n\n/**\n * Define a prefab — a template for spawning entities with a fixed set of components.\n *\n * @param name Debug name.\n * @param entries Array of [componentDef, data?] tuples.\n */\nexport function definePrefab(\n name: string,\n ...entries: [ComponentDef<unknown>, (unknown | (() => unknown))?][]\n): Prefab {\n const components: PrefabEntry<unknown>[] = entries.map(([def, data]) => ({\n def,\n data,\n }));\n\n return {\n name,\n spawn(world: World): number {\n const entity = world.spawn();\n for (const entry of components) {\n const data =\n typeof entry.data === 'function' ? (entry.data as () => unknown)() : entry.data;\n world.add(entity, entry.def, data);\n }\n return entity;\n },\n };\n}\n","/** A state in the FSM. */\nexport interface State<C = undefined> {\n readonly name: string;\n onEnter?(context: C): void;\n onExit?(context: C): void;\n onUpdate?(dt: number, context: C): void;\n}\n\n/**\n * Lightweight finite state machine. ~100 LOC.\n *\n * Manages named states with onEnter/onExit/onUpdate hooks\n * and string-keyed transitions.\n */\nexport class FSM<C = undefined> {\n private _current: State<C> | undefined;\n private _states = new Map<string, State<C>>();\n private _transitions = new Map<string, Map<string, string>>();\n private _context: C;\n\n constructor(...args: C extends undefined ? [] : [context: C]) {\n this._context = args[0] as C;\n }\n\n /** The currently active state, or undefined if none. */\n get current(): State<C> | undefined {\n return this._current;\n }\n\n /** Register a state. */\n addState(state: State<C>): this {\n this._states.set(state.name, state);\n return this;\n }\n\n /**\n * Register a transition.\n * When `trigger` fires in `fromState`, transition to `toState`.\n */\n addTransition(fromState: string, trigger: string, toState: string): this {\n let map = this._transitions.get(fromState);\n if (!map) {\n map = new Map();\n this._transitions.set(fromState, map);\n }\n map.set(trigger, toState);\n return this;\n }\n\n /** Set the initial state (calls onEnter). */\n start(stateName: string): void {\n const state = this._states.get(stateName);\n if (!state) return;\n this._current = state;\n state.onEnter?.(this._context);\n }\n\n /** Fire a trigger. If a matching transition exists, switch states. */\n trigger(name: string): void {\n if (!this._current) return;\n const transitions = this._transitions.get(this._current.name);\n if (!transitions) return;\n const target = transitions.get(name);\n if (target === undefined) return;\n const next = this._states.get(target);\n if (!next) return;\n this._current.onExit?.(this._context);\n this._current = next;\n next.onEnter?.(this._context);\n }\n\n /** Update the current state. */\n update(dt: number): void {\n this._current?.onUpdate?.(dt, this._context);\n }\n}\n","import type { Vec2 } from '@flare-engine/math';\nimport { defineComponent } from './component.js';\n\n/**\n * Built-in ECS components using @flare-engine/math types.\n */\n\n/** 2D position component. */\nexport const Position = defineComponent<Vec2>('Position', () => ({\n x: 0,\n y: 0,\n}));\n\n/** 2D velocity component. */\nexport const Velocity = defineComponent<Vec2>('Velocity', () => ({\n x: 0,\n y: 0,\n}));\n\n/** Rotation in radians. */\nexport const Rotation = defineComponent<{ angle: number }>('Rotation', () => ({\n angle: 0,\n}));\n\n/** 2D scale component. */\nexport const Scale = defineComponent<Vec2>('Scale', () => ({ x: 1, y: 1 }));\n\n/** Parent entity reference. */\nexport const Parent = defineComponent<{ entity: number }>('Parent', () => ({\n entity: 0,\n}));\n\n/** Countdown timer in seconds; entity expires when remaining reaches 0. */\nexport const Lifetime = defineComponent<{ remaining: number }>('Lifetime', () => ({\n remaining: 0,\n}));\n\n/** Pins an entity's position to a target entity plus a fixed offset. */\nexport const Follower = defineComponent<{ target: number; offsetX: number; offsetY: number }>(\n 'Follower',\n () => ({ target: 0, offsetX: 0, offsetY: 0 }),\n);\n","import { Follower, Lifetime, Position, Velocity } from './components.js';\nimport { defineSystem } from './system.js';\nimport type { SystemDef } from './system.js';\nimport type { World } from './world.js';\n\n/**\n * Plain camera-space bounding box used by createBoundsCullSystem.\n * Keep plain numbers — do NOT import physics AABB/Bounds (layer inversion).\n */\nexport interface CullBounds {\n readonly minX: number;\n readonly minY: number;\n readonly maxX: number;\n readonly maxY: number;\n}\n\n/**\n * createMovementSystem — integrates Position by Velocity * dt each frame.\n *\n * Recommended priority: run BEFORE createFollowerSystem (0).\n */\nexport function createMovementSystem(world: World): SystemDef {\n const q = world.query(Position, Velocity);\n return defineSystem(q, (entities, dt, w) => {\n for (const id of entities) {\n const pos = w.get(id, Position)!;\n const vel = w.get(id, Velocity)!;\n pos.x += vel.x * dt;\n pos.y += vel.y * dt;\n }\n });\n}\n\n/**\n * createLifetimeSystem — decrements Lifetime.remaining each frame.\n * Entities whose remaining reaches <= 0 are collected, then onExpire is called\n * for each AFTER the read loop.\n *\n * Deferred removal: destroying inside a live for…of over query.entities splices\n * the array mid-iteration and would skip entities. Collect first, act after.\n *\n * The scratch array is closure-owned and grow-only — zero steady-state alloc.\n *\n * @param onExpire Destroy / pool policy — ecs never destroys on its own.\n */\nexport function createLifetimeSystem(\n world: World,\n onExpire: (entity: number, world: World) => void,\n): SystemDef {\n const q = world.query(Lifetime);\n const scratch: number[] = [];\n return defineSystem(q, (entities, dt, w) => {\n scratch.length = 0;\n for (const id of entities) {\n const life = w.get(id, Lifetime)!;\n life.remaining -= dt;\n if (life.remaining <= 0) {\n scratch.push(id);\n }\n }\n for (let i = 0; i < scratch.length; i++) {\n onExpire(scratch[i]!, w);\n }\n });\n}\n\n/**\n * createBoundsCullSystem — culls entities whose Position falls outside bounds.\n * Reads bounds LIVE each frame so callers can mutate it to follow a camera.\n * Entities outside are collected, then onCull is called for each after the read loop.\n *\n * Deferred removal: same splice-during-iteration reason as createLifetimeSystem.\n *\n * Recommended priority: run AFTER createMovementSystem and createFollowerSystem.\n *\n * @param bounds Mutable bounding box read each frame.\n * @param onCull Destroy / pool policy — ecs never destroys on its own.\n */\nexport function createBoundsCullSystem(\n world: World,\n bounds: CullBounds,\n onCull: (entity: number, world: World) => void,\n): SystemDef {\n const q = world.query(Position);\n const scratch: number[] = [];\n return defineSystem(q, (entities, _dt, w) => {\n scratch.length = 0;\n for (const id of entities) {\n const pos = w.get(id, Position)!;\n if (\n pos.x < bounds.minX ||\n pos.x > bounds.maxX ||\n pos.y < bounds.minY ||\n pos.y > bounds.maxY\n ) {\n scratch.push(id);\n }\n }\n for (let i = 0; i < scratch.length; i++) {\n onCull(scratch[i]!, w);\n }\n });\n}\n\n/**\n * createFollowerSystem — pins each Follower entity's Position to\n * target.Position + (offsetX, offsetY).\n * If the target is gone or has no Position, the entity is silently skipped.\n *\n * Recommended priority: run AFTER createMovementSystem (1) so the target's\n * position is already integrated before the follower snaps to it.\n */\nexport function createFollowerSystem(world: World): SystemDef {\n const q = world.query(Position, Follower);\n return defineSystem(q, (entities, _dt, w) => {\n for (const id of entities) {\n const follower = w.get(id, Follower)!;\n const t = w.get(follower.target, Position);\n if (t === undefined) continue;\n const pos = w.get(id, Position)!;\n pos.x = t.x + follower.offsetX;\n pos.y = t.y + follower.offsetY;\n }\n });\n}\n\n/**\n * createOrphanCullSystem — fires onOrphan for each Follower whose target entity\n * no longer exists. Does NOT move or destroy anything itself.\n *\n * Split from createFollowerSystem so games that want to orphan-cull can opt in\n * without coupling destruction to the follower pin logic.\n *\n * Recommended priority: run AFTER createFollowerSystem (2) so the follower is\n * pinned before orphans are detected.\n *\n * Deferred removal: same splice-during-iteration reason as createLifetimeSystem.\n *\n * @param onOrphan Called once per orphaned entity after the read loop.\n */\nexport function createOrphanCullSystem(\n world: World,\n onOrphan: (entity: number, world: World) => void,\n): SystemDef {\n const q = world.query(Follower);\n const scratch: number[] = [];\n return defineSystem(q, (entities, _dt, w) => {\n scratch.length = 0;\n for (const id of entities) {\n const follower = w.get(id, Follower)!;\n if (!w.exists(follower.target)) {\n scratch.push(id);\n }\n }\n for (let i = 0; i < scratch.length; i++) {\n onOrphan(scratch[i]!, w);\n }\n });\n}\n"],"mappings":";AAmBA,IAAI,kBAAkB;AAQf,SAAS,gBAA+B,MAAc,UAAqC;AAChG,QAAM,KAAK;AACX,MAAI,MAAM,IAAI;AACZ,UAAM,IAAI,MAAM,kDAAkD,IAAI,IAAI;AAAA,EAC5E;AACA,SAAO;AAAA,IACL;AAAA,IACA,KAAK,KAAK;AAAA,IACV;AAAA,IACA,QAAQ,aAAa,MAAM;AAAA,EAC7B;AACF;AAMO,SAAS,qBAA2B;AACzC,oBAAkB;AACpB;;;AC9CA,SAAS,cAAc;AAShB,IAAM,QAAN,MAAY;AAAA;AAAA,EAER;AAAA;AAAA,EAEA;AAAA;AAAA,EAGA,gBAAgB,IAAI,OAAe;AAAA;AAAA,EAEnC,kBAAkB,IAAI,OAAe;AAAA;AAAA,EAGtC,WAAqB,CAAC;AAAA;AAAA,EAEtB,YAAY,oBAAI,IAAY;AAAA,EAEpC,YAAY,cAAsB,cAAsB;AACtD,SAAK,eAAe;AACpB,SAAK,eAAe;AAAA,EACtB;AAAA;AAAA,EAGA,QAAQ,WAA4B;AAClC,YACG,YAAY,KAAK,kBAAkB,KAAK,iBAAiB,YAAY,KAAK,kBAAkB;AAAA,EAEjG;AAAA;AAAA,EAGA,OAAO,UAAkB,WAAyB;AAChD,UAAM,UAAU,KAAK,QAAQ,SAAS;AACtC,UAAM,WAAW,KAAK,UAAU,IAAI,QAAQ;AAE5C,QAAI,WAAW,CAAC,UAAU;AACxB,WAAK,UAAU,IAAI,QAAQ;AAC3B,WAAK,SAAS,KAAK,QAAQ;AAC3B,WAAK,cAAc,KAAK,QAAQ;AAAA,IAClC,WAAW,CAAC,WAAW,UAAU;AAC/B,WAAK,UAAU,OAAO,QAAQ;AAC9B,YAAM,MAAM,KAAK,SAAS,QAAQ,QAAQ;AAC1C,UAAI,QAAQ,GAAI,MAAK,SAAS,OAAO,KAAK,CAAC;AAC3C,WAAK,gBAAgB,KAAK,QAAQ;AAAA,IACpC;AAAA,EACF;AAAA;AAAA,EAGA,QAAQ,UAAwB;AAC9B,QAAI,KAAK,UAAU,IAAI,QAAQ,GAAG;AAChC,WAAK,UAAU,OAAO,QAAQ;AAC9B,YAAM,MAAM,KAAK,SAAS,QAAQ,QAAQ;AAC1C,UAAI,QAAQ,GAAI,MAAK,SAAS,OAAO,KAAK,CAAC;AAC3C,WAAK,gBAAgB,KAAK,QAAQ;AAAA,IACpC;AAAA,EACF;AAAA;AAAA,EAGA,CAAC,OAAO,QAAQ,IAA8B;AAC5C,WAAO,KAAK,SAAS,OAAO,QAAQ,EAAE;AAAA,EACxC;AAAA;AAAA,EAGA,IAAI,QAAgB;AAClB,WAAO,KAAK,SAAS;AAAA,EACvB;AAAA;AAAA,EAGA,IAAI,UAA2B;AAC7B,WAAO,KAAK,UAAU,IAAI,QAAQ;AAAA,EACpC;AACF;AAGO,IAAM,eAAN,MAAmB;AAAA,EAChB,WAAW;AAAA,EACX,WAAW;AAAA,EAEnB,QAAQ,YAA2C;AACjD,eAAW,KAAK,YAAY;AAC1B,WAAK,YAAY,EAAE;AAAA,IACrB;AACA,WAAO;AAAA,EACT;AAAA,EAEA,WAAW,YAA2C;AACpD,eAAW,KAAK,YAAY;AAC1B,WAAK,YAAY,EAAE;AAAA,IACrB;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,QAAe;AACb,WAAO,IAAI,MAAM,KAAK,UAAU,KAAK,QAAQ;AAAA,EAC/C;AACF;;;AC9FO,IAAM,QAAN,MAAY;AAAA,EACT,SAAS;AAAA,EACT,aAAa,oBAAI,IAAoB;AAAA;AAAA,EACrC,kBAAkB,oBAAI,IAAkC;AAAA;AAAA,EACxD,UAAmB,CAAC;AAAA,EACpB,UAGF,CAAC;AAAA,EACC,gBAAgB;AAAA;AAAA,EAGxB,QAAgB;AACd,UAAM,KAAK,KAAK;AAChB,SAAK,WAAW,IAAI,IAAI,CAAC;AACzB,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,QAAQ,UAAwB;AAC9B,UAAM,OAAO,KAAK,WAAW,IAAI,QAAQ;AACzC,QAAI,SAAS,OAAW;AAGxB,eAAW,CAAC,EAAE,KAAK,KAAK,KAAK,iBAAiB;AAC5C,YAAM,OAAO,QAAQ;AAAA,IACvB;AAEA,SAAK,WAAW,OAAO,QAAQ;AAG/B,eAAW,SAAS,KAAK,SAAS;AAChC,YAAM,QAAQ,QAAQ;AAAA,IACxB;AAAA,EACF;AAAA;AAAA,EAGA,IAAO,UAAkB,KAAsB,MAAgB;AAC7D,UAAM,OAAO,KAAK,WAAW,IAAI,QAAQ;AACzC,QAAI,SAAS,OAAW;AAGxB,QAAI,QAAQ,KAAK,gBAAgB,IAAI,IAAI,EAAE;AAC3C,QAAI,CAAC,OAAO;AACV,cAAQ,oBAAI,IAAI;AAChB,WAAK,gBAAgB,IAAI,IAAI,IAAI,KAAK;AAAA,IACxC;AACA,UAAM,IAAI,UAAU,SAAS,SAAY,OAAO,IAAI,OAAO,CAAC;AAG5D,UAAM,UAAU,OAAO,IAAI;AAC3B,SAAK,WAAW,IAAI,UAAU,OAAO;AAGrC,eAAW,SAAS,KAAK,SAAS;AAChC,YAAM,OAAO,UAAU,OAAO;AAAA,IAChC;AAAA,EACF;AAAA;AAAA,EAGA,OAAU,UAAkB,KAA4B;AACtD,UAAM,OAAO,KAAK,WAAW,IAAI,QAAQ;AACzC,QAAI,SAAS,OAAW;AAExB,UAAM,QAAQ,KAAK,gBAAgB,IAAI,IAAI,EAAE;AAC7C,QAAI,MAAO,OAAM,OAAO,QAAQ;AAEhC,UAAM,UAAU,OAAO,CAAC,IAAI;AAC5B,SAAK,WAAW,IAAI,UAAU,OAAO;AAGrC,eAAW,SAAS,KAAK,SAAS;AAChC,YAAM,OAAO,UAAU,OAAO;AAAA,IAChC;AAAA,EACF;AAAA;AAAA,EAGA,IAAO,UAAkB,KAAqC;AAC5D,UAAM,QAAQ,KAAK,gBAAgB,IAAI,IAAI,EAAE;AAC7C,WAAO,OAAO,IAAI,QAAQ;AAAA,EAC5B;AAAA;AAAA,EAGA,IAAI,UAAkB,KAAqC;AACzD,UAAM,OAAO,KAAK,WAAW,IAAI,QAAQ;AACzC,WAAO,SAAS,WAAc,OAAO,IAAI,SAAS;AAAA,EACpD;AAAA;AAAA,EAGA,OAAO,UAA2B;AAChC,WAAO,KAAK,WAAW,IAAI,QAAQ;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,SAAS,YAA4C;AACnD,QAAI,OAAO;AACX,eAAW,KAAK,YAAY;AAC1B,cAAQ,EAAE;AAAA,IACZ;AACA,UAAM,IAAI,IAAI,MAAM,MAAM,CAAC;AAC3B,SAAK,QAAQ,KAAK,CAAC;AAGnB,eAAW,CAAC,UAAU,IAAI,KAAK,KAAK,YAAY;AAC9C,QAAE,OAAO,UAAU,IAAI;AAAA,IACzB;AAEA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,eAA6B;AAC3B,WAAO,IAAI,mBAAmB,IAAI;AAAA,EACpC;AAAA;AAAA,EAGA,UAAU,IAAwC,WAAW,GAAS;AACpE,SAAK,QAAQ,KAAK,EAAE,IAAI,SAAS,CAAC;AAClC,SAAK,gBAAgB;AAAA,EACvB;AAAA;AAAA,EAGA,aAAa,IAA8C;AACzD,UAAM,MAAM,KAAK,QAAQ,UAAU,CAAC,MAAM,EAAE,OAAO,EAAE;AACrD,QAAI,QAAQ,GAAI,MAAK,QAAQ,OAAO,KAAK,CAAC;AAAA,EAC5C;AAAA;AAAA,EAGA,KAAK,IAAkB;AACrB,QAAI,CAAC,KAAK,eAAe;AACvB,WAAK,QAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AACnD,WAAK,gBAAgB;AAAA,IACvB;AACA,eAAW,OAAO,KAAK,SAAS;AAC9B,UAAI,GAAG,MAAM,EAAE;AAAA,IACjB;AAAA,EACF;AAAA;AAAA,EAGA,eAAe,GAAgB;AAC7B,SAAK,QAAQ,KAAK,CAAC;AAEnB,eAAW,CAAC,UAAU,IAAI,KAAK,KAAK,YAAY;AAC9C,QAAE,OAAO,UAAU,IAAI;AAAA,IACzB;AAAA,EACF;AACF;AAKA,IAAM,qBAAN,cAAiC,aAAa;AAAA,EACpC;AAAA,EAER,YAAY,OAAc;AACxB,UAAM;AACN,SAAK,QAAQ;AAAA,EACf;AAAA,EAES,QAAe;AACtB,UAAM,IAAI,MAAM,MAAM;AACtB,SAAK,MAAM,eAAe,CAAC;AAC3B,WAAO;AAAA,EACT;AACF;;;ACxJO,SAAS,aAAa,OAAc,IAAyB;AAClE,QAAM,UAAU,CAAC,OAAc,OAAe;AAC5C,OAAG,OAAO,IAAI,KAAK;AAAA,EACrB;AACA,SAAO,EAAE,OAAO,IAAI,UAAU,QAAQ;AACxC;;;ACVO,SAAS,aACd,SACG,SACK;AACR,QAAM,aAAqC,QAAQ,IAAI,CAAC,CAAC,KAAK,IAAI,OAAO;AAAA,IACvE;AAAA,IACA;AAAA,EACF,EAAE;AAEF,SAAO;AAAA,IACL;AAAA,IACA,MAAM,OAAsB;AAC1B,YAAM,SAAS,MAAM,MAAM;AAC3B,iBAAW,SAAS,YAAY;AAC9B,cAAM,OACJ,OAAO,MAAM,SAAS,aAAc,MAAM,KAAuB,IAAI,MAAM;AAC7E,cAAM,IAAI,QAAQ,MAAM,KAAK,IAAI;AAAA,MACnC;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACF;;;AC7BO,IAAM,MAAN,MAAyB;AAAA,EACtB;AAAA,EACA,UAAU,oBAAI,IAAsB;AAAA,EACpC,eAAe,oBAAI,IAAiC;AAAA,EACpD;AAAA,EAER,eAAe,MAA+C;AAC5D,SAAK,WAAW,KAAK,CAAC;AAAA,EACxB;AAAA;AAAA,EAGA,IAAI,UAAgC;AAClC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,SAAS,OAAuB;AAC9B,SAAK,QAAQ,IAAI,MAAM,MAAM,KAAK;AAClC,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAc,WAAmB,SAAiB,SAAuB;AACvE,QAAI,MAAM,KAAK,aAAa,IAAI,SAAS;AACzC,QAAI,CAAC,KAAK;AACR,YAAM,oBAAI,IAAI;AACd,WAAK,aAAa,IAAI,WAAW,GAAG;AAAA,IACtC;AACA,QAAI,IAAI,SAAS,OAAO;AACxB,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,MAAM,WAAyB;AAC7B,UAAM,QAAQ,KAAK,QAAQ,IAAI,SAAS;AACxC,QAAI,CAAC,MAAO;AACZ,SAAK,WAAW;AAChB,UAAM,UAAU,KAAK,QAAQ;AAAA,EAC/B;AAAA;AAAA,EAGA,QAAQ,MAAoB;AAC1B,QAAI,CAAC,KAAK,SAAU;AACpB,UAAM,cAAc,KAAK,aAAa,IAAI,KAAK,SAAS,IAAI;AAC5D,QAAI,CAAC,YAAa;AAClB,UAAM,SAAS,YAAY,IAAI,IAAI;AACnC,QAAI,WAAW,OAAW;AAC1B,UAAM,OAAO,KAAK,QAAQ,IAAI,MAAM;AACpC,QAAI,CAAC,KAAM;AACX,SAAK,SAAS,SAAS,KAAK,QAAQ;AACpC,SAAK,WAAW;AAChB,SAAK,UAAU,KAAK,QAAQ;AAAA,EAC9B;AAAA;AAAA,EAGA,OAAO,IAAkB;AACvB,SAAK,UAAU,WAAW,IAAI,KAAK,QAAQ;AAAA,EAC7C;AACF;;;ACnEO,IAAM,WAAW,gBAAsB,YAAY,OAAO;AAAA,EAC/D,GAAG;AAAA,EACH,GAAG;AACL,EAAE;AAGK,IAAM,WAAW,gBAAsB,YAAY,OAAO;AAAA,EAC/D,GAAG;AAAA,EACH,GAAG;AACL,EAAE;AAGK,IAAM,WAAW,gBAAmC,YAAY,OAAO;AAAA,EAC5E,OAAO;AACT,EAAE;AAGK,IAAM,QAAQ,gBAAsB,SAAS,OAAO,EAAE,GAAG,GAAG,GAAG,EAAE,EAAE;AAGnE,IAAM,SAAS,gBAAoC,UAAU,OAAO;AAAA,EACzE,QAAQ;AACV,EAAE;AAGK,IAAM,WAAW,gBAAuC,YAAY,OAAO;AAAA,EAChF,WAAW;AACb,EAAE;AAGK,IAAM,WAAW;AAAA,EACtB;AAAA,EACA,OAAO,EAAE,QAAQ,GAAG,SAAS,GAAG,SAAS,EAAE;AAC7C;;;ACpBO,SAAS,qBAAqB,OAAyB;AAC5D,QAAM,IAAI,MAAM,MAAM,UAAU,QAAQ;AACxC,SAAO,aAAa,GAAG,CAAC,UAAU,IAAI,MAAM;AAC1C,eAAW,MAAM,UAAU;AACzB,YAAM,MAAM,EAAE,IAAI,IAAI,QAAQ;AAC9B,YAAM,MAAM,EAAE,IAAI,IAAI,QAAQ;AAC9B,UAAI,KAAK,IAAI,IAAI;AACjB,UAAI,KAAK,IAAI,IAAI;AAAA,IACnB;AAAA,EACF,CAAC;AACH;AAcO,SAAS,qBACd,OACA,UACW;AACX,QAAM,IAAI,MAAM,MAAM,QAAQ;AAC9B,QAAM,UAAoB,CAAC;AAC3B,SAAO,aAAa,GAAG,CAAC,UAAU,IAAI,MAAM;AAC1C,YAAQ,SAAS;AACjB,eAAW,MAAM,UAAU;AACzB,YAAM,OAAO,EAAE,IAAI,IAAI,QAAQ;AAC/B,WAAK,aAAa;AAClB,UAAI,KAAK,aAAa,GAAG;AACvB,gBAAQ,KAAK,EAAE;AAAA,MACjB;AAAA,IACF;AACA,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,eAAS,QAAQ,CAAC,GAAI,CAAC;AAAA,IACzB;AAAA,EACF,CAAC;AACH;AAcO,SAAS,uBACd,OACA,QACA,QACW;AACX,QAAM,IAAI,MAAM,MAAM,QAAQ;AAC9B,QAAM,UAAoB,CAAC;AAC3B,SAAO,aAAa,GAAG,CAAC,UAAU,KAAK,MAAM;AAC3C,YAAQ,SAAS;AACjB,eAAW,MAAM,UAAU;AACzB,YAAM,MAAM,EAAE,IAAI,IAAI,QAAQ;AAC9B,UACE,IAAI,IAAI,OAAO,QACf,IAAI,IAAI,OAAO,QACf,IAAI,IAAI,OAAO,QACf,IAAI,IAAI,OAAO,MACf;AACA,gBAAQ,KAAK,EAAE;AAAA,MACjB;AAAA,IACF;AACA,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,aAAO,QAAQ,CAAC,GAAI,CAAC;AAAA,IACvB;AAAA,EACF,CAAC;AACH;AAUO,SAAS,qBAAqB,OAAyB;AAC5D,QAAM,IAAI,MAAM,MAAM,UAAU,QAAQ;AACxC,SAAO,aAAa,GAAG,CAAC,UAAU,KAAK,MAAM;AAC3C,eAAW,MAAM,UAAU;AACzB,YAAM,WAAW,EAAE,IAAI,IAAI,QAAQ;AACnC,YAAM,IAAI,EAAE,IAAI,SAAS,QAAQ,QAAQ;AACzC,UAAI,MAAM,OAAW;AACrB,YAAM,MAAM,EAAE,IAAI,IAAI,QAAQ;AAC9B,UAAI,IAAI,EAAE,IAAI,SAAS;AACvB,UAAI,IAAI,EAAE,IAAI,SAAS;AAAA,IACzB;AAAA,EACF,CAAC;AACH;AAgBO,SAAS,uBACd,OACA,UACW;AACX,QAAM,IAAI,MAAM,MAAM,QAAQ;AAC9B,QAAM,UAAoB,CAAC;AAC3B,SAAO,aAAa,GAAG,CAAC,UAAU,KAAK,MAAM;AAC3C,YAAQ,SAAS;AACjB,eAAW,MAAM,UAAU;AACzB,YAAM,WAAW,EAAE,IAAI,IAAI,QAAQ;AACnC,UAAI,CAAC,EAAE,OAAO,SAAS,MAAM,GAAG;AAC9B,gBAAQ,KAAK,EAAE;AAAA,MACjB;AAAA,IACF;AACA,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,eAAS,QAAQ,CAAC,GAAI,CAAC;AAAA,IACzB;AAAA,EACF,CAAC;AACH;","names":[]}
1
+ {"version":3,"file":"index.mjs","names":[],"sources":["../src/component.ts","../src/components.ts","../src/fsm.ts","../src/prefab.ts","../src/query.ts","../src/system.ts","../src/systems.ts","../src/world.ts"],"sourcesContent":["/**\n * Component definition and factory.\n *\n * Components are plain data objects. Each component type gets a unique\n * bit for archetype-based query matching.\n */\n\n/** A unique component definition. */\nexport interface ComponentDef<T> {\n /** Internal unique ID (auto-assigned). */\n readonly id: number;\n /** Bitmask for this component (1 << id). */\n readonly bit: number;\n /** Component name for debugging. */\n readonly name: string;\n /** Create a new instance with default values. */\n create(): T;\n}\n\nlet nextComponentId = 0;\n\n/**\n * Define a new component type.\n *\n * @param name Debug name for the component.\n * @param defaults Factory function returning default values, or undefined for tag components.\n */\nexport function defineComponent<T = undefined>(name: string, defaults?: () => T): ComponentDef<T> {\n const id = nextComponentId++;\n if (id >= 32) {\n throw new Error(`Maximum 32 component types exceeded (defining \"${name}\")`);\n }\n return {\n id,\n bit: 1 << id,\n name,\n create: defaults ?? (() => undefined as T),\n };\n}\n\n/**\n * Reset the component ID counter. Only for testing.\n * @internal\n */\nexport function _resetComponentIds(): void {\n nextComponentId = 0;\n}\n","import type { Vec2 } from '@flare-engine/math';\nimport { defineComponent } from './component.js';\n\n/**\n * Built-in ECS components using @flare-engine/math types.\n */\n\n/** 2D position component. */\nexport const Position = defineComponent<Vec2>('Position', () => ({\n x: 0,\n y: 0,\n}));\n\n/** 2D velocity component. */\nexport const Velocity = defineComponent<Vec2>('Velocity', () => ({\n x: 0,\n y: 0,\n}));\n\n/** Rotation in radians. */\nexport const Rotation = defineComponent<{ angle: number }>('Rotation', () => ({\n angle: 0,\n}));\n\n/** 2D scale component. */\nexport const Scale = defineComponent<Vec2>('Scale', () => ({ x: 1, y: 1 }));\n\n/** Parent entity reference. */\nexport const Parent = defineComponent<{ entity: number }>('Parent', () => ({\n entity: 0,\n}));\n\n/** Countdown timer in seconds; entity expires when remaining reaches 0. */\nexport const Lifetime = defineComponent<{ remaining: number }>('Lifetime', () => ({\n remaining: 0,\n}));\n\n/** Pins an entity's position to a target entity plus a fixed offset. */\nexport const Follower = defineComponent<{ target: number; offsetX: number; offsetY: number }>(\n 'Follower',\n () => ({ target: 0, offsetX: 0, offsetY: 0 }),\n);\n","/** A state in the FSM. */\nexport interface State<C = undefined> {\n readonly name: string;\n onEnter?(context: C): void;\n onExit?(context: C): void;\n onUpdate?(dt: number, context: C): void;\n}\n\n/**\n * Lightweight finite state machine. ~100 LOC.\n *\n * Manages named states with onEnter/onExit/onUpdate hooks\n * and string-keyed transitions.\n */\nexport class FSM<C = undefined> {\n private _current: State<C> | undefined;\n private _states = new Map<string, State<C>>();\n private _transitions = new Map<string, Map<string, string>>();\n private _context: C;\n\n constructor(...args: C extends undefined ? [] : [context: C]) {\n this._context = args[0] as C;\n }\n\n /** The currently active state, or undefined if none. */\n get current(): State<C> | undefined {\n return this._current;\n }\n\n /** Register a state. */\n addState(state: State<C>): this {\n this._states.set(state.name, state);\n return this;\n }\n\n /**\n * Register a transition.\n * When `trigger` fires in `fromState`, transition to `toState`.\n */\n addTransition(fromState: string, trigger: string, toState: string): this {\n let map = this._transitions.get(fromState);\n if (!map) {\n map = new Map();\n this._transitions.set(fromState, map);\n }\n map.set(trigger, toState);\n return this;\n }\n\n /** Set the initial state (calls onEnter). */\n start(stateName: string): void {\n const state = this._states.get(stateName);\n if (!state) return;\n this._current = state;\n state.onEnter?.(this._context);\n }\n\n /** Fire a trigger. If a matching transition exists, switch states. */\n trigger(name: string): void {\n if (!this._current) return;\n const transitions = this._transitions.get(this._current.name);\n if (!transitions) return;\n const target = transitions.get(name);\n if (target === undefined) return;\n const next = this._states.get(target);\n if (!next) return;\n this._current.onExit?.(this._context);\n this._current = next;\n next.onEnter?.(this._context);\n }\n\n /** Update the current state. */\n update(dt: number): void {\n this._current?.onUpdate?.(dt, this._context);\n }\n}\n","import type { ComponentDef } from './component.js';\nimport type { World } from './world.js';\n\n/** A component entry in a prefab definition. */\ninterface PrefabEntry<T> {\n def: ComponentDef<T>;\n data?: T | (() => T);\n}\n\n/** A prefab factory that spawns entities with pre-defined components. */\nexport interface Prefab {\n readonly name: string;\n /** Spawn an entity with this prefab's components. */\n spawn(world: World, overrides?: Record<string, unknown>): number;\n}\n\n/**\n * Define a prefab — a template for spawning entities with a fixed set of components.\n *\n * @param name Debug name.\n * @param entries Array of [componentDef, data?] tuples.\n */\nexport function definePrefab(\n name: string,\n ...entries: [ComponentDef<unknown>, (unknown | (() => unknown))?][]\n): Prefab {\n const components: PrefabEntry<unknown>[] = entries.map(([def, data]) => ({\n def,\n data,\n }));\n\n return {\n name,\n spawn(world: World): number {\n const entity = world.spawn();\n for (const entry of components) {\n const data =\n typeof entry.data === 'function' ? (entry.data as () => unknown)() : entry.data;\n world.add(entity, entry.def, data);\n }\n return entity;\n },\n };\n}\n","import { Signal } from '@flare-engine/events';\nimport type { ComponentDef } from './component.js';\n\n/**\n * Query matches entities based on component archetypes.\n *\n * Uses bitmask matching: entity archetype & requiredMask === requiredMask\n * and entity archetype & excludedMask === 0.\n */\nexport class Query {\n /** Bitmask of required components. */\n readonly requiredMask: number;\n /** Bitmask of excluded components. */\n readonly excludedMask: number;\n\n /** Fires when an entity is added to this query's results. */\n readonly onEntityAdded = new Signal<number>();\n /** Fires when an entity is removed from this query's results. */\n readonly onEntityRemoved = new Signal<number>();\n\n /** Sorted array of matching entity IDs. */\n private entities: number[] = [];\n /** Set for O(1) membership check. */\n private entitySet = new Set<number>();\n\n constructor(requiredMask: number, excludedMask: number) {\n this.requiredMask = requiredMask;\n this.excludedMask = excludedMask;\n }\n\n /** Check if an archetype matches this query. */\n matches(archetype: number): boolean {\n return (\n (archetype & this.requiredMask) === this.requiredMask && (archetype & this.excludedMask) === 0\n );\n }\n\n /** @internal — called by World when an entity's archetype changes. */\n _check(entityId: number, archetype: number): void {\n const isMatch = this.matches(archetype);\n const wasMatch = this.entitySet.has(entityId);\n\n if (isMatch && !wasMatch) {\n this.entitySet.add(entityId);\n this.entities.push(entityId);\n this.onEntityAdded.emit(entityId);\n } else if (!isMatch && wasMatch) {\n this.entitySet.delete(entityId);\n const idx = this.entities.indexOf(entityId);\n if (idx !== -1) this.entities.splice(idx, 1);\n this.onEntityRemoved.emit(entityId);\n }\n }\n\n /** @internal — called by World when an entity is removed entirely. */\n _remove(entityId: number): void {\n if (this.entitySet.has(entityId)) {\n this.entitySet.delete(entityId);\n const idx = this.entities.indexOf(entityId);\n if (idx !== -1) this.entities.splice(idx, 1);\n this.onEntityRemoved.emit(entityId);\n }\n }\n\n /** Iterate matching entity IDs. */\n [Symbol.iterator](): IterableIterator<number> {\n return this.entities[Symbol.iterator]();\n }\n\n /** Number of matching entities. */\n get count(): number {\n return this.entities.length;\n }\n\n /** Check if an entity matches this query. */\n has(entityId: number): boolean {\n return this.entitySet.has(entityId);\n }\n}\n\n/** Builder for creating queries with .with() / .without() chaining. */\nexport class QueryBuilder {\n private required = 0;\n private excluded = 0;\n\n with(...components: ComponentDef<unknown>[]): this {\n for (const c of components) {\n this.required |= c.bit;\n }\n return this;\n }\n\n without(...components: ComponentDef<unknown>[]): this {\n for (const c of components) {\n this.excluded |= c.bit;\n }\n return this;\n }\n\n /** Build the query (called internally by World). */\n build(): Query {\n return new Query(this.required, this.excluded);\n }\n}\n","import type { Query } from './query.js';\nimport type { World } from './world.js';\n\n/** A system function that processes entities matching a query. */\nexport type SystemFn = (entities: Query, dt: number, world: World) => void;\n\n/** A defined system with its query and function. */\nexport interface SystemDef {\n readonly query: Query;\n readonly fn: SystemFn;\n /** The wrapper registered on the World (used for removal). */\n readonly _worldFn: (world: World, dt: number) => void;\n}\n\n/**\n * Define a system that processes entities matching a query.\n *\n * Returns a SystemDef that can be added to a World via world.addSystem().\n * The system function receives the query's matching entities, dt, and world.\n *\n * Usage:\n * const q = world.query(Position, Velocity);\n * const moveSys = defineSystem(q, (entities, dt, world) => {\n * for (const id of entities) { ... }\n * });\n * world.addSystem(moveSys._worldFn);\n */\nexport function defineSystem(query: Query, fn: SystemFn): SystemDef {\n const worldFn = (world: World, dt: number) => {\n fn(query, dt, world);\n };\n return { query, fn, _worldFn: worldFn };\n}\n","import { Follower, Lifetime, Position, Velocity } from './components.js';\nimport type { Query } from './query.js';\nimport type { SystemDef } from './system.js';\nimport { defineSystem } from './system.js';\nimport type { World } from './world.js';\n\n/**\n * Plain camera-space bounding box used by createBoundsCullSystem.\n * Keep plain numbers — do NOT import physics AABB/Bounds (layer inversion).\n */\nexport interface CullBounds {\n readonly minX: number;\n readonly minY: number;\n readonly maxX: number;\n readonly maxY: number;\n}\n\n/**\n * createMovementSystem — integrates Position by Velocity * dt each frame.\n *\n * Recommended priority: run BEFORE createFollowerSystem (0).\n */\nexport function createMovementSystem(world: World): SystemDef {\n const q = world.query(Position, Velocity);\n return defineSystem(q, (entities, dt, w) => {\n for (const id of entities) {\n const pos = w.get(id, Position)!;\n const vel = w.get(id, Velocity)!;\n pos.x += vel.x * dt;\n pos.y += vel.y * dt;\n }\n });\n}\n\n/**\n * createLifetimeSystem — decrements Lifetime.remaining each frame.\n * Entities whose remaining reaches <= 0 are collected, then onExpire is called\n * for each AFTER the read loop.\n *\n * Deferred removal: destroying inside a live for…of over query.entities splices\n * the array mid-iteration and would skip entities. Collect first, act after.\n *\n * The scratch array is closure-owned and grow-only — zero steady-state alloc.\n *\n * @param onExpire Destroy / pool policy — ecs never destroys on its own.\n * @param query Optional caller-supplied Query. When omitted the system\n * registers world.query(Lifetime) itself. Pass a narrower\n * query to avoid scanning unrelated Lifetime holders and to\n * share an already-registered query (eliminates duplicate\n * World.query registration cost).\n */\nexport function createLifetimeSystem(\n world: World,\n onExpire: (entity: number, world: World) => void,\n query?: Query,\n): SystemDef {\n const q = query ?? world.query(Lifetime);\n const scratch: number[] = [];\n return defineSystem(q, (entities, dt, w) => {\n scratch.length = 0;\n for (const id of entities) {\n const life = w.get(id, Lifetime)!;\n life.remaining -= dt;\n if (life.remaining <= 0) {\n scratch.push(id);\n }\n }\n for (let i = 0; i < scratch.length; i++) {\n onExpire(scratch[i]!, w);\n }\n });\n}\n\n/**\n * createBoundsCullSystem — culls entities whose Position falls outside bounds.\n * Reads bounds LIVE each frame so callers can mutate it to follow a camera.\n * Entities outside are collected, then onCull is called for each after the read loop.\n *\n * Deferred removal: same splice-during-iteration reason as createLifetimeSystem.\n *\n * Recommended priority: run AFTER createMovementSystem and createFollowerSystem.\n *\n * @param bounds Mutable bounding box read each frame.\n * @param onCull Destroy / pool policy — ecs never destroys on its own.\n * @param query Optional caller-supplied Query. When omitted the system\n * registers world.query(Position) itself, scanning all\n * Position holders. Pass a narrower query (e.g. bullets\n * only) to avoid scanning unrelated entities such as\n * scrolling backgrounds, and to share an already-registered\n * query with the caller.\n */\nexport function createBoundsCullSystem(\n world: World,\n bounds: CullBounds,\n onCull: (entity: number, world: World) => void,\n query?: Query,\n): SystemDef {\n const q = query ?? world.query(Position);\n const scratch: number[] = [];\n return defineSystem(q, (entities, _dt, w) => {\n scratch.length = 0;\n for (const id of entities) {\n const pos = w.get(id, Position)!;\n if (\n pos.x < bounds.minX ||\n pos.x > bounds.maxX ||\n pos.y < bounds.minY ||\n pos.y > bounds.maxY\n ) {\n scratch.push(id);\n }\n }\n for (let i = 0; i < scratch.length; i++) {\n onCull(scratch[i]!, w);\n }\n });\n}\n\n/**\n * createFollowerSystem — pins each Follower entity's Position to\n * target.Position + (offsetX, offsetY).\n * If the target is gone or has no Position, the entity is silently skipped.\n *\n * Recommended priority: run AFTER createMovementSystem (1) so the target's\n * position is already integrated before the follower snaps to it.\n */\nexport function createFollowerSystem(world: World): SystemDef {\n const q = world.query(Position, Follower);\n return defineSystem(q, (entities, _dt, w) => {\n for (const id of entities) {\n const follower = w.get(id, Follower)!;\n const t = w.get(follower.target, Position);\n if (t === undefined) continue;\n const pos = w.get(id, Position)!;\n pos.x = t.x + follower.offsetX;\n pos.y = t.y + follower.offsetY;\n }\n });\n}\n\n/**\n * createOrphanCullSystem — fires onOrphan for each Follower whose target entity\n * no longer exists. Does NOT move or destroy anything itself.\n *\n * Split from createFollowerSystem so games that want to orphan-cull can opt in\n * without coupling destruction to the follower pin logic.\n *\n * Recommended priority: run AFTER createFollowerSystem (2) so the follower is\n * pinned before orphans are detected.\n *\n * Deferred removal: same splice-during-iteration reason as createLifetimeSystem.\n *\n * @param onOrphan Called once per orphaned entity after the read loop.\n */\nexport function createOrphanCullSystem(\n world: World,\n onOrphan: (entity: number, world: World) => void,\n): SystemDef {\n const q = world.query(Follower);\n const scratch: number[] = [];\n return defineSystem(q, (entities, _dt, w) => {\n scratch.length = 0;\n for (const id of entities) {\n const follower = w.get(id, Follower)!;\n if (!w.exists(follower.target)) {\n scratch.push(id);\n }\n }\n for (let i = 0; i < scratch.length; i++) {\n onOrphan(scratch[i]!, w);\n }\n });\n}\n","import type { ComponentDef } from './component.js';\nimport { Query, QueryBuilder } from './query.js';\n\n/**\n * World is the central ECS container.\n *\n * Entities are integer IDs. Components are stored in per-component Maps.\n * Archetype bitmasks enable fast query matching.\n */\nexport class World {\n private nextId = 1;\n private archetypes = new Map<number, number>(); // entityId → bitmask\n private componentStores = new Map<number, Map<number, unknown>>(); // componentId → (entityId → data)\n private queries: Query[] = [];\n private queryIterDepth = 0;\n private pendingQueryRemove: Query[] | null = null;\n private systems: {\n fn: (world: World, dt: number) => void;\n priority: number;\n }[] = [];\n private systemsSorted = false;\n\n /** Create a new entity. Returns the entity ID. */\n spawn(): number {\n const id = this.nextId++;\n this.archetypes.set(id, 0);\n return id;\n }\n\n /** Remove an entity and all its components. */\n destroy(entityId: number): void {\n const arch = this.archetypes.get(entityId);\n if (arch === undefined) return;\n\n // Remove from all component stores\n for (const [, store] of this.componentStores) {\n store.delete(entityId);\n }\n\n this.archetypes.delete(entityId);\n\n // Notify queries (deferring any removeQuery until the loop unwinds)\n this.queryIterDepth++;\n try {\n for (const query of this.queries) {\n query._remove(entityId);\n }\n } finally {\n this.endQueryIteration();\n }\n }\n\n /** Add a component to an entity. */\n add<T>(entityId: number, def: ComponentDef<T>, data?: T): void {\n const arch = this.archetypes.get(entityId);\n if (arch === undefined) return;\n\n // Store component data\n let store = this.componentStores.get(def.id);\n if (!store) {\n store = new Map();\n this.componentStores.set(def.id, store);\n }\n store.set(entityId, data !== undefined ? data : def.create());\n\n // Update archetype\n const newArch = arch | def.bit;\n this.archetypes.set(entityId, newArch);\n\n // Notify queries (deferring any removeQuery until the loop unwinds)\n this.queryIterDepth++;\n try {\n for (const query of this.queries) {\n query._check(entityId, newArch);\n }\n } finally {\n this.endQueryIteration();\n }\n }\n\n /** Remove a component from an entity. */\n remove<T>(entityId: number, def: ComponentDef<T>): void {\n const arch = this.archetypes.get(entityId);\n if (arch === undefined) return;\n\n const store = this.componentStores.get(def.id);\n if (store) store.delete(entityId);\n\n const newArch = arch & ~def.bit;\n this.archetypes.set(entityId, newArch);\n\n // Notify queries (deferring any removeQuery until the loop unwinds)\n this.queryIterDepth++;\n try {\n for (const query of this.queries) {\n query._check(entityId, newArch);\n }\n } finally {\n this.endQueryIteration();\n }\n }\n\n /** Get component data for an entity. */\n get<T>(entityId: number, def: ComponentDef<T>): T | undefined {\n const store = this.componentStores.get(def.id);\n return store?.get(entityId) as T | undefined;\n }\n\n /** Check if entity has a component. */\n has(entityId: number, def: ComponentDef<unknown>): boolean {\n const arch = this.archetypes.get(entityId);\n return arch !== undefined && (arch & def.bit) !== 0;\n }\n\n /** Check if entity exists. */\n exists(entityId: number): boolean {\n return this.archetypes.has(entityId);\n }\n\n /** Number of live entities. */\n get entityCount(): number {\n return this.archetypes.size;\n }\n\n /**\n * Walk every live entity ID. Iterates the live archetype map directly, with no\n * array snapshot. Archetype changes (add/remove component) keep the same entity\n * keys, so iteration is stable across them. Destroying entities inside the\n * callback is safe, but entities spawned inside it are visited in the same pass\n * (live Map iteration) — don't spawn from within.\n */\n forEachEntity(cb: (entity: number) => void): void {\n for (const entityId of this.archetypes.keys()) {\n cb(entityId);\n }\n }\n\n /**\n * Create a query. Queries auto-update as entities change.\n * Use the QueryBuilder-style chaining:\n * world.query(Position, Velocity)\n * Or use the builder:\n * world.queryBuilder().with(Position).without(Dead).build()\n */\n query(...components: ComponentDef<unknown>[]): Query {\n let mask = 0;\n for (const c of components) {\n mask |= c.bit;\n }\n const q = new Query(mask, 0);\n this.queries.push(q);\n\n // Populate with existing entities\n for (const [entityId, arch] of this.archetypes) {\n q._check(entityId, arch);\n }\n\n return q;\n }\n\n /** Create a QueryBuilder for complex queries (with/without). */\n queryBuilder(): QueryBuilder {\n return new _WorldQueryBuilder(this);\n }\n\n /**\n * Dispose a query created by `query()` or `queryBuilder().build()`. Afterwards\n * the world stops updating it, so it no longer costs spawn/add/remove iteration\n * time. The query is left inert — drop the reference to let it be collected.\n *\n * Safe to call from within a Query signal handler (e.g. a one-shot\n * `onEntityAdded` that disposes its own query): the removal is deferred until\n * the in-progress mutation finishes iterating, so no other query is skipped.\n */\n removeQuery(q: Query): void {\n if (this.queryIterDepth > 0) {\n if (this.pendingQueryRemove === null) this.pendingQueryRemove = [];\n this.pendingQueryRemove.push(q);\n return;\n }\n const idx = this.queries.indexOf(q);\n if (idx !== -1) this.queries.splice(idx, 1);\n }\n\n /** @internal End a query-notify loop; flush any removeQuery deferred during it. */\n private endQueryIteration(): void {\n this.queryIterDepth--;\n if (this.queryIterDepth === 0 && this.pendingQueryRemove !== null) {\n for (const q of this.pendingQueryRemove) {\n const idx = this.queries.indexOf(q);\n if (idx !== -1) this.queries.splice(idx, 1);\n }\n this.pendingQueryRemove.length = 0;\n }\n }\n\n /** Register a system function. Lower priority runs first. */\n addSystem(fn: (world: World, dt: number) => void, priority = 0): void {\n this.systems.push({ fn, priority });\n this.systemsSorted = false;\n }\n\n /** Remove a system. */\n removeSystem(fn: (world: World, dt: number) => void): void {\n const idx = this.systems.findIndex((s) => s.fn === fn);\n if (idx !== -1) this.systems.splice(idx, 1);\n }\n\n /** Run all systems in priority order. */\n step(dt: number): void {\n if (!this.systemsSorted) {\n this.systems.sort((a, b) => a.priority - b.priority);\n this.systemsSorted = true;\n }\n for (const sys of this.systems) {\n sys.fn(this, dt);\n }\n }\n\n /** @internal Register a query for auto-update. */\n _registerQuery(q: Query): void {\n this.queries.push(q);\n // Populate with existing entities\n for (const [entityId, arch] of this.archetypes) {\n q._check(entityId, arch);\n }\n }\n}\n\n/**\n * Internal query builder that auto-registers with a World.\n */\nclass _WorldQueryBuilder extends QueryBuilder {\n private world: World;\n\n constructor(world: World) {\n super();\n this.world = world;\n }\n\n override build(): Query {\n const q = super.build();\n this.world._registerQuery(q);\n return q;\n }\n}\n"],"mappings":";;AAmBA,IAAI,kBAAkB;;;;;;;AAQtB,SAAgB,gBAA+B,MAAc,UAAqC;CAChG,MAAM,KAAK;CACX,IAAI,MAAM,IACR,MAAM,IAAI,MAAM,kDAAkD,KAAK,GAAG;CAE5E,OAAO;EACL;EACA,KAAK,KAAK;EACV;EACA,QAAQ,mBAAmB,KAAA;CAC7B;AACF;;;;;AAMA,SAAgB,qBAA2B;CACzC,kBAAkB;AACpB;;;;;;;ACtCA,MAAa,WAAW,gBAAsB,mBAAmB;CAC/D,GAAG;CACH,GAAG;AACL,EAAE;;AAGF,MAAa,WAAW,gBAAsB,mBAAmB;CAC/D,GAAG;CACH,GAAG;AACL,EAAE;;AAGF,MAAa,WAAW,gBAAmC,mBAAmB,EAC5E,OAAO,EACT,EAAE;;AAGF,MAAa,QAAQ,gBAAsB,gBAAgB;CAAE,GAAG;CAAG,GAAG;AAAE,EAAE;;AAG1E,MAAa,SAAS,gBAAoC,iBAAiB,EACzE,QAAQ,EACV,EAAE;;AAGF,MAAa,WAAW,gBAAuC,mBAAmB,EAChF,WAAW,EACb,EAAE;;AAGF,MAAa,WAAW,gBACtB,mBACO;CAAE,QAAQ;CAAG,SAAS;CAAG,SAAS;AAAE,EAC7C;;;;;;;;;AC3BA,IAAa,MAAb,MAAgC;CAC9B;CACA,0BAAkB,IAAI,IAAsB;CAC5C,+BAAuB,IAAI,IAAiC;CAC5D;CAEA,YAAY,GAAG,MAA+C;EAC5D,KAAK,WAAW,KAAK;CACvB;;CAGA,IAAI,UAAgC;EAClC,OAAO,KAAK;CACd;;CAGA,SAAS,OAAuB;EAC9B,KAAK,QAAQ,IAAI,MAAM,MAAM,KAAK;EAClC,OAAO;CACT;;;;;CAMA,cAAc,WAAmB,SAAiB,SAAuB;EACvE,IAAI,MAAM,KAAK,aAAa,IAAI,SAAS;EACzC,IAAI,CAAC,KAAK;GACR,sBAAM,IAAI,IAAI;GACd,KAAK,aAAa,IAAI,WAAW,GAAG;EACtC;EACA,IAAI,IAAI,SAAS,OAAO;EACxB,OAAO;CACT;;CAGA,MAAM,WAAyB;EAC7B,MAAM,QAAQ,KAAK,QAAQ,IAAI,SAAS;EACxC,IAAI,CAAC,OAAO;EACZ,KAAK,WAAW;EAChB,MAAM,UAAU,KAAK,QAAQ;CAC/B;;CAGA,QAAQ,MAAoB;EAC1B,IAAI,CAAC,KAAK,UAAU;EACpB,MAAM,cAAc,KAAK,aAAa,IAAI,KAAK,SAAS,IAAI;EAC5D,IAAI,CAAC,aAAa;EAClB,MAAM,SAAS,YAAY,IAAI,IAAI;EACnC,IAAI,WAAW,KAAA,GAAW;EAC1B,MAAM,OAAO,KAAK,QAAQ,IAAI,MAAM;EACpC,IAAI,CAAC,MAAM;EACX,KAAK,SAAS,SAAS,KAAK,QAAQ;EACpC,KAAK,WAAW;EAChB,KAAK,UAAU,KAAK,QAAQ;CAC9B;;CAGA,OAAO,IAAkB;EACvB,KAAK,UAAU,WAAW,IAAI,KAAK,QAAQ;CAC7C;AACF;;;;;;;;;ACrDA,SAAgB,aACd,MACA,GAAG,SACK;CACR,MAAM,aAAqC,QAAQ,KAAK,CAAC,KAAK,WAAW;EACvE;EACA;CACF,EAAE;CAEF,OAAO;EACL;EACA,MAAM,OAAsB;GAC1B,MAAM,SAAS,MAAM,MAAM;GAC3B,KAAK,MAAM,SAAS,YAAY;IAC9B,MAAM,OACJ,OAAO,MAAM,SAAS,aAAc,MAAM,KAAuB,IAAI,MAAM;IAC7E,MAAM,IAAI,QAAQ,MAAM,KAAK,IAAI;GACnC;GACA,OAAO;EACT;CACF;AACF;;;;;;;;;AClCA,IAAa,QAAb,MAAmB;;CAEjB;;CAEA;;CAGA,gBAAyB,IAAI,OAAe;;CAE5C,kBAA2B,IAAI,OAAe;;CAG9C,WAA6B,CAAC;;CAE9B,4BAAoB,IAAI,IAAY;CAEpC,YAAY,cAAsB,cAAsB;EACtD,KAAK,eAAe;EACpB,KAAK,eAAe;CACtB;;CAGA,QAAQ,WAA4B;EAClC,QACG,YAAY,KAAK,kBAAkB,KAAK,iBAAiB,YAAY,KAAK,kBAAkB;CAEjG;;CAGA,OAAO,UAAkB,WAAyB;EAChD,MAAM,UAAU,KAAK,QAAQ,SAAS;EACtC,MAAM,WAAW,KAAK,UAAU,IAAI,QAAQ;EAE5C,IAAI,WAAW,CAAC,UAAU;GACxB,KAAK,UAAU,IAAI,QAAQ;GAC3B,KAAK,SAAS,KAAK,QAAQ;GAC3B,KAAK,cAAc,KAAK,QAAQ;EAClC,OAAO,IAAI,CAAC,WAAW,UAAU;GAC/B,KAAK,UAAU,OAAO,QAAQ;GAC9B,MAAM,MAAM,KAAK,SAAS,QAAQ,QAAQ;GAC1C,IAAI,QAAQ,IAAI,KAAK,SAAS,OAAO,KAAK,CAAC;GAC3C,KAAK,gBAAgB,KAAK,QAAQ;EACpC;CACF;;CAGA,QAAQ,UAAwB;EAC9B,IAAI,KAAK,UAAU,IAAI,QAAQ,GAAG;GAChC,KAAK,UAAU,OAAO,QAAQ;GAC9B,MAAM,MAAM,KAAK,SAAS,QAAQ,QAAQ;GAC1C,IAAI,QAAQ,IAAI,KAAK,SAAS,OAAO,KAAK,CAAC;GAC3C,KAAK,gBAAgB,KAAK,QAAQ;EACpC;CACF;;CAGA,CAAC,OAAO,YAAsC;EAC5C,OAAO,KAAK,SAAS,OAAO,SAAS,CAAC;CACxC;;CAGA,IAAI,QAAgB;EAClB,OAAO,KAAK,SAAS;CACvB;;CAGA,IAAI,UAA2B;EAC7B,OAAO,KAAK,UAAU,IAAI,QAAQ;CACpC;AACF;;AAGA,IAAa,eAAb,MAA0B;CACxB,WAAmB;CACnB,WAAmB;CAEnB,KAAK,GAAG,YAA2C;EACjD,KAAK,MAAM,KAAK,YACd,KAAK,YAAY,EAAE;EAErB,OAAO;CACT;CAEA,QAAQ,GAAG,YAA2C;EACpD,KAAK,MAAM,KAAK,YACd,KAAK,YAAY,EAAE;EAErB,OAAO;CACT;;CAGA,QAAe;EACb,OAAO,IAAI,MAAM,KAAK,UAAU,KAAK,QAAQ;CAC/C;AACF;;;;;;;;;;;;;;;;AC5EA,SAAgB,aAAa,OAAc,IAAyB;CAClE,MAAM,WAAW,OAAc,OAAe;EAC5C,GAAG,OAAO,IAAI,KAAK;CACrB;CACA,OAAO;EAAE;EAAO;EAAI,UAAU;CAAQ;AACxC;;;;;;;;ACVA,SAAgB,qBAAqB,OAAyB;CAE5D,OAAO,aADG,MAAM,MAAM,UAAU,QACZ,IAAI,UAAU,IAAI,MAAM;EAC1C,KAAK,MAAM,MAAM,UAAU;GACzB,MAAM,MAAM,EAAE,IAAI,IAAI,QAAQ;GAC9B,MAAM,MAAM,EAAE,IAAI,IAAI,QAAQ;GAC9B,IAAI,KAAK,IAAI,IAAI;GACjB,IAAI,KAAK,IAAI,IAAI;EACnB;CACF,CAAC;AACH;;;;;;;;;;;;;;;;;;AAmBA,SAAgB,qBACd,OACA,UACA,OACW;CACX,MAAM,IAAI,SAAS,MAAM,MAAM,QAAQ;CACvC,MAAM,UAAoB,CAAC;CAC3B,OAAO,aAAa,IAAI,UAAU,IAAI,MAAM;EAC1C,QAAQ,SAAS;EACjB,KAAK,MAAM,MAAM,UAAU;GACzB,MAAM,OAAO,EAAE,IAAI,IAAI,QAAQ;GAC/B,KAAK,aAAa;GAClB,IAAI,KAAK,aAAa,GACpB,QAAQ,KAAK,EAAE;EAEnB;EACA,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAClC,SAAS,QAAQ,IAAK,CAAC;CAE3B,CAAC;AACH;;;;;;;;;;;;;;;;;;;AAoBA,SAAgB,uBACd,OACA,QACA,QACA,OACW;CACX,MAAM,IAAI,SAAS,MAAM,MAAM,QAAQ;CACvC,MAAM,UAAoB,CAAC;CAC3B,OAAO,aAAa,IAAI,UAAU,KAAK,MAAM;EAC3C,QAAQ,SAAS;EACjB,KAAK,MAAM,MAAM,UAAU;GACzB,MAAM,MAAM,EAAE,IAAI,IAAI,QAAQ;GAC9B,IACE,IAAI,IAAI,OAAO,QACf,IAAI,IAAI,OAAO,QACf,IAAI,IAAI,OAAO,QACf,IAAI,IAAI,OAAO,MAEf,QAAQ,KAAK,EAAE;EAEnB;EACA,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAClC,OAAO,QAAQ,IAAK,CAAC;CAEzB,CAAC;AACH;;;;;;;;;AAUA,SAAgB,qBAAqB,OAAyB;CAE5D,OAAO,aADG,MAAM,MAAM,UAAU,QACZ,IAAI,UAAU,KAAK,MAAM;EAC3C,KAAK,MAAM,MAAM,UAAU;GACzB,MAAM,WAAW,EAAE,IAAI,IAAI,QAAQ;GACnC,MAAM,IAAI,EAAE,IAAI,SAAS,QAAQ,QAAQ;GACzC,IAAI,MAAM,KAAA,GAAW;GACrB,MAAM,MAAM,EAAE,IAAI,IAAI,QAAQ;GAC9B,IAAI,IAAI,EAAE,IAAI,SAAS;GACvB,IAAI,IAAI,EAAE,IAAI,SAAS;EACzB;CACF,CAAC;AACH;;;;;;;;;;;;;;;AAgBA,SAAgB,uBACd,OACA,UACW;CACX,MAAM,IAAI,MAAM,MAAM,QAAQ;CAC9B,MAAM,UAAoB,CAAC;CAC3B,OAAO,aAAa,IAAI,UAAU,KAAK,MAAM;EAC3C,QAAQ,SAAS;EACjB,KAAK,MAAM,MAAM,UAAU;GACzB,MAAM,WAAW,EAAE,IAAI,IAAI,QAAQ;GACnC,IAAI,CAAC,EAAE,OAAO,SAAS,MAAM,GAC3B,QAAQ,KAAK,EAAE;EAEnB;EACA,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAClC,SAAS,QAAQ,IAAK,CAAC;CAE3B,CAAC;AACH;;;;;;;;;ACnKA,IAAa,QAAb,MAAmB;CACjB,SAAiB;CACjB,6BAAqB,IAAI,IAAoB;CAC7C,kCAA0B,IAAI,IAAkC;CAChE,UAA2B,CAAC;CAC5B,iBAAyB;CACzB,qBAA6C;CAC7C,UAGM,CAAC;CACP,gBAAwB;;CAGxB,QAAgB;EACd,MAAM,KAAK,KAAK;EAChB,KAAK,WAAW,IAAI,IAAI,CAAC;EACzB,OAAO;CACT;;CAGA,QAAQ,UAAwB;EAE9B,IADa,KAAK,WAAW,IAAI,QAC1B,MAAM,KAAA,GAAW;EAGxB,KAAK,MAAM,GAAG,UAAU,KAAK,iBAC3B,MAAM,OAAO,QAAQ;EAGvB,KAAK,WAAW,OAAO,QAAQ;EAG/B,KAAK;EACL,IAAI;GACF,KAAK,MAAM,SAAS,KAAK,SACvB,MAAM,QAAQ,QAAQ;EAE1B,UAAU;GACR,KAAK,kBAAkB;EACzB;CACF;;CAGA,IAAO,UAAkB,KAAsB,MAAgB;EAC7D,MAAM,OAAO,KAAK,WAAW,IAAI,QAAQ;EACzC,IAAI,SAAS,KAAA,GAAW;EAGxB,IAAI,QAAQ,KAAK,gBAAgB,IAAI,IAAI,EAAE;EAC3C,IAAI,CAAC,OAAO;GACV,wBAAQ,IAAI,IAAI;GAChB,KAAK,gBAAgB,IAAI,IAAI,IAAI,KAAK;EACxC;EACA,MAAM,IAAI,UAAU,SAAS,KAAA,IAAY,OAAO,IAAI,OAAO,CAAC;EAG5D,MAAM,UAAU,OAAO,IAAI;EAC3B,KAAK,WAAW,IAAI,UAAU,OAAO;EAGrC,KAAK;EACL,IAAI;GACF,KAAK,MAAM,SAAS,KAAK,SACvB,MAAM,OAAO,UAAU,OAAO;EAElC,UAAU;GACR,KAAK,kBAAkB;EACzB;CACF;;CAGA,OAAU,UAAkB,KAA4B;EACtD,MAAM,OAAO,KAAK,WAAW,IAAI,QAAQ;EACzC,IAAI,SAAS,KAAA,GAAW;EAExB,MAAM,QAAQ,KAAK,gBAAgB,IAAI,IAAI,EAAE;EAC7C,IAAI,OAAO,MAAM,OAAO,QAAQ;EAEhC,MAAM,UAAU,OAAO,CAAC,IAAI;EAC5B,KAAK,WAAW,IAAI,UAAU,OAAO;EAGrC,KAAK;EACL,IAAI;GACF,KAAK,MAAM,SAAS,KAAK,SACvB,MAAM,OAAO,UAAU,OAAO;EAElC,UAAU;GACR,KAAK,kBAAkB;EACzB;CACF;;CAGA,IAAO,UAAkB,KAAqC;EAE5D,OADc,KAAK,gBAAgB,IAAI,IAAI,EAChC,CAAC,EAAE,IAAI,QAAQ;CAC5B;;CAGA,IAAI,UAAkB,KAAqC;EACzD,MAAM,OAAO,KAAK,WAAW,IAAI,QAAQ;EACzC,OAAO,SAAS,KAAA,MAAc,OAAO,IAAI,SAAS;CACpD;;CAGA,OAAO,UAA2B;EAChC,OAAO,KAAK,WAAW,IAAI,QAAQ;CACrC;;CAGA,IAAI,cAAsB;EACxB,OAAO,KAAK,WAAW;CACzB;;;;;;;;CASA,cAAc,IAAoC;EAChD,KAAK,MAAM,YAAY,KAAK,WAAW,KAAK,GAC1C,GAAG,QAAQ;CAEf;;;;;;;;CASA,MAAM,GAAG,YAA4C;EACnD,IAAI,OAAO;EACX,KAAK,MAAM,KAAK,YACd,QAAQ,EAAE;EAEZ,MAAM,IAAI,IAAI,MAAM,MAAM,CAAC;EAC3B,KAAK,QAAQ,KAAK,CAAC;EAGnB,KAAK,MAAM,CAAC,UAAU,SAAS,KAAK,YAClC,EAAE,OAAO,UAAU,IAAI;EAGzB,OAAO;CACT;;CAGA,eAA6B;EAC3B,OAAO,IAAI,mBAAmB,IAAI;CACpC;;;;;;;;;;CAWA,YAAY,GAAgB;EAC1B,IAAI,KAAK,iBAAiB,GAAG;GAC3B,IAAI,KAAK,uBAAuB,MAAM,KAAK,qBAAqB,CAAC;GACjE,KAAK,mBAAmB,KAAK,CAAC;GAC9B;EACF;EACA,MAAM,MAAM,KAAK,QAAQ,QAAQ,CAAC;EAClC,IAAI,QAAQ,IAAI,KAAK,QAAQ,OAAO,KAAK,CAAC;CAC5C;;CAGA,oBAAkC;EAChC,KAAK;EACL,IAAI,KAAK,mBAAmB,KAAK,KAAK,uBAAuB,MAAM;GACjE,KAAK,MAAM,KAAK,KAAK,oBAAoB;IACvC,MAAM,MAAM,KAAK,QAAQ,QAAQ,CAAC;IAClC,IAAI,QAAQ,IAAI,KAAK,QAAQ,OAAO,KAAK,CAAC;GAC5C;GACA,KAAK,mBAAmB,SAAS;EACnC;CACF;;CAGA,UAAU,IAAwC,WAAW,GAAS;EACpE,KAAK,QAAQ,KAAK;GAAE;GAAI;EAAS,CAAC;EAClC,KAAK,gBAAgB;CACvB;;CAGA,aAAa,IAA8C;EACzD,MAAM,MAAM,KAAK,QAAQ,WAAW,MAAM,EAAE,OAAO,EAAE;EACrD,IAAI,QAAQ,IAAI,KAAK,QAAQ,OAAO,KAAK,CAAC;CAC5C;;CAGA,KAAK,IAAkB;EACrB,IAAI,CAAC,KAAK,eAAe;GACvB,KAAK,QAAQ,MAAM,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;GACnD,KAAK,gBAAgB;EACvB;EACA,KAAK,MAAM,OAAO,KAAK,SACrB,IAAI,GAAG,MAAM,EAAE;CAEnB;;CAGA,eAAe,GAAgB;EAC7B,KAAK,QAAQ,KAAK,CAAC;EAEnB,KAAK,MAAM,CAAC,UAAU,SAAS,KAAK,YAClC,EAAE,OAAO,UAAU,IAAI;CAE3B;AACF;;;;AAKA,IAAM,qBAAN,cAAiC,aAAa;CAC5C;CAEA,YAAY,OAAc;EACxB,MAAM;EACN,KAAK,QAAQ;CACf;CAEA,QAAwB;EACtB,MAAM,IAAI,MAAM,MAAM;EACtB,KAAK,MAAM,eAAe,CAAC;EAC3B,OAAO;CACT;AACF"}
package/package.json CHANGED
@@ -1,9 +1,9 @@
1
1
  {
2
2
  "name": "@flare-engine/ecs",
3
- "version": "0.2.1",
3
+ "version": "0.3.1",
4
4
  "description": "Entity-Component-System with archetype queries",
5
5
  "keywords": ["flare-engine", "ecs", "entity-component-system"],
6
- "license": "MIT",
6
+ "license": "Apache-2.0",
7
7
  "author": "Grzegorz Otto",
8
8
  "homepage": "https://github.com/grzott/flare-engine#readme",
9
9
  "bugs": {
@@ -19,21 +19,29 @@
19
19
  "types": "dist/index.d.ts",
20
20
  "exports": {
21
21
  ".": {
22
- "types": "./dist/index.d.ts",
23
- "import": "./dist/index.mjs",
24
- "require": "./dist/index.js"
22
+ "import": {
23
+ "types": "./dist/index.d.mts",
24
+ "default": "./dist/index.mjs"
25
+ },
26
+ "require": {
27
+ "types": "./dist/index.d.ts",
28
+ "default": "./dist/index.js"
29
+ }
25
30
  }
26
31
  },
27
- "files": ["dist", "README.md", "LICENSE"],
32
+ "files": ["dist", "README.md", "LICENSE", "NOTICE"],
28
33
  "scripts": {
29
- "build": "tsup",
34
+ "build": "tsdown",
30
35
  "test": "bun test",
31
36
  "lint": "biome check src/",
32
37
  "typecheck": "tsc --noEmit"
33
38
  },
34
39
  "dependencies": {
35
- "@flare-engine/events": "^0.2.1",
36
- "@flare-engine/math": "^0.2.1"
40
+ "@flare-engine/events": "^0.3.1",
41
+ "@flare-engine/math": "^0.3.1"
42
+ },
43
+ "engines": {
44
+ "node": ">=20"
37
45
  },
38
46
  "publishConfig": {
39
47
  "access": "restricted",