@datamoc/mw_games 0.44.2 → 0.46.0

package/dist/roguelike/Scheduler.js

@@ -1,154 +0,0 @@
-/**
- * Whose turn it is.
- *
- * Not "everyone moves once per turn": each actor has a *speed*, and an action costs time
- * scaled by it. A hasted creature gets two moves to your one, a heavy weapon costs more
- * than a dagger, and a slowed one loses turns, all of which fall out of one number rather
- * than needing special cases.
- *
- * The queue is ordered by the time at which each actor next acts. `now` only ever moves
- * forward, so effects that expire can be timestamped against it.
- *
- * @example
- * ```ts
- * import { Scheduler, type Actor } from '@datamoc/mw_games/roguelike';
- *
- * interface Monster extends Actor { name: string }
- *
- * const scheduler = new Scheduler<Monster>();
- * scheduler.add({ name: 'hero', speed: 1 });
- * scheduler.add({ name: 'fast rat', speed: 2 }); // acts twice as often
- *
- * const acting = scheduler.peek(); // whoever's turn it is
- * scheduler.spend(1); // charge them for a normal-speed action, hand the turn on
- * ```
- */
-export class Scheduler {
-    constructor() {
-        this.entries = [];
-        this.sequence = 0;
-        /** the current time; advances to each actor's turn as it comes up */
-        this.now = 0;
-    }
-    get size() {
-        return this.entries.length;
-    }
-    get actors() {
-        return this.entries.map((entry) => entry.actor);
-    }
-    has(actor) {
-        return this.entries.some((entry) => entry.actor === actor);
-    }
-    /**
-     * Puts an actor in the queue.
-     *
-     * @param delay time before its first turn. Spawning a monster with a small random delay
-     * stops a room full of them from acting in lockstep.
-     * @param priority higher-priority actors resolve first when scheduled at the same time.
-     */
-    add(actor, delay = 0, priority = actor.priority ?? 0) {
-        if (!Number.isFinite(delay) || delay < 0)
-            throw new Error('scheduler delay must be finite and non-negative');
-        if (!Number.isFinite(priority))
-            throw new Error('scheduler priority must be finite');
-        this.entries.push({ actor, time: this.now + delay, sequence: this.sequence++, priority });
-        this.sort();
-    }
-    remove(actor) {
-        const index = this.entries.findIndex((entry) => entry.actor === actor);
-        if (index !== -1)
-            this.entries.splice(index, 1);
-    }
-    clear() {
-        this.entries.length = 0;
-        this.now = 0;
-        this.sequence = 0;
-    }
-    /** whoever acts next, without removing them; time advances to their turn */
-    peek() {
-        const next = this.entries[0];
-        if (!next)
-            return null;
-        //time only moves forward, never back to an entry scheduled in the past
-        this.now = Math.max(this.now, next.time);
-        return next.actor;
-    }
-    /**
-     * Charges the current actor for what it did, and hands the turn on.
-     *
-     * @param cost time the action took at speed 1; divided by the actor's speed. A cost of 0
-     * is a free action: the actor keeps its place at `now` but still goes behind any other
-     * actor already tied with it, since its sequence number is refreshed like any other spend.
-     */
-    spend(cost) {
-        const entry = this.entries[0];
-        if (!entry)
-            return;
-        const speed = entry.actor.speed ?? 1;
-        entry.time = this.now + cost / (speed > 0 ? speed : 1);
-        //a fresh sequence number, so an actor that just acted goes behind anyone tied with it
-        entry.sequence = this.sequence++;
-        this.sort();
-    }
-    /**
-     * Pushes a specific actor's next turn back, independent of whose turn it currently is -
-     * a stun or slow effect landing on someone other than the current actor, for instance.
-     *
-     * @param delay time added to that actor's next scheduled turn
-     */
-    postpone(actor, delay) {
-        const entry = this.entries.find((entry) => entry.actor === actor);
-        if (!entry)
-            return;
-        entry.time += delay;
-        entry.sequence = this.sequence++;
-        this.sort();
-    }
-    /** the time at which an actor next acts, for a debug view or an interface */
-    timeOf(actor) {
-        return this.entries.find((entry) => entry.actor === actor)?.time ?? null;
-    }
-    /**
-     * Captures the queue as plain data, identifying each actor by whatever id the caller
-     * assigns it - the scheduler holds actor references, not ids, so it cannot invent one
-     * itself.
-     */
-    toJSON(actorId) {
-        return {
-            now: this.now,
-            sequence: this.sequence,
-            entries: this.entries.map((entry) => ({
-                id: actorId(entry.actor),
-                time: entry.time,
-                sequence: entry.sequence,
-                ...(entry.priority === 0 ? {} : { priority: entry.priority }),
-            })),
-        };
-    }
-    /**
-     * Rebuilds a scheduler from a snapshot taken by `toJSON`, restoring `now` and the
-     * sequence counter so that ties among actors added afterwards resolve exactly as they
-     * would have if the scheduler had never been serialised.
-     *
-     * @param actorOf resolves a snapshot id back to the live actor object it names
-     */
-    static restore(snapshot, actorOf) {
-        const scheduler = new Scheduler();
-        scheduler.now = snapshot.now;
-        scheduler.sequence = snapshot.sequence;
-        scheduler.entries = snapshot.entries.map((entry) => ({
-            actor: actorOf(entry.id),
-            time: entry.time,
-            sequence: entry.sequence,
-            priority: entry.priority ?? 0,
-        }));
-        scheduler.sort();
-        return scheduler;
-    }
-    sort() {
-        //few actors are ever queued, so a sort per action is cheaper than a heap and far
-        //easier to reason about; swap it out if a level ever holds thousands
-        this.entries.sort((a, b) => a.time - b.time || b.priority - a.priority || a.sequence - b.sequence);
-    }
-}
-//# sourceMappingURL=Scheduler.js.map

