@datamoc/mw_games 0.43.0 → 0.45.0

package/dist/core/Random.js

@@ -1,408 +0,0 @@
-/**
- * Deterministic random numbers.
- *
- * A roguelike lives or dies on this: the same seed has to produce the same dungeon, on
- * any machine, in any browser, forever. `Math.random()` cannot do that: it is not
- * seedable and its algorithm is not specified.
- *
- * The generator is xoshiro128**, by David Blackman and Sebastiano Vigna, released into the
- * public domain. It is fast, passes the standard statistical test suites, and its state is
- * four 32-bit words, which JavaScript can hold exactly.
- *
- * Generators are kept on a stack. Level generation pushes a seeded one so a floor is
- * reproducible, then pops it, so unrelated rolls elsewhere do not consume from that
- * stream and shift the results.
- *
- * @example
- * ```ts
- * import { Random } from '@datamoc/mw_games/core';
- *
- * // a floor generated from a seed always comes out the same
- * Random.push(12345);
- * const roll = Random.int(1, 20);
- * const critical = Random.chance(0.05);
- * Random.pop();
- * ```
- */
-/**
- * The seeded generator class `Random`'s free functions wrap directly, for a game that wants
- * its own independent stream rather than sharing the ambient one.
- *
- * @example
- * ```ts
- * import { Generator } from '@datamoc/mw_games/core';
- *
- * const rng = new Generator(42); // same seed, same sequence, every time
- * const roll = rng.int(20);
- * const saved = rng.getState(); // resumable, for a save file
- * ```
- */
-export class Generator {
-    constructor(seed) {
-        this.s0 = 0;
-        this.s1 = 0;
-        this.s2 = 0;
-        this.s3 = 0;
-        //an unseeded generator still has to be deterministic once created, so a random seed
-        //is drawn once and kept, rather than the state being seeded from entropy directly
-        this.seed = seed === undefined ? (Math.random() * 0x100000000) >>> 0 : seed >>> 0;
-        //Keep the generator self-contained so worker rollouts use this same class.
-        let a = this.seed;
-        const next = () => {
-            a = (a + 0x9e3779b9) >>> 0;
-            let t = a;
-            t = Math.imul(t ^ (t >>> 16), 0x21f0aaad);
-            t = Math.imul(t ^ (t >>> 15), 0x735a2d97);
-            return (t ^ (t >>> 15)) >>> 0;
-        };
-        this.s0 = next();
-        this.s1 = next();
-        this.s2 = next();
-        this.s3 = next();
-        //an all-zero state is a fixed point of the generator; splitmix never produces one,
-        //but a future change to the seeding must not either
-        if ((this.s0 | this.s1 | this.s2 | this.s3) === 0)
-            this.s0 = 1;
-    }
-    /** the raw generator: a uniformly distributed unsigned 32-bit integer */
-    nextUint32() {
-        const result = (Math.imul(this.rotl(Math.imul(this.s1, 5), 7), 9) >>> 0) >>> 0;
-        const t = (this.s1 << 9) >>> 0;
-        this.s2 ^= this.s0;
-        this.s3 ^= this.s1;
-        this.s1 ^= this.s2;
-        this.s0 ^= this.s3;
-        this.s2 ^= t;
-        this.s3 = this.rotl(this.s3, 11);
-        return result;
-    }
-    /** a float in [0, 1), with 32 bits of resolution */
-    float() {
-        return this.nextUint32() / 0x100000000;
-    }
-    /**
-     * An integer in [0, bound), without modulo bias.
-     *
-     * The naive `nextUint32() % bound` favours the low values whenever bound does not
-     * divide 2^32; this rejects the unfair tail of the range instead.
-     */
-    int(bound) {
-        if (bound <= 0)
-            return 0;
-        const limit = 0x100000000 - (0x100000000 % bound);
-        let value = this.nextUint32();
-        while (value >= limit) {
-            value = this.nextUint32();
-        }
-        return value % bound;
-    }
-    /** captures the generator state, so a save file can resume the same stream */
-    getState() {
-        return [this.s0, this.s1, this.s2, this.s3];
-    }
-    setState(state) {
-        [this.s0, this.s1, this.s2, this.s3] = state;
-    }
-    rotl(x, k) {
-        return ((x << k) | (x >>> (32 - k))) >>> 0;
-    }
-}
-const stack = [new Generator()];
-const current = () => stack[stack.length - 1];
-/**
- * The generator the free functions (`int`, `float`, `chance`, ...) draw from.
- *
- * This is the handle a `SimulationRuntime` needs to share the ambient stream:
- * pass the returned object as the runtime's `random` and both sides draw from
- * (and snapshot) one sequence, so a journal replay reproduces scene draws.
- *
- * @example
- * ```ts
- * import { Random } from '@datamoc/mw_games/core';
- *
- * Random.push(12345);
- * const shared = Random.active();
- * const roll = shared.int(20);
- * Random.pop();
- * ```
- */
-export function active() {
-    return current();
-}
-/** starts a reproducible stream; pair every call with `pop()` */
-export function push(seed) {
-    const generator = new Generator(seed);
-    stack.push(generator);
-    return generator;
-}
-export function pop() {
-    if (stack.length === 1) {
-        throw new Error('the base random generator cannot be popped');
-    }
-    stack.pop();
-}
-/** runs `body` with a seeded generator, popping it even if `body` throws */
-export function withSeed(seed, body) {
-    push(seed);
-    try {
-        return body();
-    }
-    finally {
-        pop();
-    }
-}
-export function reset() {
-    stack.length = 0;
-    stack.push(new Generator());
-}
-/** a float in [0, 1), or [0, max), or [min, max) */
-export function float(min, max, source) {
-    const draw = source ?? current();
-    if (min === undefined)
-        return draw.float();
-    if (max === undefined)
-        return draw.float() * min;
-    return min + draw.float() * (max - min);
-}
-/** an integer in [0, max), or [min, max) */
-export function int(min, max, source) {
-    const draw = source ?? current();
-    if (max === undefined)
-        return draw.int(min);
-    return min + draw.int(max - min);
-}
-/** an integer in [min, max], both ends included (the usual shape for dice) */
-export function range(min, max, source) {
-    return min + (source ?? current()).int(max - min + 1);
-}
-/**
- * A triangular distribution over [min, max], peaking in the middle.
- *
- * Useful wherever a uniform roll feels wrong: damage, room sizes, item quality.
- */
-export function normalRange(min, max, source) {
-    const draw = source ?? current();
-    return min + Math.floor(((draw.float() + draw.float()) * (max - min + 1)) / 2);
-}
-export function chance(probability, source) {
-    return (source ?? current()).float() < probability;
-}
-/**
- * Every "pick one" function here reports "there was nothing to pick" as `null`, never as
- * `-1` or `undefined`.
- *
- * `weighted` used to return `-1` and the two functions built on it returned `undefined`,
- * which meant one call chain carried three different spellings of the same outcome and two
- * separate hand-written translations between them. One sentinel, checked one way.
- */
-/** a random element, or `null` for an empty list; draws from `source` when given */
-export function element(items, source) {
-    return items.length > 0 ? items[(source ?? current()).int(items.length)] : null;
-}
-/** an index into `weights` drawn in proportion to its weight, or `null` if nothing has any; draws from `source` when given */
-export function weighted(weights, source) {
-    let total = 0;
-    for (const w of weights)
-        total += w;
-    if (total <= 0)
-        return null;
-    let value = (source ?? current()).float() * total;
-    for (let i = 0; i < weights.length; i++) {
-        value -= weights[i];
-        if (value < 0)
-            return i;
-    }
-    return weights.length - 1;
-}
-/** a key from `weights`, drawn in proportion to the value it maps to, or `null` if none has any; draws from `source` when given */
-export function weightedKey(weights, source) {
-    const keys = [...weights.keys()];
-    const index = weighted(keys.map((k) => weights.get(k) ?? 0), source);
-    return index === null ? null : keys[index];
-}
-/** Fisher-Yates, in place; draws from `source` when given */
-export function shuffle(items, source) {
-    for (let i = items.length - 1; i > 0; i--) {
-        const j = (source ?? current()).int(i + 1);
-        [items[i], items[j]] = [items[j], items[i]];
-    }
-    return items;
-}
-const MT_N = 624;
-const MT_M = 397;
-const MT_MATRIX_A = 0x9908b0df;
-const MT_UPPER_MASK = 0x80000000;
-const MT_LOWER_MASK = 0x7fffffff;
-/**
- * MT19937, the Mersenne Twister the reference strategy game's `mt_rng` wraps, with the same
- * `seed`/`discard` bookkeeping its save files use. The engine itself is exactly specified
- * (the paper's constants and the 32-bit seeding routine), so `nextUint32` matches that
- * engine bit for bit on any machine; a port that consumes the raw stream, or a replay of raw
- * draws, lines up.
- *
- * What is *not* portable is C++'s `std::uniform_int_distribution`, which the reference then
- * runs the engine through: the C++ standard leaves that mapping implementation-defined, so
- * two standard libraries do not agree on it. `int` here is the same unbiased rejection
- * `Generator` uses, which makes a replay deterministic within this framework rather than
- * bit-identical to any one C++ standard library.
- *
- * @example
- * ```ts
- * import { MersenneTwister } from '@datamoc/mw_games/core';
- *
- * const rng = new MersenneTwister(5489);
- * const first = rng.nextUint32(); // 3499211612, the engine's own first value for this seed
- * rng.discard(10); // skip ahead without consuming the values
- * const saved = rng.getState(); // { seed, state, index, discard } - restorable
- * ```
- */
-export class MersenneTwister {
-    constructor(seed = 5489) {
-        this.state = new Uint32Array(MT_N);
-        this.index = MT_N;
-        this.seedValue = 5489;
-        this.produced = 0;
-        this.seed(seed);
-    }
-    /** re-seeds the engine and resets the discard count, as `mt_rng::seed` does */
-    seed(seed) {
-        this.seedValue = seed >>> 0;
-        this.state[0] = this.seedValue;
-        for (let i = 1; i < MT_N; i++) {
-            const previous = this.state[i - 1] ^ (this.state[i - 1] >>> 30);
-            this.state[i] = (Math.imul(1812433253, previous) + i) >>> 0;
-        }
-        this.index = MT_N;
-        this.produced = 0;
-    }
-    generate() {
-        for (let i = 0; i < MT_N; i++) {
-            const y = (this.state[i] & MT_UPPER_MASK) | (this.state[(i + 1) % MT_N] & MT_LOWER_MASK);
-            let value = this.state[(i + MT_M) % MT_N] ^ (y >>> 1);
-            if (y & 1)
-                value ^= MT_MATRIX_A;
-            this.state[i] = value >>> 0;
-        }
-        this.index = 0;
-    }
-    /** the raw generator, tempered as MT19937 specifies */
-    nextUint32() {
-        if (this.index >= MT_N)
-            this.generate();
-        let y = this.state[this.index++];
-        y ^= y >>> 11;
-        y ^= (y << 7) & 0x9d2c5680;
-        y ^= (y << 15) & 0xefc60000;
-        y ^= y >>> 18;
-        this.produced++;
-        return y >>> 0;
-    }
-    /** a float in [0, 1), with 32 bits of resolution */
-    float() {
-        return this.nextUint32() / 0x100000000;
-    }
-    /** an integer in [0, bound), without modulo bias (the same rule `Generator.int` uses) */
-    int(bound) {
-        if (bound <= 0)
-            return 0;
-        const limit = 0x100000000 - (0x100000000 % bound);
-        let value = this.nextUint32();
-        while (value >= limit) {
-            value = this.nextUint32();
-        }
-        return value % bound;
-    }
-    /** advances the engine without using the values, as `mt_rng::discard` does */
-    discard(count) {
-        for (let i = 0; i < count; i++)
-            this.nextUint32();
-    }
-    /** how many values have been produced since the last seed - `get_discard()`'s number */
-    get discardCount() {
-        return this.produced;
-    }
-    getState() {
-        return { seed: this.seedValue, state: [...this.state], index: this.index, discard: this.produced };
-    }
-    setState(state) {
-        this.seedValue = state.seed >>> 0;
-        for (let i = 0; i < MT_N; i++)
-            this.state[i] = (state.state[i] ?? 0) >>> 0;
-        this.index = state.index;
-        this.produced = state.discard;
-    }
-}
-/** FNV-1a over a stream name, so a name deterministically derives its own seed */
-function fnv1a(text) {
-    let hash = 0x811c9dc5;
-    for (let i = 0; i < text.length; i++) {
-        hash ^= text.charCodeAt(i);
-        hash = Math.imul(hash, 0x01000193) >>> 0;
-    }
-    return hash >>> 0;
-}
-/**
- * Named, independent random streams over one base seed: `streams.stream('loot')` and
- * `streams.stream('ai:goblin-3')` each get their own MT19937 position, so one consumer
- * drawing more numbers never shifts another's results - the property a replay and a
- * per-entity stream both need, and one a single shared generator cannot give.
- *
- * A stream is created on first use, from `baseSeed ^ FNV-1a(name)`, and then kept. Creating
- * a stream later therefore does not disturb an existing one, which is what makes adding a
- * new consumer reproducible rather than a change to every draw after it.
- *
- * @example
- * ```ts
- * import { RandomStreams } from '@datamoc/mw_games/core';
- *
- * const streams = new RandomStreams(12345);
- * streams.stream('loot').int(100); // one stream
- * streams.stream('ai:goblin-3').int(6); // an unrelated one, unaffected by the loot draw
- *
- * const saved = streams.getState(); // every stream's engine state, for a save file
- * ```
- */
-export class RandomStreams {
-    constructor(seed = 0) {
-        this.streams = new Map();
-        this.baseSeed = seed >>> 0;
-    }
-    /** the stream named `name`, created from the base seed on first use and kept after that */
-    stream(name) {
-        let entry = this.streams.get(name);
-        if (!entry) {
-            const seed = (this.baseSeed ^ fnv1a(name)) >>> 0;
-            entry = { seed, engine: new MersenneTwister(seed) };
-            this.streams.set(name, entry);
-        }
-        return entry.engine;
-    }
-    /** the seed a stream was created from; undefined for one that has never been asked for */
-    seedOf(name) {
-        return this.streams.get(name)?.seed;
-    }
-    /** drops every stream and re-bases future ones; existing streams are gone, not reset */
-    reseed(seed) {
-        this.baseSeed = seed >>> 0;
-        this.streams.clear();
-    }
-    /** the names that have been asked for, in creation order */
-    names() {
-        return [...this.streams.keys()];
-    }
-    getState() {
-        const out = {};
-        for (const [name, entry] of this.streams)
-            out[name] = entry.engine.getState();
-        return out;
-    }
-    /** restores what `getState` wrote; a stream missing from `state` stays as it was */
-    setState(state) {
-        for (const [name, saved] of Object.entries(state)) {
-            const engine = new MersenneTwister(saved.seed);
-            engine.setState(saved);
-            this.streams.set(name, { seed: saved.seed, engine });
-        }
-    }
-}
-//# sourceMappingURL=Random.js.map

