@datamoc/mw_games 0.44.2 → 0.46.0

package/dist/board/FogOfWar.js

@@ -1,150 +0,0 @@
-import { cellIndex, cellInside } from '../core/Grid.js';
-/**
- * Unions the visible cells of several units for each faction and retains explored memory.
- * The caller supplies visibility because board games differ in terrain, range, and blockers.
- *
- * Factions that `share` see through one another's eyes - one map for the group, what is lit now
- * and what they remember having seen, which is what Wesnoth's `share_vision` means. Nothing shares
- * until asked, and sharing is a property of the sides rather than of any unit, so it survives every
- * `sync`.
- *
- * @example
- * ```ts
- * import { FactionFog } from '@datamoc/mw_games/board';
- *
- * const fog = new FactionFog(10, 10);
- *
- * const sources = [{ x: 2, y: 2 }];
- * fog.sync('blue', sources, (source) => [
- * 	source,
- * 	{ x: source.x + 1, y: source.y },
- * ]);
- *
- * console.log(fog.isVisible('blue', 3, 2)); // true - lit by the scout right now
- * console.log(fog.isVisible('blue', 5, 5)); // false - never seen
- *
- * fog.share(['blue', 'green']); // the two now see one map
- * console.log(fog.isVisible('green', 3, 2)); // true - blue's scout is watching for both
- *
- * fog.sync('blue', [], () => []); // the scout moved away, nothing visible this turn
- * console.log(fog.isVisible('green', 3, 2)); // false - no longer in sight, for either of them
- * console.log(fog.isExplored('green', 3, 2)); // true - stays remembered, for both
- * ```
- */
-export class FactionFog {
-    constructor(width, height) {
-        this.visible = new Map();
-        this.explored = new Map();
-        /** faction to the factions it shares vision with, itself included. Absent means it shares with nobody. */
-        this.shared = new Map();
-        if (width < 1 || height < 1)
-            throw new Error('fog needs positive dimensions');
-        this.width = width;
-        this.height = height;
-    }
-    /**
-     * Makes these factions see with one pair of eyes: each one's cells count as the others', both
-     * for what is visible now and for the shroud they remember.
-     *
-     * Calling it again widens the group rather than replacing it, so `share(['blue', 'green'])`
-     * after `share(['green', 'teal'])` leaves all three on one map. A side may also be told to share
-     * with itself, or with nobody at all, without harm.
-     */
-    share(factions) {
-        const named = [...new Set(factions)].filter((faction) => Boolean(faction));
-        if (named.length === 0)
-            return;
-        const group = new Set(named);
-        for (const faction of named) {
-            for (const mate of this.shared.get(faction) ?? [])
-                group.add(mate);
-        }
-        for (const faction of group)
-            this.shared.set(faction, group);
-    }
-    sync(faction, sources, cells) {
-        if (!faction)
-            throw new Error('fog needs a faction id');
-        const next = new Set();
-        for (const source of sources)
-            for (const cell of cells(source)) {
-                if (this.inside(cell.x, cell.y))
-                    next.add(this.index(cell.x, cell.y));
-            }
-        this.visible.set(faction, next);
-        const memory = this.explored.get(faction) ?? new Set();
-        for (const cell of next)
-            memory.add(cell);
-        this.explored.set(faction, memory);
-    }
-    /**
-     * Mark cells explored without changing what is currently visible: the
-     * shroud-clearing half of `sync`, for effects (a revealed map, a scouted
-     * region) that lift the shroud where no unit stands watch.
-     */
-    reveal(faction, cells) {
-        if (!faction)
-            throw new Error('fog needs a faction id');
-        const memory = this.explored.get(faction) ?? new Set();
-        for (const cell of cells) {
-            if (this.inside(cell.x, cell.y))
-                memory.add(this.index(cell.x, cell.y));
-        }
-        this.explored.set(faction, memory);
-    }
-    isVisible(faction, x, y) {
-        return this.seenBy(this.visible, faction, this.index(x, y));
-    }
-    /**
-     * One faction's sight as a predicate, ready to hand to anything that asks what a side can see -
-     * `ai`'s score views, for one. It reads the shroud as it is when called, not as it was when the
-     * predicate was made, so a caller holding one across a `sync` sees the update, and it follows
-     * whatever `share` the faction later joins.
-     */
-    sees(faction) {
-        return (x, y) => this.isVisible(faction, x, y);
-    }
-    isExplored(faction, x, y) {
-        return this.seenBy(this.explored, faction, this.index(x, y));
-    }
-    visibleCells(faction) {
-        return this.cellsSeenBy(this.visible, faction);
-    }
-    exploredCells(faction) {
-        return this.cellsSeenBy(this.explored, faction);
-    }
-    /** one cell, as the faction or anyone it shares with sees it */
-    seenBy(cells, faction, cell) {
-        const group = this.shared.get(faction);
-        if (!group)
-            return cells.get(faction)?.has(cell) ?? false;
-        for (const mate of group) {
-            if (cells.get(mate)?.has(cell))
-                return true;
-        }
-        return false;
-    }
-    /** one faction's cells, or the union over the group it shares with */
-    cellsSeenBy(cells, faction) {
-        const group = this.shared.get(faction);
-        if (!group)
-            return [...(cells.get(faction) ?? [])];
-        const union = new Set();
-        for (const mate of group) {
-            for (const cell of cells.get(mate) ?? [])
-                union.add(cell);
-        }
-        //sorted because a union of sets has no order of its own, and a caller comparing two of these
-        //should not have to care which of the group was synced first
-        return [...union].sort((a, b) => a - b);
-    }
-    inside(x, y) {
-        return cellInside(this.width, this.height, x, y);
-    }
-    index(x, y) {
-        //-1 rather than a throw: a vision pass asks about every neighbour of every cell, and
-        //"outside contributes nothing" is the answer it wants, not an exception to catch
-        return this.inside(x, y) ? cellIndex(this.width, x, y) : -1;
-    }
-}
-//# sourceMappingURL=FogOfWar.js.map