package/dist/roguelike/Scheduler.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Scheduler.js","sourceRoot":"","sources":["../../src/roguelike/Scheduler.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AA2BH,MAAM,OAAO,SAAS;IAAtB;QACS,YAAO,GAAe,EAAE,CAAC;QACzB,aAAQ,GAAG,CAAC,CAAC;QAErB,qEAAqE;QACrE,QAAG,GAAG,CAAC,CAAC;IAmIT,CAAC;IAjIA,IAAI,IAAI;QACP,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED,IAAI,MAAM;QACT,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACjD,CAAC;IAED,GAAG,CAAC,KAAQ;QACX,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC;IAC5D,CAAC;IAED;;;;;;OAMG;IACH,GAAG,CAAC,KAAQ,EAAE,KAAK,GAAG,CAAC,EAAE,QAAQ,GAAG,KAAK,CAAC,QAAQ,IAAI,CAAC;QACtD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;QAC7G,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;QACrF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,GAAG,KAAK,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC1F,IAAI,CAAC,IAAI,EAAE,CAAC;IACb,CAAC;IAED,MAAM,CAAC,KAAQ;QACd,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC;QACvE,IAAI,KAAK,KAAK,CAAC,CAAC;YAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC;IAED,KAAK;QACJ,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;QACb,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;IACnB,CAAC;IAED,4EAA4E;IAC5E,IAAI;QACH,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC;QAEvB,uEAAuE;QACvE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACzC,OAAO,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,IAAY;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK;YAAE,OAAO;QAEnB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;QACrC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,GAAG,IAAI,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,sFAAsF;QACtF,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QACjC,IAAI,CAAC,IAAI,EAAE,CAAC;IACb,CAAC;IAED;;;;;OAKG;IACH,QAAQ,CAAC,KAAQ,EAAE,KAAa;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC;QAClE,IAAI,CAAC,KAAK;YAAE,OAAO;QAEnB,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC;QACpB,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QACjC,IAAI,CAAC,IAAI,EAAE,CAAC;IACb,CAAC;IAED,6EAA6E;IAC7E,MAAM,CAAC,KAAQ;QACd,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,KAAK,KAAK,CAAC,EAAE,IAAI,IAAI,IAAI,CAAC;IAC1E,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,OAA6B;QACnC,OAAO;YACN,GAAG,EAAE,IAAI,CAAC,GAAG;YACb,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;gBACrC,EAAE,EAAE,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC;gBACxB,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,QAAQ,EAAE,KAAK,CAAC,QAAQ;gBACxB,GAAG,CAAC,KAAK,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC;aAC7D,CAAC,CAAC;SACH,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,OAAO,CAAkB,QAA2B,EAAE,OAA0B;QACtF,MAAM,SAAS,GAAG,IAAI,SAAS,EAAK,CAAC;QACrC,SAAS,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC;QAC7B,SAAS,CAAC,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC;QACvC,SAAS,CAAC,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YACpD,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACxB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,QAAQ,EAAE,KAAK,CAAC,QAAQ;YACxB,QAAQ,EAAE,KAAK,CAAC,QAAQ,IAAI,CAAC;SAC7B,CAAC,CAAC,CAAC;QACJ,SAAS,CAAC,IAAI,EAAE,CAAC;QACjB,OAAO,SAAS,CAAC;IAClB,CAAC;IAEO,IAAI;QACX,iFAAiF;QACjF,qEAAqE;QACrE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IACpG,CAAC;CACD"}