package/dist/core/Random.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Random.js","sourceRoot":"","sources":["../../src/core/Random.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH;;;;;;;;;;;;GAYG;AACH,MAAM,OAAO,SAAS;IAQrB,YAAY,IAAa;QAPjB,OAAE,GAAG,CAAC,CAAC;QACP,OAAE,GAAG,CAAC,CAAC;QACP,OAAE,GAAG,CAAC,CAAC;QACP,OAAE,GAAG,CAAC,CAAC;QAKd,oFAAoF;QACpF,kFAAkF;QAClF,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC;QAElF,2EAA2E;QAC3E,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;QAClB,MAAM,IAAI,GAAG,GAAW,EAAE;YACzB,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;YAC3B,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;YAC1C,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;YAC1C,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QAC/B,CAAC,CAAC;QACF,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC;QACjB,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC;QACjB,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC;QACjB,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC;QAEjB,mFAAmF;QACnF,oDAAoD;QACpD,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC;YAAE,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;IAChE,CAAC;IAED,yEAAyE;IACzE,UAAU;QACT,MAAM,MAAM,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;QAE/E,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;QAE/B,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;QACb,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAEjC,OAAO,MAAM,CAAC;IACf,CAAC;IAED,oDAAoD;IACpD,KAAK;QACJ,OAAO,IAAI,CAAC,UAAU,EAAE,GAAG,WAAW,CAAC;IACxC,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,KAAa;QAChB,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QAEzB,MAAM,KAAK,GAAG,WAAW,GAAG,CAAC,WAAW,GAAG,KAAK,CAAC,CAAC;QAClD,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAC9B,OAAO,KAAK,IAAI,KAAK,EAAE,CAAC;YACvB,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAC3B,CAAC;QACD,OAAO,KAAK,GAAG,KAAK,CAAC;IACtB,CAAC;IAED,8EAA8E;IAC9E,QAAQ;QACP,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;IAC7C,CAAC;IAED,QAAQ,CAAC,KAAgD;QACxD,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;IAC9C,CAAC;IAEO,IAAI,CAAC,CAAS,EAAE,CAAS;QAChC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAC5C,CAAC;CACD;AAED,MAAM,KAAK,GAAgB,CAAC,IAAI,SAAS,EAAE,CAAC,CAAC;AAE7C,MAAM,OAAO,GAAG,GAAc,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAsDzD;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,MAAM;IACrB,OAAO,OAAO,EAAE,CAAC;AAClB,CAAC;AAED,iEAAiE;AACjE,MAAM,UAAU,IAAI,CAAC,IAAa;IACjC,MAAM,SAAS,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC;IACtC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACtB,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,GAAG;IAClB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;IAC/D,CAAC;IACD,KAAK,CAAC,GAAG,EAAE,CAAC;AACb,CAAC;AAED,4EAA4E;AAC5E,MAAM,UAAU,QAAQ,CAAI,IAAY,EAAE,IAAa;IACtD,IAAI,CAAC,IAAI,CAAC,CAAC;IACX,IAAI,CAAC;QACJ,OAAO,IAAI,EAAE,CAAC;IACf,CAAC;YAAS,CAAC;QACV,GAAG,EAAE,CAAC;IACP,CAAC;AACF,CAAC;AAED,MAAM,UAAU,KAAK;IACpB,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACjB,KAAK,CAAC,IAAI,CAAC,IAAI,SAAS,EAAE,CAAC,CAAC;AAC7B,CAAC;AAED,oDAAoD;AACpD,MAAM,UAAU,KAAK,CAAC,GAAY,EAAE,GAAY,EAAE,MAAoB;IACrE,MAAM,IAAI,GAAG,MAAM,IAAI,OAAO,EAAE,CAAC;IACjC,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;IAC3C,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC;IACjD,OAAO,GAAG,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;AACzC,CAAC;AAED,4CAA4C;AAC5C,MAAM,UAAU,GAAG,CAAC,GAAW,EAAE,GAAY,EAAE,MAAqB;IACnE,MAAM,IAAI,GAAG,MAAM,IAAI,OAAO,EAAE,CAAC;IACjC,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5C,OAAO,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;AAClC,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,KAAK,CAAC,GAAW,EAAE,GAAW,EAAE,MAAqB;IACpE,OAAO,GAAG,GAAG,CAAC,MAAM,IAAI,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;AACvD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,GAAW,EAAE,GAAW,EAAE,MAAqB;IAC1E,MAAM,IAAI,GAAG,MAAM,IAAI,OAAO,EAAE,CAAC;IACjC,OAAO,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAChF,CAAC;AAED,MAAM,UAAU,MAAM,CAAC,WAAmB,EAAE,MAAoB;IAC/D,OAAO,CAAC,MAAM,IAAI,OAAO,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,WAAW,CAAC;AACpD,CAAC;AAED;;;;;;;GAOG;AAEH,oFAAoF;AACpF,MAAM,UAAU,OAAO,CAAI,KAAmB,EAAE,MAAqB;IACpE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,IAAI,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACjF,CAAC;AAED,8HAA8H;AAC9H,MAAM,UAAU,QAAQ,CAAC,OAA0B,EAAE,MAAoB;IACxE,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,KAAK,IAAI,CAAC,CAAC;IACpC,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAE5B,IAAI,KAAK,GAAG,CAAC,MAAM,IAAI,OAAO,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,KAAK,CAAC;IAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,KAAK,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,KAAK,GAAG,CAAC;YAAE,OAAO,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;AAC3B,CAAC;AAED,mIAAmI;AACnI,MAAM,UAAU,WAAW,CAAI,OAA+B,EAAE,MAAoB;IACnF,MAAM,IAAI,GAAG,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;IACjC,MAAM,KAAK,GAAG,QAAQ,CACrB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EACpC,MAAM,CACN,CAAC;IACF,OAAO,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC5C,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,OAAO,CAAI,KAAU,EAAE,MAAqB;IAC3D,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,CAAC,GAAG,CAAC,MAAM,IAAI,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3C,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,MAAM,IAAI,GAAG,GAAG,CAAC;AACjB,MAAM,IAAI,GAAG,GAAG,CAAC;AACjB,MAAM,WAAW,GAAG,UAAU,CAAC;AAC/B,MAAM,aAAa,GAAG,UAAU,CAAC;AACjC,MAAM,aAAa,GAAG,UAAU,CAAC;AAiBjC;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,OAAO,eAAe;IAM3B,YAAY,IAAI,GAAG,IAAI;QALf,UAAK,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC;QAC9B,UAAK,GAAG,IAAI,CAAC;QACb,cAAS,GAAG,IAAI,CAAC;QACjB,aAAQ,GAAG,CAAC,CAAC;QAGpB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjB,CAAC;IAED,+EAA+E;IAC/E,IAAI,CAAC,IAAY;QAChB,IAAI,CAAC,SAAS,GAAG,IAAI,KAAK,CAAC,CAAC;QAC5B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YAChE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC7D,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;IACnB,CAAC;IAEO,QAAQ;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC;YACzF,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YACtD,IAAI,CAAC,GAAG,CAAC;gBAAE,KAAK,IAAI,WAAW,CAAC;YAChC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC;QAC7B,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IAChB,CAAC;IAED,uDAAuD;IACvD,UAAU;QACT,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI;YAAE,IAAI,CAAC,QAAQ,EAAE,CAAC;QAExC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QACjC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QACd,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC;QAC3B,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,UAAU,CAAC;QAC5B,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QACd,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,OAAO,CAAC,KAAK,CAAC,CAAC;IAChB,CAAC;IAED,oDAAoD;IACpD,KAAK;QACJ,OAAO,IAAI,CAAC,UAAU,EAAE,GAAG,WAAW,CAAC;IACxC,CAAC;IAED,yFAAyF;IACzF,GAAG,CAAC,KAAa;QAChB,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QAEzB,MAAM,KAAK,GAAG,WAAW,GAAG,CAAC,WAAW,GAAG,KAAK,CAAC,CAAC;QAClD,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAC9B,OAAO,KAAK,IAAI,KAAK,EAAE,CAAC;YACvB,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAC3B,CAAC;QACD,OAAO,KAAK,GAAG,KAAK,CAAC;IACtB,CAAC;IAED,8EAA8E;IAC9E,OAAO,CAAC,KAAa;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,UAAU,EAAE,CAAC;IACnD,CAAC;IAED,wFAAwF;IACxF,IAAI,YAAY;QACf,OAAO,IAAI,CAAC,QAAQ,CAAC;IACtB,CAAC;IAED,QAAQ;QACP,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC;IACpG,CAAC;IAED,QAAQ,CAAC,KAA2B;QACnC,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;QAC3E,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC;IAC/B,CAAC;CACD;AAED,kFAAkF;AAClF,SAAS,KAAK,CAAC,IAAY;IAC1B,IAAI,IAAI,GAAG,UAAU,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,IAAI,KAAK,CAAC,CAAC;AACnB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,OAAO,aAAa;IAIzB,YAAY,IAAI,GAAG,CAAC;QAFZ,YAAO,GAAG,IAAI,GAAG,EAAqD,CAAC;QAG9E,IAAI,CAAC,QAAQ,GAAG,IAAI,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,2FAA2F;IAC3F,MAAM,CAAC,IAAY;QAClB,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,KAAK,EAAE,CAAC;YACZ,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;YACjD,KAAK,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;YACpD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,KAAK,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,0FAA0F;IAC1F,MAAM,CAAC,IAAY;QAClB,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC;IACrC,CAAC;IAED,wFAAwF;IACxF,MAAM,CAAC,IAAY;QAClB,IAAI,CAAC,QAAQ,GAAG,IAAI,KAAK,CAAC,CAAC;QAC3B,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED,4DAA4D;IAC5D,KAAK;QACJ,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;IACjC,CAAC;IAED,QAAQ;QACP,MAAM,GAAG,GAAyC,EAAE,CAAC;QACrD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC9E,OAAO,GAAG,CAAC;IACZ,CAAC;IAED,oFAAoF;IACpF,QAAQ,CAAC,KAAqD;QAC7D,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACnD,MAAM,MAAM,GAAG,IAAI,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC/C,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YACvB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QACtD,CAAC;IACF,CAAC;CACD"}