package/dist/board/FogOfWar.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"FogOfWar.js","sourceRoot":"","sources":["../../src/board/FogOfWar.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAOxD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,MAAM,OAAO,UAAU;IAStB,YAAY,KAAa,EAAE,MAAc;QANjC,YAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;QACzC,aAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;QAElD,0GAA0G;QACzF,WAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;QAGxD,IAAI,KAAK,GAAG,CAAC,IAAI,MAAM,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;QAC9E,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACtB,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,QAA2B;QAChC,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;QAC3E,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAE/B,MAAM,KAAK,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,CAAC;QACrC,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;YAC7B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE;gBAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpE,CAAC;QACD,KAAK,MAAM,OAAO,IAAI,KAAK;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IAC9D,CAAC;IAED,IAAI,CAAC,OAAe,EAAE,OAA8B,EAAE,KAAmD;QACxG,IAAI,CAAC,OAAO;YAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;QACxD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,MAAM,IAAI,OAAO;YAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;gBAClC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;oBAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACvE,CAAC;QACF,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAChC,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QAC/D,KAAK,MAAM,IAAI,IAAI,IAAI;YAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IACpC,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,OAAe,EAAE,KAA2B;QAClD,IAAI,CAAC,OAAO;YAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;QACxD,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QAC/D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YAC1B,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;gBAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACzE,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IACpC,CAAC;IAED,SAAS,CAAC,OAAe,EAAE,CAAS,EAAE,CAAS;QAC9C,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED;;;;;OAKG;IACH,IAAI,CAAC,OAAe;QACnB,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAChD,CAAC;IAED,UAAU,CAAC,OAAe,EAAE,CAAS,EAAE,CAAS;QAC/C,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9D,CAAC;IAED,YAAY,CAAC,OAAe;QAC3B,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAChD,CAAC;IACD,aAAa,CAAC,OAAe;QAC5B,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IACjD,CAAC;IAED,gEAAgE;IACxD,MAAM,CAAC,KAA+B,EAAE,OAAe,EAAE,IAAY;QAC5E,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK;YAAE,OAAO,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC;QAC1D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YAC1B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;QAC7C,CAAC;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAED,sEAAsE;IAC9D,WAAW,CAAC,KAA+B,EAAE,OAAe;QACnE,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK;YAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAEnD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;QAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YAC1B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE;gBAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3D,CAAC;QACD,6FAA6F;QAC7F,6DAA6D;QAC7D,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzC,CAAC;IAEO,MAAM,CAAC,CAAS,EAAE,CAAS;QAClC,OAAO,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAClD,CAAC;IACO,KAAK,CAAC,CAAS,EAAE,CAAS;QACjC,qFAAqF;QACrF,iFAAiF;QACjF,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC;CACD"}

package/dist/board/HexSkirmish.d.ts

