@driftengine/entities 3.61.0

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2026 Drift Technologies
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/NOTICE

@@ -0,0 +1,9 @@
+DriftEngine
+Copyright 2026 Drift Technologies
+
+This product includes software developed at Drift Technologies
+(https://github.com/drftrun/driftengine).
+
+Licensed under the Apache License, Version 2.0. Section 4(d) of that licence
+requires this NOTICE to be reproduced in any derivative work you distribute,
+in the source, the documentation, or a display generated by the work.

package/README.md

@@ -0,0 +1,93 @@
+# @driftengine/entities
+
+Entities with generational identity, component storage, queries, systems with declared reads and
+writes, prefabs and scene serialization.
+
+**It imports no other engine package.** An entity model that knew what a `Transform` was would be an
+entity model that knew it had a scene — and the argument for declared reads and writes is that a
+declaration is about a component _id_ rather than about what the component means.
+
+It also **declares no component types**. A consumer writes the ones its world needs, or takes them
+from whichever package owns the subsystem.
+
+```ts
+import { EntityAllocator } from '@driftengine/entities';
+
+const entities = new EntityAllocator();
+const player = entities.create();
+entities.destroy(player);
+entities.alive(player); // false — and the entity that takes the slot is a different handle
+```
+
+## The handle
+
+An entity is one number: a 26-bit index and a 27-bit generation, combined arithmetically. **The
+generation is what stops a stale handle addressing a live entity** — an index freed and reused makes
+every old reference silently valid, pointing at a different thing with no error anywhere.
+
+The conventional packed `Uint32` splits 24 and 8, so a slot's 257th reuse hands back a handle
+identical to its first. This split gives sixty-seven million entities and 134 million reuses of each
+slot, and costs four bytes per stored entity because a handle lives in a `Float64Array`.
+
+26 + 27 is the whole 53-bit budget, exactly. There is no headroom, deliberately, and a test asserts
+the top handle so that is discovered here rather than in a wrong comparison.
+
+## Systems declare what they touch
+
+```ts
+const schedule = buildSchedule([
+  { name: 'hunger', writes: [Hunger], everyTicks: 60, run(view) { … } },
+  { name: 'decay', reads: [Hunger], writes: [Health], after: ['hunger'], run(view) { … } },
+]);
+runSchedule(world, schedule, tick);
+```
+
+**The declaration is enforced.** A system that writes something it did not declare is refused
+naming both — a schedule derived from a lie is worse than no schedule. `writes` implies `reads`.
+
+Order is declaration order, adjusted only by `after`, which is topologically sorted with
+declaration order as the tie-break. A cycle in `after` is refused naming the systems.
+
+`everyTicks` strides the **fixed step** and is never a rate in seconds: a rate in wall-clock time
+leaves the determinism contract on its first dropped frame.
+
+**Destroying from inside a system is deferred** to after it returns. A removal swaps the last dense
+entry into the hole, so removing mid-walk moves an entity the cursor has already passed into a
+position it has already visited — and that entity is never seen, silently, and only whichever one
+happened to be last. `create` and `add` are immediate, and a newly added entity may be visited in
+the same pass.
+
+## Prefabs and scenes
+
+```ts
+const guard = definePrefab('guard', [
+  [Health, { current: 100 }],
+  [Perception, { sightRange: 40 }],
+]);
+const spawned = instantiate(world, guard, { Perception: { sightRange: 60 } });
+
+const scene = serializeWorld(world, [Health, Perception]);
+const result = deserializeWorld(fresh, scene, [Health, Perception]);
+```
+
+**A prefab is a value with no link back to its instances.** A live link is what an editor wants,
+and it costs every instance a record of which fields it has overridden; Track K can add that record
+without changing what a prefab is.
+
+**A scene addresses every value by a stable field id**, never a name and never a position. A field
+inserted in the middle would renumber everything after it, and a save would then load the right
+names with the wrong values — worse than failing, because it looks like it worked.
+
+Loading across a change goes through `driftscript`'s migration, unchanged: a field added since
+arrives with its default, one removed is dropped, and one whose **type** changed is refused naming
+it. Nothing is written into the world until every entity has migrated, so a refusal on the fifth
+does not leave four behind.
+
+Entity references are **remapped** on load rather than preserved, because a saved handle's slot may
+be live in the world being loaded into. That only works for fields declared `Entity`; a number that
+happens to hold one is a number.
+
+## Documentation
+
+This file is the reference, including the five things the model refuses and what
+would reverse each.

package/dist/entity.d.ts

@@ -0,0 +1,136 @@
+/**
+ * What an entity *is*, and the allocator that hands them out.
+ *
+ * An entity is a handle and nothing else — no object, no class, no fields. What it *has* lives in
+ * component stores keyed by it, which is the whole arrangement, and it is why an entity can be a
+ * number in a typed array rather than something a frame has to chase a pointer to.
+ *
+ * ---
+ *
+ * ## The generation, and why it may not wrap
+ *
+ * **An index freed and reused makes every old reference to it silently valid** — pointing at a
+ * different thing, of a different kind, with no error anywhere. That is the failure the generation
+ * exists to prevent, so the only question worth deciding is how long before it wraps and brings the
+ * failure back.
+ *
+ * The conventional answer is a packed 32-bit handle, twenty-four bits of index and eight of
+ * generation. It makes a slot's 257th reuse hand back a handle **identical** to its first. Here the
+ * split is 26 and 27, combined arithmetically rather than by shifting, because a shift is 32-bit in
+ * JavaScript and a double is exact to 53: sixty-seven million entities, and 134 million reuses of
+ * each slot before a repeat.
+ *
+ * **26 + 27 is the whole 53-bit budget, with nothing spare**, so the largest handle is
+ * `Number.MAX_SAFE_INTEGER` itself. A third field in a handle, or one more bit of either, stops the
+ * arithmetic being exact — and the failure then is a handle that compares equal to a different one,
+ * which is the same hole the generation was added to close. A test asserts the top handle rather
+ * than leaving that to be discovered.
+ *
+ * **The cost is that a handle is eight bytes rather than four**, because it lives in a
+ * `Float64Array` and not a `Uint32Array`. That is paid on entity *lists* rather than on component
+ * data, which is where the bytes actually are.
+ *
+ * **What would make this wrong** is a consumer with more than 67 million live entities, at which
+ * point the split moves and every stored scene has to be rewritten — which is why the two numbers
+ * are here, once, and every site goes through `packEntity` rather than writing the arithmetic.
+ */
+/** One past the highest index a handle can carry: 2^26, or 67,108,864 entities. */
+export declare const ENTITY_INDEX_CEILING = 67108864;
+/** One past the highest generation: 2^27, or 134,217,728 reuses of one slot. */
+export declare const ENTITY_GENERATION_CEILING = 134217728;
+/**
+ * An entity handle.
+ *
+ * A plain number so it stores in a typed array and compares with `===`. It is opaque: reading the
+ * index or the generation out of one is what `entityIndex` and `entityGeneration` are for, and code
+ * that does the arithmetic itself is code that has to be found when the split moves.
+ */
+export type Entity = number;
+export declare function packEntity(index: number, generation: number): Entity;
+export declare function entityIndex(entity: Entity): number;
+export declare function entityGeneration(entity: Entity): number;
+/**
+ * An allocator's whole position, for a rewind.
+ *
+ * **Reused between saves rather than made per save.** A rollback loop takes one of these sixty
+ * times a second, so the arrays are grown to the allocator's own capacity once and then written
+ * over; the fields are mutable for that reason and not because a caller should touch them.
+ *
+ * The free queue is held as a count and a typed array instead of the `number[]` the allocator
+ * keeps, so a save is a memcpy. **Its order is part of the state**, not an incidental detail: the
+ * queue is first-in-first-out precisely so slot wear spreads, and restoring the same slots in a
+ * different order hands out different handles on the next create.
+ */
+export interface AllocatorSnapshot {
+    generations: Uint32Array;
+    live: Uint8Array;
+    free: Int32Array;
+    freeCount: number;
+    highWater: number;
+    aliveCount: number;
+}
+export declare function createAllocatorSnapshot(): AllocatorSnapshot;
+export interface EntityAllocatorOptions {
+    /**
+     * How many slots this allocator may ever hand out.
+     *
+     * Present so a test can reach the refusal without allocating sixty-seven million slots. A
+     * consumer has no reason to set it, and setting it low does not save memory — the arrays grow on
+     * demand either way.
+     */
+    readonly ceiling?: number;
+}
+/**
+ * Slots, their generations, and a queue of the ones that are free.
+ *
+ * **The free list is first-in-first-out**, and that is what makes the generation ceiling a number
+ * about the pool rather than about one slot. A stack hands the same slot straight back, so one
+ * spawn-and-destroy pair in a loop burns that slot's whole range while every other slot sits
+ * unused. A queue spreads the wear.
+ *
+ * The cost is that a freed slot is not reused until every other freed slot has been, so a workload
+ * that churns a handful of entities touches more of the arrays than a stack would. That is a cache
+ * argument against a correctness one, and correctness wins.
+ */
+export declare class EntityAllocator {
+    /** Generation per slot. Index `i` holds the generation of whatever lives at index `i` now. */
+    private generations;
+    /** Whether slot `i` is currently handed out. */
+    private live;
+    /** Freed slots, oldest first. A plain array: a queue that grows, drained from the front. */
+    private readonly free;
+    /** How far into the arrays this allocator has ever reached. */
+    private highWater;
+    private alive_;
+    private readonly ceiling;
+    constructor(options?: EntityAllocatorOptions);
+    get liveCount(): number;
+    create(): Entity;
+    /**
+     * Free an entity's slot. `false` when the handle was already stale, which is not an error.
+     *
+     * A caller destroying something twice is a caller that lost track, and the honest answer is that
+     * there was nothing to destroy — the same shape `patchModule` and `Scope.leave` use.
+     */
+    destroy(entity: Entity): boolean;
+    alive(entity: Entity): boolean;
+    /**
+     * Copy this allocator's position into a slot, growing the slot's arrays if it has not held one
+     * this large before.
+     *
+     * **`highWater` bounds every copy**, because slots beyond it have never been handed out and their
+     * generations are zero on both sides. That is what keeps the cost proportional to the world rather
+     * than to the arrays' capacity.
+     */
+    saveInto(slot: AllocatorSnapshot): void;
+    /**
+     * Put this allocator back to a saved position.
+     *
+     * **Slots between the saved `highWater` and the current one are cleared rather than left**, and
+     * that is the whole difference between a restore and a partial one. An entity created after the
+     * save has a live slot the save knows nothing about; leaving it live would leave an entity in the
+     * world that the snapshot says does not exist, and its handle would keep answering `alive`.
+     */
+    loadFrom(slot: AllocatorSnapshot): void;
+    private grow;
+}

package/dist/entity.js

@@ -0,0 +1,201 @@
+/**
+ * What an entity *is*, and the allocator that hands them out.
+ *
+ * An entity is a handle and nothing else — no object, no class, no fields. What it *has* lives in
+ * component stores keyed by it, which is the whole arrangement, and it is why an entity can be a
+ * number in a typed array rather than something a frame has to chase a pointer to.
+ *
+ * ---
+ *
+ * ## The generation, and why it may not wrap
+ *
+ * **An index freed and reused makes every old reference to it silently valid** — pointing at a
+ * different thing, of a different kind, with no error anywhere. That is the failure the generation
+ * exists to prevent, so the only question worth deciding is how long before it wraps and brings the
+ * failure back.
+ *
+ * The conventional answer is a packed 32-bit handle, twenty-four bits of index and eight of
+ * generation. It makes a slot's 257th reuse hand back a handle **identical** to its first. Here the
+ * split is 26 and 27, combined arithmetically rather than by shifting, because a shift is 32-bit in
+ * JavaScript and a double is exact to 53: sixty-seven million entities, and 134 million reuses of
+ * each slot before a repeat.
+ *
+ * **26 + 27 is the whole 53-bit budget, with nothing spare**, so the largest handle is
+ * `Number.MAX_SAFE_INTEGER` itself. A third field in a handle, or one more bit of either, stops the
+ * arithmetic being exact — and the failure then is a handle that compares equal to a different one,
+ * which is the same hole the generation was added to close. A test asserts the top handle rather
+ * than leaving that to be discovered.
+ *
+ * **The cost is that a handle is eight bytes rather than four**, because it lives in a
+ * `Float64Array` and not a `Uint32Array`. That is paid on entity *lists* rather than on component
+ * data, which is where the bytes actually are.
+ *
+ * **What would make this wrong** is a consumer with more than 67 million live entities, at which
+ * point the split moves and every stored scene has to be rewritten — which is why the two numbers
+ * are here, once, and every site goes through `packEntity` rather than writing the arithmetic.
+ */
+/** One past the highest index a handle can carry: 2^26, or 67,108,864 entities. */
+export const ENTITY_INDEX_CEILING = 67_108_864;
+/** One past the highest generation: 2^27, or 134,217,728 reuses of one slot. */
+export const ENTITY_GENERATION_CEILING = 134_217_728;
+export function packEntity(index, generation) {
+    return index + generation * ENTITY_INDEX_CEILING;
+}
+export function entityIndex(entity) {
+    return entity % ENTITY_INDEX_CEILING;
+}
+export function entityGeneration(entity) {
+    return Math.floor(entity / ENTITY_INDEX_CEILING);
+}
+export function createAllocatorSnapshot() {
+    return {
+        generations: new Uint32Array(0),
+        live: new Uint8Array(0),
+        free: new Int32Array(0),
+        freeCount: 0,
+        highWater: 0,
+        aliveCount: 0,
+    };
+}
+/**
+ * Slots, their generations, and a queue of the ones that are free.
+ *
+ * **The free list is first-in-first-out**, and that is what makes the generation ceiling a number
+ * about the pool rather than about one slot. A stack hands the same slot straight back, so one
+ * spawn-and-destroy pair in a loop burns that slot's whole range while every other slot sits
+ * unused. A queue spreads the wear.
+ *
+ * The cost is that a freed slot is not reused until every other freed slot has been, so a workload
+ * that churns a handful of entities touches more of the arrays than a stack would. That is a cache
+ * argument against a correctness one, and correctness wins.
+ */
+export class EntityAllocator {
+    /** Generation per slot. Index `i` holds the generation of whatever lives at index `i` now. */
+    generations = new Uint32Array(64);
+    /** Whether slot `i` is currently handed out. */
+    live = new Uint8Array(64);
+    /** Freed slots, oldest first. A plain array: a queue that grows, drained from the front. */
+    free = [];
+    /** How far into the arrays this allocator has ever reached. */
+    highWater = 0;
+    alive_ = 0;
+    ceiling;
+    constructor(options = {}) {
+        this.ceiling = options.ceiling ?? ENTITY_INDEX_CEILING;
+    }
+    get liveCount() {
+        return this.alive_;
+    }
+    create() {
+        /* `shift` is O(n) on a large array and this is not a per-frame path — an entity is created when
+           something enters the world. A ring buffer is the fix if a profile ever says so. */
+        const recycled = this.free.shift();
+        if (recycled !== undefined) {
+            this.live[recycled] = 1;
+            this.alive_ += 1;
+            return packEntity(recycled, this.generations[recycled]);
+        }
+        if (this.highWater >= this.ceiling) {
+            throw new Error(`this world has handed out ${this.ceiling} entities, which is its index ceiling. Nothing ` +
+                'is wrapped or reused: a handle beyond the ceiling would repeat one that is already ' +
+                'live, and answering the wrong entity is worse than refusing.');
+        }
+        const index = this.highWater;
+        this.highWater += 1;
+        this.grow(index + 1);
+        this.live[index] = 1;
+        this.alive_ += 1;
+        return packEntity(index, this.generations[index]);
+    }
+    /**
+     * Free an entity's slot. `false` when the handle was already stale, which is not an error.
+     *
+     * A caller destroying something twice is a caller that lost track, and the honest answer is that
+     * there was nothing to destroy — the same shape `patchModule` and `Scope.leave` use.
+     */
+    destroy(entity) {
+        if (!this.alive(entity))
+            return false;
+        const index = entityIndex(entity);
+        this.live[index] = 0;
+        /*
+         * The generation moves on **destroy**, not on the next create, so a handle stops being live the
+         * moment it is destroyed rather than the moment somebody happens to take its slot. Moving it
+         * later would leave a window in which a destroyed handle still answered `alive`.
+         */
+        const next = (this.generations[index] + 1) % ENTITY_GENERATION_CEILING;
+        this.generations[index] = next;
+        this.free.push(index);
+        this.alive_ -= 1;
+        return true;
+    }
+    alive(entity) {
+        const index = entityIndex(entity);
+        if (index >= this.highWater)
+            return false;
+        return this.live[index] === 1 && this.generations[index] === entityGeneration(entity);
+    }
+    /**
+     * Copy this allocator's position into a slot, growing the slot's arrays if it has not held one
+     * this large before.
+     *
+     * **`highWater` bounds every copy**, because slots beyond it have never been handed out and their
+     * generations are zero on both sides. That is what keeps the cost proportional to the world rather
+     * than to the arrays' capacity.
+     */
+    saveInto(slot) {
+        const reach = this.highWater;
+        if (slot.generations.length < reach)
+            slot.generations = new Uint32Array(reach);
+        if (slot.live.length < reach)
+            slot.live = new Uint8Array(reach);
+        if (slot.free.length < this.free.length)
+            slot.free = new Int32Array(this.free.length);
+        for (let i = 0; i < reach; i++) {
+            slot.generations[i] = this.generations[i];
+            slot.live[i] = this.live[i];
+        }
+        for (let i = 0; i < this.free.length; i++)
+            slot.free[i] = this.free[i];
+        slot.freeCount = this.free.length;
+        slot.highWater = reach;
+        slot.aliveCount = this.alive_;
+    }
+    /**
+     * Put this allocator back to a saved position.
+     *
+     * **Slots between the saved `highWater` and the current one are cleared rather than left**, and
+     * that is the whole difference between a restore and a partial one. An entity created after the
+     * save has a live slot the save knows nothing about; leaving it live would leave an entity in the
+     * world that the snapshot says does not exist, and its handle would keep answering `alive`.
+     */
+    loadFrom(slot) {
+        this.grow(slot.highWater);
+        for (let i = 0; i < slot.highWater; i++) {
+            this.generations[i] = slot.generations[i];
+            this.live[i] = slot.live[i];
+        }
+        for (let i = slot.highWater; i < this.highWater; i++) {
+            this.generations[i] = 0;
+            this.live[i] = 0;
+        }
+        this.free.length = 0;
+        for (let i = 0; i < slot.freeCount; i++)
+            this.free.push(slot.free[i]);
+        this.highWater = slot.highWater;
+        this.alive_ = slot.aliveCount;
+    }
+    grow(needed) {
+        if (needed <= this.generations.length)
+            return;
+        let size = this.generations.length;
+        while (size < needed)
+            size *= 2;
+        const generations = new Uint32Array(size);
+        generations.set(this.generations);
+        this.generations = generations;
+        const live = new Uint8Array(size);
+        live.set(this.live);
+        this.live = live;
+    }
+}