package/dist/core/Reactions.d.ts

@@ -1,67 +0,0 @@
-/**
- * Custom actions/reactions to changes in any object's state - HP dropping past a
- * threshold, a durability hitting zero, a quest flag flipping true - watched declaratively
- * instead of as a branch cascade of `if` checks scattered through game code.
- *
- * A `ReactionRule` pairs a `when` predicate over some state with an `action` the framework
- * calls the moment that predicate turns true; `check()` runs every rule against a fresh
- * reading, edge-triggered so a condition that stays true never re-fires on every call.
- * Rules make no assumption about what shape they watch - an actor's `StatBlock` values, a
- * plain object's own fields (an item's durability, a door's open flag), whatever the game
- * passes to `check`, so the same table works for a character or an inanimate object alike.
- * A `once: true` rule (a bond breaking, a boss entering phase two) fires a single time ever
- * and then retires; the default is edge-triggered, firing again each time the condition
- * leaves and returns, the shape a recurring low-health warning needs.
- *
- * @example
- * ```ts
- * import { ReactionTable } from '@datamoc/mw_games/core';
- *
- * const reactions = new ReactionTable<{ hp: number; maxHp: number }>([
- *   { id: 'critical', when: (s) => s.hp / s.maxHp <= 0.25, action: () => console.log('low hp!') },
- *   { id: 'shattered', when: (s) => s.hp <= 0, action: () => console.log('broke'), once: true },
- * ]);
- *
- * reactions.check({ hp: 40, maxHp: 100 }); // ['critical'] - fires once, not every call after
- * reactions.check({ hp: 38, maxHp: 100 }); // [] - still true, already fired
- * reactions.check({ hp: 90, maxHp: 100 }); // [] - condition left; 'critical' may fire again later
- * ```
- */
-export interface ReactionRule<TState> {
-    id: string;
-    when: (state: Readonly<TState>) => boolean;
-    action: (state: Readonly<TState>) => void;
-    /** fires once ever, then is never checked again - a boss entering phase two, a bond broken */
-    once?: boolean;
-}
-export declare class ReactionTable<TState> {
-    private rules;
-    private active;
-    private spent;
-    constructor(rules?: ReactionRule<TState>[]);
-    add(rule: ReactionRule<TState>): void;
-    /** drops a rule and forgets it was ever active, so a rule id can be reused later */
-    remove(id: string): void;
-    /**
-     * Evaluates every rule against `state`, firing whichever just turned true.
-     *
-     * @returns the ids that fired on exactly this call, in rule order - empty when nothing
-     * newly crossed, so a game can react ("play this sound", "show this toast") to each
-     * rule exactly once per crossing rather than re-deriving what changed itself
-     */
-    check(state: Readonly<TState>): string[];
-    /** whether a rule fired and has not since left its condition (an edge-triggered rule) */
-    isActive(id: string): boolean;
-    /** clears every active/spent rule, as if `check` had never been called */
-    reset(): void;
-    toJSON(): {
-        active: string[];
-        spent: string[];
-    };
-    /** rebuilds a table from save data - rules are supplied fresh, the same as `Achievements` */
-    static fromJSON<TState>(rules: ReactionRule<TState>[], data: {
-        active: string[];
-        spent: string[];
-    }): ReactionTable<TState>;
-}
-//# sourceMappingURL=Reactions.d.ts.map