@@ -1,213 +0,0 @@
-/**
- * A Wesnoth-style hex army-game rules layer: terrain that costs different movement points and
- * grants a defence bonus per terrain kind, adjacent attacks that always let a surviving
- * defender strike back, capturable villages that grant income and heal whoever stands on one,
- * and per-side turn income built on both. Distinct from `board.Tactics` (an X-COM-style
- * action-point/cover/overwatch layer, ranged attacks, no retaliation) - this is the other
- * shape a hex army game needs, adjacency-only combat with a hit chance and no zone of control.
- *
- * `mwg` supplies the mechanism only: `SkirmishTerrain`'s move cost and defence numbers, unit
- * attack/hit-chance/hp values, and income rates are entirely the game's own data, the same
- * policy `board.Army`'s `armyIncome` already follows.
- *
- * @example
- * ```ts
- * import { startingSkirmish, setSkirmishTerrain, addSkirmishUnit, skirmishMoves, moveSkirmishUnit, skirmishAttack, endSkirmishTurn, skirmishIncome } from '@datamoc/mw_games/board';
- *
- * const terrain = { plain: { moveCost: 1, defense: 0 }, forest: { moveCost: 2, defense: 0.3 } };
- * const state = startingSkirmish(6, 6, terrain);
- * setSkirmishTerrain(state, 2, 2, 'forest');
- * setSkirmishTerrain(state, 0, 0, 'plain', true); // a village at the corner
- *
- * addSkirmishUnit(state, { id: 'axeman', owner: 'blue', x: 0, y: 0, hp: 10, maxHp: 10, moves: 4, attack: 4, hitChance: 0.7 });
- * addSkirmishUnit(state, { id: 'raider', owner: 'red', x: 1, y: 0, hp: 10, maxHp: 10, moves: 4, attack: 3, hitChance: 0.6 });
- *
- * const moves = skirmishMoves(state, 'axeman'); // reachable cells, weighted by terrain cost
- * const exchange = skirmishAttack(state, 'axeman', 'raider'); // both strike if raider survives
- *
- * endSkirmishTurn(state); // hands the turn to red, refills moves, heals units on owned villages
- * const income = skirmishIncome(state, 'blue', 2, 1); // base 2, +1 per village blue owns
- * ```
- */
-export interface SkirmishTerrain {
-    /** movement points spent entering this terrain kind; `Infinity` makes it impassable */
-    moveCost: number;
-    /** 0-1 defence bonus for whoever is standing here while defending - what it multiplies is `skirmishAttack`'s own formula, not this terrain's own business */
-    defense: number;
-}
-export interface SkirmishCell {
-    terrain: string;
-    /** a capturable village - `moveSkirmishUnit` sets `owner` to whoever last stood here */
-    village?: boolean;
-    owner?: string;
-}
-export interface SkirmishUnit {
-    id: string;
-    owner: string;
-    x: number;
-    y: number;
-    hp: number;
-    maxHp: number;
-    /** movement points available this turn; refilled to `moves` by `endSkirmishTurn` */
-    moves: number;
-    remainingMoves?: number;
-    attack: number;
-    /** 0-1 base chance to land a hit, before the defender's terrain defence reduces it */
-    hitChance: number;
-}
-export interface SkirmishState {
-    width: number;
-    height: number;
-    terrainTable: Record<string, SkirmishTerrain>;
-    cells: SkirmishCell[];
-    units: SkirmishUnit[];
-    turn: string;
-    round: number;
-}
-export interface SkirmishMove {
-    unit: string;
-    x: number;
-    y: number;
-    cost: number;
-}
-export interface SkirmishStrike {
-    attacker: string;
-    defender: string;
-    hit: boolean;
-    damage: number;
-    killed: boolean;
-}
-export interface SkirmishExchange {
-    strikes: SkirmishStrike[];
-}
-/**
- * @example
- * ```ts
- * import { startingSkirmish } from '@datamoc/mw_games/board';
- *
- * const state = startingSkirmish(6, 6, { plain: { moveCost: 1, defense: 0 } });
- * console.log(state.width, state.round); // 6 1
- * ```
- */
-export declare function startingSkirmish(width: number, height: number, terrainTable: Record<string, SkirmishTerrain>, defaultTerrain?: string): SkirmishState;
-/**
- * @example
- * ```ts
- * import { startingSkirmish, setSkirmishTerrain } from '@datamoc/mw_games/board';
- *
- * const state = startingSkirmish(6, 6, { plain: { moveCost: 1, defense: 0 }, forest: { moveCost: 2, defense: 0.3 } });
- * setSkirmishTerrain(state, 2, 2, 'forest', true);
- * console.log(state.cells[2 * 6 + 2]); // { terrain: 'forest', village: true }
- * ```
- */
-export declare function setSkirmishTerrain(state: SkirmishState, x: number, y: number, terrain: string, village?: boolean): void;
-/**
- * whether a unit could be placed at (x, y) right now - on the map, passable, and unoccupied
- *
- * @example
- * ```ts
- * import { startingSkirmish, addSkirmishUnit, canPlaceSkirmishUnit } from '@datamoc/mw_games/board';
- *
- * const state = startingSkirmish(6, 6, { plain: { moveCost: 1, defense: 0 } });
- * addSkirmishUnit(state, { id: 'axeman', owner: 'blue', x: 0, y: 0, hp: 10, maxHp: 10, moves: 4, attack: 4, hitChance: 0.7 });
- *
- * console.log(canPlaceSkirmishUnit(state, 1, 0)); // true
- * console.log(canPlaceSkirmishUnit(state, 0, 0)); // false - axeman is already there
- * ```
- */
-export declare function canPlaceSkirmishUnit(state: SkirmishState, x: number, y: number): boolean;
-/**
- * Places a unit at full remaining movement; the first unit added decides whose turn it is.
- *
- * @example
- * ```ts
- * import { startingSkirmish, addSkirmishUnit } from '@datamoc/mw_games/board';
- *
- * const state = startingSkirmish(6, 6, { plain: { moveCost: 1, defense: 0 } });
- * addSkirmishUnit(state, { id: 'axeman', owner: 'blue', x: 0, y: 0, hp: 10, maxHp: 10, moves: 4, attack: 4, hitChance: 0.7 });
- * console.log(state.turn); // 'blue'
- * ```
- */
-export declare function addSkirmishUnit(state: SkirmishState, unit: SkirmishUnit): void;
-/**
- * Every cell a unit can reach with its remaining movement points this turn, weighted by each
- * terrain kind's own `moveCost` - no zone of control, unlike `board.Tactics`.
- *
- * @example
- * ```ts
- * import { startingSkirmish, addSkirmishUnit, skirmishMoves } from '@datamoc/mw_games/board';
- *
- * const state = startingSkirmish(6, 6, { plain: { moveCost: 1, defense: 0 } });
- * addSkirmishUnit(state, { id: 'axeman', owner: 'blue', x: 0, y: 0, hp: 10, maxHp: 10, moves: 2, attack: 4, hitChance: 0.7 });
- *
- * console.log(skirmishMoves(state, 'axeman').length); // 6 - every hex within 2 plain steps
- * ```
- */
-export declare function skirmishMoves(state: SkirmishState, unitId: string): SkirmishMove[];
-/**
- * @example
- * ```ts
- * import { startingSkirmish, addSkirmishUnit, skirmishMoves, moveSkirmishUnit } from '@datamoc/mw_games/board';
- *
- * const state = startingSkirmish(6, 6, { plain: { moveCost: 1, defense: 0 } });
- * addSkirmishUnit(state, { id: 'axeman', owner: 'blue', x: 0, y: 0, hp: 10, maxHp: 10, moves: 2, attack: 4, hitChance: 0.7 });
- *
- * moveSkirmishUnit(state, skirmishMoves(state, 'axeman')[0]);
- * console.log(state.units[0].remainingMoves); // 1 - one plain hex spent
- * ```
- */
-export declare function moveSkirmishUnit(state: SkirmishState, move: SkirmishMove): void;
-/**
- * An attacker's strike against an adjacent enemy, followed by the defender's own retaliation
- * if it survives - both use the same formula: `hitChance` reduced by the defender's terrain
- * defence, `Random.chance` deciding whether it lands, `attack` as the flat damage on a hit.
- *
- * @example
- * ```ts
- * import { startingSkirmish, addSkirmishUnit, skirmishAttack } from '@datamoc/mw_games/board';
- * import { Random } from '@datamoc/mw_games/core';
- *
- * const state = startingSkirmish(6, 6, { plain: { moveCost: 1, defense: 0 } });
- * addSkirmishUnit(state, { id: 'axeman', owner: 'blue', x: 0, y: 0, hp: 10, maxHp: 10, moves: 4, attack: 4, hitChance: 1 });
- * addSkirmishUnit(state, { id: 'raider', owner: 'red', x: 1, y: 0, hp: 10, maxHp: 10, moves: 4, attack: 3, hitChance: 1 });
- *
- * const exchange = Random.withSeed(1, () => skirmishAttack(state, 'axeman', 'raider'));
- * console.log(exchange.strikes.map((strike: { attacker: string }) => strike.attacker)); // ['axeman', 'raider'] - raider survived to retaliate
- * ```
- */
-export declare function skirmishAttack(state: SkirmishState, attackerId: string, defenderId: string): SkirmishExchange;
-/**
- * Net income for one side, from a flat base plus every village it currently owns - purely a
- * function of the map's own village ownership, no formula beyond that belongs here, the same
- * policy `board.Army`'s `armyIncome` already follows.
- *
- * @example
- * ```ts
- * import { startingSkirmish, setSkirmishTerrain, skirmishIncome } from '@datamoc/mw_games/board';
- *
- * const state = startingSkirmish(4, 1, { plain: { moveCost: 1, defense: 0 } });
- * setSkirmishTerrain(state, 0, 0, 'plain', true);
- * state.cells[0].owner = 'blue';
- *
- * console.log(skirmishIncome(state, 'blue', 2, 1)); // 3 - base 2, plus 1 for the one village
- * ```
- */
-export declare function skirmishIncome(state: SkirmishState, owner: string, baseIncome: number, perVillage: number): number;
-/**
- * Hands the turn to the next owner with units on the board, refilling their movement and
- * healing every one of their units standing on a village they own.
- *
- * @example
- * ```ts
- * import { startingSkirmish, addSkirmishUnit, endSkirmishTurn } from '@datamoc/mw_games/board';
- *
- * const state = startingSkirmish(6, 6, { plain: { moveCost: 1, defense: 0 } });
- * addSkirmishUnit(state, { id: 'axeman', owner: 'blue', x: 0, y: 0, hp: 10, maxHp: 10, moves: 4, attack: 4, hitChance: 0.7 });
- * addSkirmishUnit(state, { id: 'raider', owner: 'red', x: 3, y: 0, hp: 10, maxHp: 10, moves: 4, attack: 3, hitChance: 0.6 });
- *
- * endSkirmishTurn(state, 2);
- * console.log(state.turn, state.round); // 'red' 1
- * ```
- */
-export declare function endSkirmishTurn(state: SkirmishState, healPerVillage?: number): void;
-//# sourceMappingURL=HexSkirmish.d.ts.map