package/dist/roguelike/Secrets.d.ts

@@ -1,57 +0,0 @@
-import type { Level } from './Level.ts';
-/**
- * A cell that renders and blocks like its surroundings until revealed.
- *
- * The concealment itself is just terrain: `conceal` writes the disguise kind straight into
- * the `Level`, so a secret door already passes every `passable`/`transparent` check as
- * whatever it is disguised as - a wall that cannot be walked through or seen past, a floor
- * that can. Nothing in `FieldOfView` or `Pathfinder` needs to know secrets exist. What this
- * class remembers is the other half: which cells have a secret at all, and what they turn
- * into once discovered - a secret door swapping to a passable, transparent kind; a trap
- * staying passable but becoming *visibly* a trap.
- *
- * Discovery itself is a game's call, not this class's: a search action rolling against a
- * distance, a trap firing the moment a creature steps onto it, a wand of revealing. This
- * only does the bookkeeping once that decision has been made.
- *
- * @example
- * ```ts
- * import { Secrets, Level, WALL, FLOOR } from '@datamoc/mw_games/roguelike';
- *
- * const level = new Level(20, 20, [WALL, FLOOR], 1);
- * const secrets = new Secrets(level);
- *
- * secrets.conceal(5, 5, 0, 1); // disguised as WALL (0), reveals as FLOOR (1) once found
- * console.log(secrets.isSecret(5, 5)); // true - the cell reads as solid rock until found
- *
- * secrets.discover(5, 5); // a search action succeeded
- * ```
- */
-export declare class Secrets {
-    private level;
-    private revealedKind;
-    private discovered;
-    constructor(level: Level);
-    /** hides a cell as `disguise`, remembering that it becomes `revealed` once discovered */
-    conceal(x: number, y: number, disguise: number, revealed: number): void;
-    /** a cell with a secret, still hidden - what a search action should be rolling against */
-    isSecret(x: number, y: number): boolean;
-    isDiscovered(x: number, y: number): boolean;
-    /**
-     * Swaps a concealed cell to its revealed kind.
-     *
-     * @returns whether there was anything to discover - false for a cell with no secret, or
-     * one already found, so a caller can tell a real discovery from a wasted search
-     */
-    discover(x: number, y: number): boolean;
-    toJSON(): {
-        revealed: [number, number][];
-        discovered: number[];
-    };
-    /** rebuilds secrets from save data onto a (separately restored) level */
-    static fromJSON(level: Level, data: {
-        revealed: [number, number][];
-        discovered: number[];
-    }): Secrets;
-}
-//# sourceMappingURL=Secrets.d.ts.map

package/dist/roguelike/Secrets.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Secrets.d.ts","sourceRoot":"","sources":["../../src/roguelike/Secrets.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAExC;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,qBAAa,OAAO;IACnB,OAAO,CAAC,KAAK,CAAQ;IACrB,OAAO,CAAC,YAAY,CAA6B;IACjD,OAAO,CAAC,UAAU,CAAqB;IAEvC,YAAY,KAAK,EAAE,KAAK,EAEvB;IAED,yFAAyF;IACzF,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI,CAKtE;IAED,0FAA0F;IAC1F,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAGtC;IAED,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAE1C;IAED;;;;;OAKG;IACH,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAOtC;IAED,MAAM,IAAI;QAAE,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;QAAC,UAAU,EAAE,MAAM,EAAE,CAAA;KAAE,CAE/D;IAED,yEAAyE;IACzE,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE;QAAE,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;QAAC,UAAU,EAAE,MAAM,EAAE,CAAA;KAAE,GAAG,OAAO,CAKnG;CACD"}

package/dist/roguelike/Secrets.js