package/dist/core/Reactions.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Reactions.d.ts","sourceRoot":"","sources":["../../src/core/Reactions.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AAEH,MAAM,WAAW,YAAY,CAAC,MAAM;IACnC,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,KAAK,OAAO,CAAC;IAC3C,MAAM,EAAE,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC;IAE1C,8FAA8F;IAC9F,IAAI,CAAC,EAAE,OAAO,CAAC;CACf;AAED,qBAAa,aAAa,CAAC,MAAM;IAChC,OAAO,CAAC,KAAK,CAAyB;IACtC,OAAO,CAAC,MAAM,CAAqB;IACnC,OAAO,CAAC,KAAK,CAAqB;IAElC,YAAY,KAAK,GAAE,YAAY,CAAC,MAAM,CAAC,EAAO,EAE7C;IAED,GAAG,CAAC,IAAI,EAAE,YAAY,CAAC,MAAM,CAAC,GAAG,IAAI,CAEpC;IAED,oFAAoF;IACpF,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,CAGvB;IAED;;;;;;OAMG;IACH,KAAK,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,MAAM,EAAE,CAgBvC;IAED,yFAAyF;IACzF,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAE5B;IAED,0EAA0E;IAC1E,KAAK,IAAI,IAAI,CAGZ;IAED,MAAM,IAAI;QAAE,MAAM,EAAE,MAAM,EAAE,CAAC;QAAC,KAAK,EAAE,MAAM,EAAE,CAAA;KAAE,CAE9C;IAED,6FAA6F;IAC7F,MAAM,CAAC,QAAQ,CAAC,MAAM,EACrB,KAAK,EAAE,YAAY,CAAC,MAAM,CAAC,EAAE,EAC7B,IAAI,EAAE;QAAE,MAAM,EAAE,MAAM,EAAE,CAAC;QAAC,KAAK,EAAE,MAAM,EAAE,CAAA;KAAE,GACzC,aAAa,CAAC,MAAM,CAAC,CAKvB;CACD"}