package/dist/board/HexSkirmish.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"HexSkirmish.d.ts","sourceRoot":"","sources":["../../src/board/HexSkirmish.ts"],"names":[],"mappings":"AAKA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,MAAM,WAAW,eAAe;IAC/B,uFAAuF;IACvF,QAAQ,EAAE,MAAM,CAAC;IAEjB,6JAA6J;IAC7J,OAAO,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,YAAY;IAC5B,OAAO,EAAE,MAAM,CAAC;IAEhB,wFAAwF;IACxF,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,YAAY;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IAEd,oFAAoF;IACpF,KAAK,EAAE,MAAM,CAAC;IACd,cAAc,CAAC,EAAE,MAAM,CAAC;IAExB,MAAM,EAAE,MAAM,CAAC;IAEf,sFAAsF;IACtF,SAAS,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,aAAa;IAC7B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;IAC9C,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,YAAY;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,IAAI,EAAE,MAAM,CAAC;CACb;AACD,MAAM,WAAW,cAAc;IAC9B,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,GAAG,EAAE,OAAO,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,OAAO,CAAC;CAChB;AACD,MAAM,WAAW,gBAAgB;IAChC,OAAO,EAAE,cAAc,EAAE,CAAC;CAC1B;AAED;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAC/B,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,EACd,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,EAC7C,cAAc,CAAC,EAAE,MAAM,GACrB,aAAa,CAaf;AAED;;;;;;;;;GASG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,aAAa,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,UAAQ,GAAG,IAAI,CAIrH;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,aAAa,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAExF;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,GAAG,IAAI,CAI9E;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,GAAG,YAAY,EAAE,CAqBlF;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,GAAG,IAAI,CAU/E;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,gBAAgB,CAW7G;AAUD;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,CAGlH;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,aAAa,EAAE,cAAc,SAAI,GAAG,IAAI,CAe9E"}