@@ -1,77 +0,0 @@
-/**
- * A cell that renders and blocks like its surroundings until revealed.
- *
- * The concealment itself is just terrain: `conceal` writes the disguise kind straight into
- * the `Level`, so a secret door already passes every `passable`/`transparent` check as
- * whatever it is disguised as - a wall that cannot be walked through or seen past, a floor
- * that can. Nothing in `FieldOfView` or `Pathfinder` needs to know secrets exist. What this
- * class remembers is the other half: which cells have a secret at all, and what they turn
- * into once discovered - a secret door swapping to a passable, transparent kind; a trap
- * staying passable but becoming *visibly* a trap.
- *
- * Discovery itself is a game's call, not this class's: a search action rolling against a
- * distance, a trap firing the moment a creature steps onto it, a wand of revealing. This
- * only does the bookkeeping once that decision has been made.
- *
- * @example
- * ```ts
- * import { Secrets, Level, WALL, FLOOR } from '@datamoc/mw_games/roguelike';
- *
- * const level = new Level(20, 20, [WALL, FLOOR], 1);
- * const secrets = new Secrets(level);
- *
- * secrets.conceal(5, 5, 0, 1); // disguised as WALL (0), reveals as FLOOR (1) once found
- * console.log(secrets.isSecret(5, 5)); // true - the cell reads as solid rock until found
- *
- * secrets.discover(5, 5); // a search action succeeded
- * ```
- */
-export class Secrets {
-    constructor(level) {
-        this.revealedKind = new Map();
-        this.discovered = new Set();
-        this.level = level;
-    }
-    /** hides a cell as `disguise`, remembering that it becomes `revealed` once discovered */
-    conceal(x, y, disguise, revealed) {
-        const cell = this.level.index(x, y);
-        this.revealedKind.set(cell, revealed);
-        this.discovered.delete(cell);
-        this.level.set(x, y, disguise);
-    }
-    /** a cell with a secret, still hidden - what a search action should be rolling against */
-    isSecret(x, y) {
-        const cell = this.level.index(x, y);
-        return this.revealedKind.has(cell) && !this.discovered.has(cell);
-    }
-    isDiscovered(x, y) {
-        return this.discovered.has(this.level.index(x, y));
-    }
-    /**
-     * Swaps a concealed cell to its revealed kind.
-     *
-     * @returns whether there was anything to discover - false for a cell with no secret, or
-     * one already found, so a caller can tell a real discovery from a wasted search
-     */
-    discover(x, y) {
-        if (!this.isSecret(x, y))
-            return false;
-        const cell = this.level.index(x, y);
-        this.discovered.add(cell);
-        this.level.set(x, y, this.revealedKind.get(cell));
-        return true;
-    }
-    toJSON() {
-        return { revealed: [...this.revealedKind], discovered: [...this.discovered] };
-    }
-    /** rebuilds secrets from save data onto a (separately restored) level */
-    static fromJSON(level, data) {
-        const secrets = new Secrets(level);
-        for (const [cell, revealed] of data.revealed)
-            secrets.revealedKind.set(cell, revealed);
-        for (const cell of data.discovered)
-            secrets.discovered.add(cell);
-        return secrets;
-    }
-}
-//# sourceMappingURL=Secrets.js.map

package/dist/roguelike/Secrets.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Secrets.js","sourceRoot":"","sources":["../../src/roguelike/Secrets.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,MAAM,OAAO,OAAO;IAKnB,YAAY,KAAY;QAHhB,iBAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,eAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QAGtC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACpB,CAAC;IAED,yFAAyF;IACzF,OAAO,CAAC,CAAS,EAAE,CAAS,EAAE,QAAgB,EAAE,QAAgB;QAC/D,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QACtC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;IAChC,CAAC;IAED,0FAA0F;IAC1F,QAAQ,CAAC,CAAS,EAAE,CAAS;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAClE,CAAC;IAED,YAAY,CAAC,CAAS,EAAE,CAAS;QAChC,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACpD,CAAC;IAED;;;;;OAKG;IACH,QAAQ,CAAC,CAAS,EAAE,CAAS;QAC5B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QAEvC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC;IACb,CAAC;IAED,MAAM;QACL,OAAO,EAAE,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,EAAE,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;IAC/E,CAAC;IAED,yEAAyE;IACzE,MAAM,CAAC,QAAQ,CAAC,KAAY,EAAE,IAA4D;QACzF,MAAM,OAAO,GAAG,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QACvF,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU;YAAE,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjE,OAAO,OAAO,CAAC;IAChB,CAAC;CACD"}

package/dist/roguelike/Stealth.d.ts