package/dist/core/Reactions.js

@@ -1,92 +0,0 @@
-/**
- * Custom actions/reactions to changes in any object's state - HP dropping past a
- * threshold, a durability hitting zero, a quest flag flipping true - watched declaratively
- * instead of as a branch cascade of `if` checks scattered through game code.
- *
- * A `ReactionRule` pairs a `when` predicate over some state with an `action` the framework
- * calls the moment that predicate turns true; `check()` runs every rule against a fresh
- * reading, edge-triggered so a condition that stays true never re-fires on every call.
- * Rules make no assumption about what shape they watch - an actor's `StatBlock` values, a
- * plain object's own fields (an item's durability, a door's open flag), whatever the game
- * passes to `check`, so the same table works for a character or an inanimate object alike.
- * A `once: true` rule (a bond breaking, a boss entering phase two) fires a single time ever
- * and then retires; the default is edge-triggered, firing again each time the condition
- * leaves and returns, the shape a recurring low-health warning needs.
- *
- * @example
- * ```ts
- * import { ReactionTable } from '@datamoc/mw_games/core';
- *
- * const reactions = new ReactionTable<{ hp: number; maxHp: number }>([
- *   { id: 'critical', when: (s) => s.hp / s.maxHp <= 0.25, action: () => console.log('low hp!') },
- *   { id: 'shattered', when: (s) => s.hp <= 0, action: () => console.log('broke'), once: true },
- * ]);
- *
- * reactions.check({ hp: 40, maxHp: 100 }); // ['critical'] - fires once, not every call after
- * reactions.check({ hp: 38, maxHp: 100 }); // [] - still true, already fired
- * reactions.check({ hp: 90, maxHp: 100 }); // [] - condition left; 'critical' may fire again later
- * ```
- */
-export class ReactionTable {
-    constructor(rules = []) {
-        this.active = new Set();
-        this.spent = new Set();
-        this.rules = [...rules];
-    }
-    add(rule) {
-        this.rules.push(rule);
-    }
-    /** drops a rule and forgets it was ever active, so a rule id can be reused later */
-    remove(id) {
-        this.rules = this.rules.filter((rule) => rule.id !== id);
-        this.active.delete(id);
-    }
-    /**
-     * Evaluates every rule against `state`, firing whichever just turned true.
-     *
-     * @returns the ids that fired on exactly this call, in rule order - empty when nothing
-     * newly crossed, so a game can react ("play this sound", "show this toast") to each
-     * rule exactly once per crossing rather than re-deriving what changed itself
-     */
-    check(state) {
-        const firedNow = [];
-        for (const rule of this.rules) {
-            if (rule.once && this.spent.has(rule.id))
-                continue;
-            const isTrue = rule.when(state);
-            if (isTrue && !this.active.has(rule.id)) {
-                rule.action(state);
-                firedNow.push(rule.id);
-                if (rule.once)
-                    this.spent.add(rule.id);
-            }
-            if (isTrue)
-                this.active.add(rule.id);
-            else
-                this.active.delete(rule.id);
-        }
-        return firedNow;
-    }
-    /** whether a rule fired and has not since left its condition (an edge-triggered rule) */
-    isActive(id) {
-        return this.active.has(id);
-    }
-    /** clears every active/spent rule, as if `check` had never been called */
-    reset() {
-        this.active.clear();
-        this.spent.clear();
-    }
-    toJSON() {
-        return { active: [...this.active], spent: [...this.spent] };
-    }
-    /** rebuilds a table from save data - rules are supplied fresh, the same as `Achievements` */
-    static fromJSON(rules, data) {
-        const table = new ReactionTable(rules);
-        for (const id of data.active)
-            table.active.add(id);
-        for (const id of data.spent)
-            table.spent.add(id);
-        return table;
-    }
-}
-//# sourceMappingURL=Reactions.js.map