package/dist/board/HexSkirmish.js

@@ -1,268 +0,0 @@
-import { hexNeighbors, hexDistance } from '../core/Hex.js';
-import { cellInside, cellKey } from '../core/Grid.js';
-import { weightedFlood } from '../core/Pathfinding.js';
-import * as Random from '../core/Random.js';
-/**
- * @example
- * ```ts
- * import { startingSkirmish } from '@datamoc/mw_games/board';
- *
- * const state = startingSkirmish(6, 6, { plain: { moveCost: 1, defense: 0 } });
- * console.log(state.width, state.round); // 6 1
- * ```
- */
-export function startingSkirmish(width, height, terrainTable, defaultTerrain) {
-    if (width < 1 || height < 1)
-        throw new Error('a skirmish map needs positive dimensions');
-    const terrain = defaultTerrain ?? Object.keys(terrainTable)[0];
-    if (!terrain || !terrainTable[terrain])
-        throw new Error('a skirmish map needs at least one terrain kind');
-    return {
-        width,
-        height,
-        terrainTable,
-        cells: Array.from({ length: width * height }, () => ({ terrain })),
-        units: [],
-        turn: '',
-        round: 1,
-    };
-}
-/**
- * @example
- * ```ts
- * import { startingSkirmish, setSkirmishTerrain } from '@datamoc/mw_games/board';
- *
- * const state = startingSkirmish(6, 6, { plain: { moveCost: 1, defense: 0 }, forest: { moveCost: 2, defense: 0.3 } });
- * setSkirmishTerrain(state, 2, 2, 'forest', true);
- * console.log(state.cells[2 * 6 + 2]); // { terrain: 'forest', village: true }
- * ```
- */
-export function setSkirmishTerrain(state, x, y, terrain, village = false) {
-    if (!inside(state, x, y))
-        throw new Error('cell is outside the skirmish map');
-    if (!state.terrainTable[terrain])
-        throw new Error(`unknown skirmish terrain "${terrain}"`);
-    state.cells[y * state.width + x] = village ? { terrain, village: true } : { terrain };
-}
-/**
- * whether a unit could be placed at (x, y) right now - on the map, passable, and unoccupied
- *
- * @example
- * ```ts
- * import { startingSkirmish, addSkirmishUnit, canPlaceSkirmishUnit } from '@datamoc/mw_games/board';
- *
- * const state = startingSkirmish(6, 6, { plain: { moveCost: 1, defense: 0 } });
- * addSkirmishUnit(state, { id: 'axeman', owner: 'blue', x: 0, y: 0, hp: 10, maxHp: 10, moves: 4, attack: 4, hitChance: 0.7 });
- *
- * console.log(canPlaceSkirmishUnit(state, 1, 0)); // true
- * console.log(canPlaceSkirmishUnit(state, 0, 0)); // false - axeman is already there
- * ```
- */
-export function canPlaceSkirmishUnit(state, x, y) {
-    return inside(state, x, y) && moveCostOf(state, x, y) < Infinity && !occupied(state, x, y);
-}
-/**
- * Places a unit at full remaining movement; the first unit added decides whose turn it is.
- *
- * @example
- * ```ts
- * import { startingSkirmish, addSkirmishUnit } from '@datamoc/mw_games/board';
- *
- * const state = startingSkirmish(6, 6, { plain: { moveCost: 1, defense: 0 } });
- * addSkirmishUnit(state, { id: 'axeman', owner: 'blue', x: 0, y: 0, hp: 10, maxHp: 10, moves: 4, attack: 4, hitChance: 0.7 });
- * console.log(state.turn); // 'blue'
- * ```
- */
-export function addSkirmishUnit(state, unit) {
-    if (!canPlaceSkirmishUnit(state, unit.x, unit.y))
-        throw new Error('skirmish unit cannot be placed there');
-    state.units.push({ ...unit, remainingMoves: unit.moves });
-    if (!state.turn)
-        state.turn = unit.owner;
-}
-/**
- * Every cell a unit can reach with its remaining movement points this turn, weighted by each
- * terrain kind's own `moveCost` - no zone of control, unlike `board.Tactics`.
- *
- * @example
- * ```ts
- * import { startingSkirmish, addSkirmishUnit, skirmishMoves } from '@datamoc/mw_games/board';
- *
- * const state = startingSkirmish(6, 6, { plain: { moveCost: 1, defense: 0 } });
- * addSkirmishUnit(state, { id: 'axeman', owner: 'blue', x: 0, y: 0, hp: 10, maxHp: 10, moves: 2, attack: 4, hitChance: 0.7 });
- *
- * console.log(skirmishMoves(state, 'axeman').length); // 6 - every hex within 2 plain steps
- * ```
- */
-export function skirmishMoves(state, unitId) {
-    const unit = getUnit(state, unitId);
-    const budget = unit.remainingMoves ?? unit.moves;
-    if (unit.owner !== state.turn || budget <= 0)
-        return [];
-    //one reachability pass, not one Dijkstra per candidate cell: a cell held by another unit, or
-    //impassable terrain, is never a candidate. The mover is not blocked - it is leaving its own
-    //cell, so its own cell stays free in the pass.
-    const blocked = new Set(state.units.filter((candidate) => candidate.id !== unit.id).map((candidate) => `${candidate.x},${candidate.y}`));
-    const costs = reachableCosts(state, unit, budget, blocked);
-    const out = [];
-    for (let y = 0; y < state.height; y++)
-        for (let x = 0; x < state.width; x++) {
-            if ((x === unit.x && y === unit.y) || moveCostOf(state, x, y) === Infinity || blocked.has(`${x},${y}`))
-                continue;
-            const cost = costs.get(`${x},${y}`);
-            if (cost !== undefined && cost <= budget)
-                out.push({ unit: unitId, x, y, cost });
-        }
-    return out;
-}
-/**
- * @example
- * ```ts
- * import { startingSkirmish, addSkirmishUnit, skirmishMoves, moveSkirmishUnit } from '@datamoc/mw_games/board';
- *
- * const state = startingSkirmish(6, 6, { plain: { moveCost: 1, defense: 0 } });
- * addSkirmishUnit(state, { id: 'axeman', owner: 'blue', x: 0, y: 0, hp: 10, maxHp: 10, moves: 2, attack: 4, hitChance: 0.7 });
- *
- * moveSkirmishUnit(state, skirmishMoves(state, 'axeman')[0]);
- * console.log(state.units[0].remainingMoves); // 1 - one plain hex spent
- * ```
- */
-export function moveSkirmishUnit(state, move) {
-    const legal = skirmishMoves(state, move.unit).find((candidate) => candidate.x === move.x && candidate.y === move.y);
-    if (!legal)
-        throw new Error('illegal skirmish move');
-    const unit = getUnit(state, move.unit);
-    unit.x = move.x;
-    unit.y = move.y;
-    unit.remainingMoves = (unit.remainingMoves ?? unit.moves) - legal.cost;
-    const cell = state.cells[move.y * state.width + move.x];
-    if (cell.village)
-        cell.owner = unit.owner;
-}
-/**
- * An attacker's strike against an adjacent enemy, followed by the defender's own retaliation
- * if it survives - both use the same formula: `hitChance` reduced by the defender's terrain
- * defence, `Random.chance` deciding whether it lands, `attack` as the flat damage on a hit.
- *
- * @example
- * ```ts
- * import { startingSkirmish, addSkirmishUnit, skirmishAttack } from '@datamoc/mw_games/board';
- * import { Random } from '@datamoc/mw_games/core';
- *
- * const state = startingSkirmish(6, 6, { plain: { moveCost: 1, defense: 0 } });
- * addSkirmishUnit(state, { id: 'axeman', owner: 'blue', x: 0, y: 0, hp: 10, maxHp: 10, moves: 4, attack: 4, hitChance: 1 });
- * addSkirmishUnit(state, { id: 'raider', owner: 'red', x: 1, y: 0, hp: 10, maxHp: 10, moves: 4, attack: 3, hitChance: 1 });
- *
- * const exchange = Random.withSeed(1, () => skirmishAttack(state, 'axeman', 'raider'));
- * console.log(exchange.strikes.map((strike: { attacker: string }) => strike.attacker)); // ['axeman', 'raider'] - raider survived to retaliate
- * ```
- */
-export function skirmishAttack(state, attackerId, defenderId) {
-    const attacker = getUnit(state, attackerId);
-    const defender = getUnit(state, defenderId);
-    if (attacker.owner !== state.turn || attacker.owner === defender.owner)
-        throw new Error('invalid skirmish attack');
-    if (hexDistance(attacker, defender) !== 1)
-        throw new Error('skirmish combat is adjacency-only');
-    const strikes = [strike(state, attacker, defender)];
-    if (defender.hp > 0)
-        strikes.push(strike(state, defender, attacker));
-    state.units = state.units.filter((unit) => unit.hp > 0);
-    return { strikes };
-}
-function strike(state, attacker, defender) {
-    const defense = terrainOf(state, defender.x, defender.y).defense;
-    const hit = Random.chance(Math.max(0, Math.min(1, attacker.hitChance * (1 - defense))));
-    const damage = hit ? Math.min(attacker.attack, defender.hp) : 0;
-    defender.hp -= damage;
-    return { attacker: attacker.id, defender: defender.id, hit, damage, killed: defender.hp <= 0 };
-}
-/**
- * Net income for one side, from a flat base plus every village it currently owns - purely a
- * function of the map's own village ownership, no formula beyond that belongs here, the same
- * policy `board.Army`'s `armyIncome` already follows.
- *
- * @example
- * ```ts
- * import { startingSkirmish, setSkirmishTerrain, skirmishIncome } from '@datamoc/mw_games/board';
- *
- * const state = startingSkirmish(4, 1, { plain: { moveCost: 1, defense: 0 } });
- * setSkirmishTerrain(state, 0, 0, 'plain', true);
- * state.cells[0].owner = 'blue';
- *
- * console.log(skirmishIncome(state, 'blue', 2, 1)); // 3 - base 2, plus 1 for the one village
- * ```
- */
-export function skirmishIncome(state, owner, baseIncome, perVillage) {
-    const villages = state.cells.filter((cell) => cell.village && cell.owner === owner).length;
-    return baseIncome + villages * perVillage;
-}
-/**
- * Hands the turn to the next owner with units on the board, refilling their movement and
- * healing every one of their units standing on a village they own.
- *
- * @example
- * ```ts
- * import { startingSkirmish, addSkirmishUnit, endSkirmishTurn } from '@datamoc/mw_games/board';
- *
- * const state = startingSkirmish(6, 6, { plain: { moveCost: 1, defense: 0 } });
- * addSkirmishUnit(state, { id: 'axeman', owner: 'blue', x: 0, y: 0, hp: 10, maxHp: 10, moves: 4, attack: 4, hitChance: 0.7 });
- * addSkirmishUnit(state, { id: 'raider', owner: 'red', x: 3, y: 0, hp: 10, maxHp: 10, moves: 4, attack: 3, hitChance: 0.6 });
- *
- * endSkirmishTurn(state, 2);
- * console.log(state.turn, state.round); // 'red' 1
- * ```
- */
-export function endSkirmishTurn(state, healPerVillage = 0) {
-    const owners = [...new Set(state.units.map((unit) => unit.owner))];
-    if (owners.length === 0)
-        return;
-    const next = owners.indexOf(state.turn) + 1;
-    if (next >= owners.length)
-        state.round++;
-    state.turn = owners[next % owners.length];
-    for (const unit of state.units) {
-        if (unit.owner !== state.turn)
-            continue;
-        unit.remainingMoves = unit.moves;
-        const cell = state.cells[unit.y * state.width + unit.x];
-        if (cell.village && cell.owner === unit.owner && healPerVillage > 0) {
-            unit.hp = Math.min(unit.maxHp, unit.hp + healPerVillage);
-        }
-    }
-}
-function getUnit(state, id) {
-    const unit = state.units.find((candidate) => candidate.id === id);
-    if (!unit)
-        throw new Error(`unknown skirmish unit "${id}"`);
-    return unit;
-}
-function inside(state, x, y) {
-    return cellInside(state.width, state.height, x, y);
-}
-function occupied(state, x, y) {
-    return state.units.some((unit) => unit.x === x && unit.y === y);
-}
-function terrainOf(state, x, y) {
-    return state.terrainTable[state.cells[y * state.width + x].terrain];
-}
-function moveCostOf(state, x, y) {
-    return terrainOf(state, x, y).moveCost;
-}
-//the weighted walking cost to every free cell within `budget`, keyed `"x,y"` - one Dijkstra
-//from the unit rather than one per target, since terrain move cost varies per cell unlike
-//board.Tactics' uniform one-step cost. A blocked cell is never walked through, so it is relaxed
-//from nobody; `skirmishMoves` reaches a blocked target from an adjacent free cell. The moving
-//unit is not blocked (it is leaving its own cell), only the other units are.
-function reachableCosts(state, unit, budget, blocked) {
-    const reached = weightedFlood({ x: unit.x, y: unit.y }, {
-        key: (cell) => cellKey(cell.x, cell.y),
-        neighbors: (cell) => hexNeighbors(cell.x, cell.y).filter((next) => inside(state, next.x, next.y)),
-        cost: (_from, to) => moveCostOf(state, to.x, to.y),
-        canEnter: (cell) => !blocked.has(cellKey(cell.x, cell.y)),
-        //weightedFlood reaches nothing under a non-finite ceiling, where an unlimited mover reaches everything
-        maxCost: Number.isFinite(budget) ? budget : Number.MAX_VALUE,
-    });
-    return new Map([...reached].map(([key, cell]) => [key, cell.cost]));
-}
-//# sourceMappingURL=HexSkirmish.js.map