@@ -1,47 +0,0 @@
-import type { Step } from './Pathfinder.ts';
-/**
- * A unit that stays undetected in clear sight, independent of terrain, until an enemy comes
- * within a fixed radius - the primitive under every "hidden unless someone's right next to
- * you" mechanic. `FieldOfView` is the other half of visibility (can an observer's line of
- * sight even reach this cell); this is a separate, distance-only check layered on top of it,
- * not a change to how `FieldOfView` itself works.
- */
-export interface StealthOptions {
-    /** an observer this close or closer reveals the unit, in `chebyshevDistance` steps */
-    radius: number;
-}
-/**
- * Tracks one hidden unit's detection state. Detection is one-way and sticky: once found, a
- * unit stays found until something explicitly re-hides it (`reset`), the same way a real
- * ambush does not un-happen because the enemy that spotted you wandered off again.
- *
- * @example
- * ```ts
- * import { Stealth } from '@datamoc/mw_games/roguelike';
- *
- * const assassin = new Stealth({ radius: 2 });
- * const guards = [{ x: 10, y: 10 }, { x: 5, y: 5 }];
- *
- * if (assassin.checkDetection({ x: 4, y: 5 }, guards)) {
- *   console.log('spotted! that guard spends its move noticing');
- * }
- * console.log(assassin.isDetected);
- * ```
- */
-export declare class Stealth {
-    private detected;
-    private radius;
-    constructor(options: StealthOptions);
-    get isDetected(): boolean;
-    /**
-     * Checks `observers` against `hidden`'s position, and returns `true` only on the call
-     * that first brings one within range - the discoverer's move should be spent on that
-     * call, and that call alone, never on every later check while the unit stays in range.
-     * Already-detected units always return `false` here; read `isDetected` for their
-     * ongoing state instead.
-     */
-    checkDetection(hidden: Step, observers: readonly Step[]): boolean;
-    /** hides the unit again - a smoke bomb, breaking line of sight for long enough, a new floor */
-    reset(): void;
-}
-//# sourceMappingURL=Stealth.d.ts.map

package/dist/roguelike/Stealth.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Stealth.d.ts","sourceRoot":"","sources":["../../src/roguelike/Stealth.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAC;AAE5C;;;;;;GAMG;AACH,MAAM,WAAW,cAAc;IAC9B,sFAAsF;IACtF,MAAM,EAAE,MAAM,CAAC;CACf;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,qBAAa,OAAO;IACnB,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,MAAM,CAAS;IAEvB,YAAY,OAAO,EAAE,cAAc,EAElC;IAED,IAAI,UAAU,IAAI,OAAO,CAExB;IAED;;;;;;OAMG;IACH,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,IAAI,EAAE,GAAG,OAAO,CAKhE;IAED,+FAA+F;IAC/F,KAAK,IAAI,IAAI,CAEZ;CACD"}

package/dist/roguelike/Stealth.js

@@ -1,48 +0,0 @@
-import { chebyshevDistance } from './Targeting.js';
-/**
- * Tracks one hidden unit's detection state. Detection is one-way and sticky: once found, a
- * unit stays found until something explicitly re-hides it (`reset`), the same way a real
- * ambush does not un-happen because the enemy that spotted you wandered off again.
- *
- * @example
- * ```ts
- * import { Stealth } from '@datamoc/mw_games/roguelike';
- *
- * const assassin = new Stealth({ radius: 2 });
- * const guards = [{ x: 10, y: 10 }, { x: 5, y: 5 }];
- *
- * if (assassin.checkDetection({ x: 4, y: 5 }, guards)) {
- *   console.log('spotted! that guard spends its move noticing');
- * }
- * console.log(assassin.isDetected);
- * ```
- */
-export class Stealth {
-    constructor(options) {
-        this.detected = false;
-        this.radius = options.radius;
-    }
-    get isDetected() {
-        return this.detected;
-    }
-    /**
-     * Checks `observers` against `hidden`'s position, and returns `true` only on the call
-     * that first brings one within range - the discoverer's move should be spent on that
-     * call, and that call alone, never on every later check while the unit stays in range.
-     * Already-detected units always return `false` here; read `isDetected` for their
-     * ongoing state instead.
-     */
-    checkDetection(hidden, observers) {
-        if (this.detected)
-            return false;
-        const found = observers.some((observer) => chebyshevDistance(hidden, observer) <= this.radius);
-        if (found)
-            this.detected = true;
-        return found;
-    }
-    /** hides the unit again - a smoke bomb, breaking line of sight for long enough, a new floor */
-    reset() {
-        this.detected = false;
-    }
-}
-//# sourceMappingURL=Stealth.js.map

package/dist/roguelike/Stealth.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Stealth.js","sourceRoot":"","sources":["../../src/roguelike/Stealth.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAenD;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,OAAO,OAAO;IAInB,YAAY,OAAuB;QAH3B,aAAQ,GAAG,KAAK,CAAC;QAIxB,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAC9B,CAAC;IAED,IAAI,UAAU;QACb,OAAO,IAAI,CAAC,QAAQ,CAAC;IACtB,CAAC;IAED;;;;;;OAMG;IACH,cAAc,CAAC,MAAY,EAAE,SAA0B;QACtD,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO,KAAK,CAAC;QAChC,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,iBAAiB,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/F,IAAI,KAAK;YAAE,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QAChC,OAAO,KAAK,CAAC;IACd,CAAC;IAED,+FAA+F;IAC/F,KAAK;QACJ,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;IACvB,CAAC;CACD"}