package/dist/core/Reactions.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Reactions.js","sourceRoot":"","sources":["../../src/core/Reactions.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AAWH,MAAM,OAAO,aAAa;IAKzB,YAAY,KAAK,GAA2B,EAAE;QAHtC,WAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QAC3B,UAAK,GAAG,IAAI,GAAG,EAAU,CAAC;QAGjC,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,GAAG,CAAC,IAA0B;QAC7B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvB,CAAC;IAED,oFAAoF;IACpF,MAAM,CAAC,EAAU;QAChB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QACzD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACxB,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,KAAuB;QAC5B,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC/B,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YAEnD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACzC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBACnB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACvB,IAAI,IAAI,CAAC,IAAI;oBAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACxC,CAAC;YAED,IAAI,MAAM;gBAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;;gBAChC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED,yFAAyF;IACzF,QAAQ,CAAC,EAAU;QAClB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,0EAA0E;IAC1E,KAAK;QACJ,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC;IAED,MAAM;QACL,OAAO,EAAE,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;IAC7D,CAAC;IAED,6FAA6F;IAC7F,MAAM,CAAC,QAAQ,CACd,KAA6B,EAC7B,IAA2C;QAE3C,MAAM,KAAK,GAAG,IAAI,aAAa,CAAS,KAAK,CAAC,CAAC;QAC/C,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,MAAM;YAAE,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACnD,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,KAAK;YAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjD,OAAO,KAAK,CAAC;IACd,CAAC;CACD"}