package/dist/board/HexSkirmish.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"HexSkirmish.js","sourceRoot":"","sources":["../../src/board/HexSkirmish.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,WAAW,EAAiB,MAAM,gBAAgB,CAAC;AAC1E,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAC;AACtD,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,KAAK,MAAM,MAAM,mBAAmB,CAAC;AA8F5C;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAC/B,KAAa,EACb,MAAc,EACd,YAA6C,EAC7C,cAAuB;IAEvB,IAAI,KAAK,GAAG,CAAC,IAAI,MAAM,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;IACzF,MAAM,OAAO,GAAG,cAAc,IAAI,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,IAAI,CAAC,OAAO,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;IAC1G,OAAO;QACN,KAAK;QACL,MAAM;QACN,YAAY;QACZ,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,GAAG,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC;QAClE,KAAK,EAAE,EAAE;QACT,IAAI,EAAE,EAAE;QACR,KAAK,EAAE,CAAC;KACR,CAAC;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAoB,EAAE,CAAS,EAAE,CAAS,EAAE,OAAe,EAAE,OAAO,GAAG,KAAK;IAC9G,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;IAC9E,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,OAAO,GAAG,CAAC,CAAC;IAC3F,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC;AACvF,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAoB,EAAE,CAAS,EAAE,CAAS;IAC9E,OAAO,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5F,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,eAAe,CAAC,KAAoB,EAAE,IAAkB;IACvE,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;IAC1G,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,cAAc,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;IAC1D,IAAI,CAAC,KAAK,CAAC,IAAI;QAAE,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;AAC1C,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,aAAa,CAAC,KAAoB,EAAE,MAAc;IACjE,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACpC,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,KAAK,CAAC;IACjD,IAAI,IAAI,CAAC,KAAK,KAAK,KAAK,CAAC,IAAI,IAAI,MAAM,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IAExD,6FAA6F;IAC7F,4FAA4F;IAC5F,+CAA+C;IAC/C,MAAM,OAAO,GAAG,IAAI,GAAG,CACtB,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,EAAE,CAAC,CAC/G,CAAC;IACF,MAAM,KAAK,GAAG,cAAc,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IAC3D,MAAM,GAAG,GAAmB,EAAE,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACrG,SAAS;YACV,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACpC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,IAAI,MAAM;gBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;QAClF,CAAC;IACF,OAAO,GAAG,CAAC;AACZ,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAoB,EAAE,IAAkB;IACxE,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC;IACpH,IAAI,CAAC,KAAK;QAAE,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;IACrD,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAChB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAChB,IAAI,CAAC,cAAc,GAAG,CAAC,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC;IAEvE,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACxD,IAAI,IAAI,CAAC,OAAO;QAAE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;AAC3C,CAAC;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,cAAc,CAAC,KAAoB,EAAE,UAAkB,EAAE,UAAkB;IAC1F,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IAC5C,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IAC5C,IAAI,QAAQ,CAAC,KAAK,KAAK,KAAK,CAAC,IAAI,IAAI,QAAQ,CAAC,KAAK,KAAK,QAAQ,CAAC,KAAK;QAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;IACnH,IAAI,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IAEhG,MAAM,OAAO,GAAqB,CAAC,MAAM,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;IACtE,IAAI,QAAQ,CAAC,EAAE,GAAG,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;IAErE,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACxD,OAAO,EAAE,OAAO,EAAE,CAAC;AACpB,CAAC;AAED,SAAS,MAAM,CAAC,KAAoB,EAAE,QAAsB,EAAE,QAAsB;IACnF,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;IACjE,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IACxF,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,QAAQ,CAAC,EAAE,IAAI,MAAM,CAAC;IACtB,OAAO,EAAE,QAAQ,EAAE,QAAQ,CAAC,EAAE,EAAE,QAAQ,EAAE,QAAQ,CAAC,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;AAChG,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,cAAc,CAAC,KAAoB,EAAE,KAAa,EAAE,UAAkB,EAAE,UAAkB;IACzG,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC,MAAM,CAAC;IAC3F,OAAO,UAAU,GAAG,QAAQ,GAAG,UAAU,CAAC;AAC3C,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,eAAe,CAAC,KAAoB,EAAE,cAAc,GAAG,CAAC;IACvE,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAChC,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC5C,IAAI,IAAI,IAAI,MAAM,CAAC,MAAM;QAAE,KAAK,CAAC,KAAK,EAAE,CAAC;IACzC,KAAK,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;IAE1C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAChC,IAAI,IAAI,CAAC,KAAK,KAAK,KAAK,CAAC,IAAI;YAAE,SAAS;QACxC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC;QACjC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACxD,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;YACrE,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,GAAG,cAAc,CAAC,CAAC;QAC1D,CAAC;IACF,CAAC;AACF,CAAC;AAED,SAAS,OAAO,CAAC,KAAoB,EAAE,EAAU;IAChD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;IAClE,IAAI,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,0BAA0B,EAAE,GAAG,CAAC,CAAC;IAC5D,OAAO,IAAI,CAAC;AACb,CAAC;AACD,SAAS,MAAM,CAAC,KAAoB,EAAE,CAAS,EAAE,CAAS;IACzD,OAAO,UAAU,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACpD,CAAC;AACD,SAAS,QAAQ,CAAC,KAAoB,EAAE,CAAS,EAAE,CAAS;IAC3D,OAAO,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;AACjE,CAAC;AACD,SAAS,SAAS,CAAC,KAAoB,EAAE,CAAS,EAAE,CAAS;IAC5D,OAAO,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;AACrE,CAAC;AACD,SAAS,UAAU,CAAC,KAAoB,EAAE,CAAS,EAAE,CAAS;IAC7D,OAAO,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;AACxC,CAAC;AAED,4FAA4F;AAC5F,0FAA0F;AAC1F,gGAAgG;AAChG,8FAA8F;AAC9F,6EAA6E;AAC7E,SAAS,cAAc,CACtB,KAAoB,EACpB,IAAkB,EAClB,MAAc,EACd,OAA4B;IAE5B,MAAM,OAAO,GAAG,aAAa,CAC5B,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,EACxB;QACC,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;QACtC,SAAS,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QACjG,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAClD,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QACzD,uGAAuG;QACvG,OAAO,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS;KAC5D,CACD,CAAC;IACF,OAAO,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACrE,CAAC"}