package/dist/core/Registry.d.ts

@@ -1,31 +0,0 @@
-/**
- * A named lookup of values, registered once and read back by name - the shape underneath a
- * catalog of factories, handlers, or scene sections, so a game can grow that catalog by
- * registering another entry instead of adding another branch to a hand-written `if`/`switch`.
- *
- * Deliberately does not discover or import anything on its own: a game still writes the
- * import and the `register` call for each entry itself, the same explicit-import style
- * `core`/`two-d` already use throughout - this only replaces the dispatch step after that,
- * not the wiring step before it.
- *
- * @example
- * ```ts
- * import { Registry } from '@datamoc/mw_games/core';
- *
- * const commands = new Registry<(args: string[]) => void>();
- * commands.register('heal', (args) => console.log('healing', args[0]));
- *
- * commands.get('heal')(['fireling']); // "healing fireling"
- * commands.get('missing'); // throws: no registration named "missing"
- * ```
- */
-export declare class Registry<T> {
-    private items;
-    /** throws if `name` is already registered - a duplicate is always an authoring error */
-    register(name: string, value: T): void;
-    get(name: string): T;
-    has(name: string): boolean;
-    /** every registered name, in registration order */
-    list(): string[];
-}
-//# sourceMappingURL=Registry.d.ts.map

package/dist/core/Registry.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Registry.d.ts","sourceRoot":"","sources":["../../src/core/Registry.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,qBAAa,QAAQ,CAAC,CAAC;IACtB,OAAO,CAAC,KAAK,CAAwB;IAErC,wFAAwF;IACxF,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAGrC;IAED,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,CAAC,CAInB;IAED,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAEzB;IAED,mDAAmD;IACnD,IAAI,IAAI,MAAM,EAAE,CAEf;CACD"}