@datamoc/mw_games 0.43.0 → 0.45.0

package/dist/ai/Heuristics.d.ts

@@ -1,240 +0,0 @@
-/** A single aspect's value: the shapes a game authors in content without inventing a type. */
-export type AspectValue = number | string | boolean | readonly string[];
-export interface AspectValues {
-    readonly [name: string]: AspectValue | undefined;
-}
-/**
- * The named tuning knobs of a heuristic AI - Wesnoth's "aspects" - read by whatever stage is
- * scoring candidates. `mwg` ships no values, because the numbers are game content: a side sets
- * `aggression`, `caution`, `village_value`, `keep_away` and the rest to whatever its own balance
- * wants, and a difficulty level overrides a few of them.
- *
- * Typed readers give a stage a usable number without every caller casting: a missing aspect reads
- * as the fallback the caller passes (`1` for a neutral weight, `0` where an unset aspect should zero the score).
- *
- * @example
- * ```ts
- * import { Aspects } from '@datamoc/mw_games/ai';
- *
- * const aspects = new Aspects({ aggression: 2, keep_away: 3 });
- * console.log(aspects.number('aggression')); // 2
- * console.log(aspects.number('caution')); // 0 - the fallback
- * ```
- */
-export declare class Aspects {
-    private values;
-    constructor(defaults?: AspectValues);
-    has(name: string): boolean;
-    get(name: string): AspectValue | undefined;
-    set(name: string, value: AspectValue): void;
-    /** a numeric aspect, or `fallback` when it is missing or not a number */
-    number(name: string, fallback?: number): number;
-    flag(name: string, fallback?: boolean): boolean;
-    /** a list aspect; a bare string reads as a one-entry list, anything else as empty */
-    list(name: string): readonly string[];
-    names(): string[];
-    /** a new store with `overrides` laid over this one, leaving this one untouched */
-    with(overrides: AspectValues): Aspects;
-    toJSON(): Record<string, AspectValue>;
-    static fromJSON(values: Readonly<Record<string, AspectValue>>): Aspects;
-}
-export interface DifficultyLevel {
-    id: string;
-    name?: string;
-    /** the aspects this level changes from the game's base set */
-    aspects?: AspectValues;
-}
-/**
- * Named difficulty levels, each a set of aspect overrides - Wesnoth's native difficulty ladder,
- * which is really "the same AI with different numbers". A level is applied on top of a base aspect
- * set, so a game writes its normal AI once and a level only lists what it changes.
- *
- * @example
- * ```ts
- * import { Aspects, Difficulty } from '@datamoc/mw_games/ai';
- *
- * const difficulty = new Difficulty(
- *   [{ id: 'hard', aspects: { aggression: 2, keep_away: 3 } }],
- *   { aggression: 1 },
- * );
- * console.log(difficulty.aspectsFor('hard').number('aggression')); // 2
- * ```
- */
-export declare class Difficulty {
-    private readonly levels;
-    private readonly base;
-    constructor(levels?: readonly DifficultyLevel[], base?: AspectValues);
-    get ids(): string[];
-    get(id: string): DifficultyLevel | undefined;
-    /** the base aspects with a level's overrides applied; throws for an unknown level */
-    aspectsFor(id: string): Aspects;
-}
-export type GoalKind = 'attack' | 'defend' | 'retreat' | 'capture' | 'scout';
-export interface Goal {
-    unit: string;
-    kind: GoalKind;
-    /** what the goal is about: the enemy to attack, the village to hold */
-    target?: string;
-    /** a tiebreaker between goals, read by a stage's own `weigh`; defaults to 1 */
-    priority?: number;
-}
-/**
- * Per-unit goals - "hold this village", "attack that leader" - kept as a small registry for a
- * stage's `weigh` to read. `mwg` does not decide what a goal is worth, the same way it ships no
- * damage formula: the registry answers *what* a unit has been told to do, and a game's weigh
- * decides how much that matters.
- *
- * @example
- * ```ts
- * import { Goals } from '@datamoc/mw_games/ai';
- *
- * const goals = new Goals();
- * goals.set({ unit: 'hero', kind: 'attack', target: 'rat', priority: 3 });
- * console.log(goals.get('hero')?.kind); // 'attack'
- * ```
- */
-export declare class Goals {
-    private readonly byUnit;
-    set(goal: Goal): void;
-    clear(unit: string): void;
-    get(unit: string): Goal | undefined;
-    all(): readonly Goal[];
-    get isEmpty(): boolean;
-}
-/**
- * The order a side recruits in - Wesnoth's `recruitment_pattern`, e.g. `scout, fighter, archer` -
- * cycled by turn. A side with nothing left to recruit falls back to its `fallback`, and a side
- * with neither recruits nothing.
- *
- * @example
- * ```ts
- * import { RecruitmentPattern } from '@datamoc/mw_games/ai';
- *
- * const pattern = new RecruitmentPattern(['scout', 'fighter'], 'fighter');
- * console.log(pattern.at(0), pattern.at(1), pattern.at(2)); // scout fighter scout
- * ```
- */
-export declare class RecruitmentPattern {
-    private readonly order;
-    private readonly fallback;
-    constructor(order: readonly string[], fallback?: string | null);
-    get length(): number;
-    /** the unit type at a position in the cycle, or the fallback when the pattern is empty */
-    at(index: number): string | null;
-    /** the entry after `after` in the cycle, or the first when `after` is not in it */
-    next(after: string | null): string | null;
-}
-export interface HeuristicCandidate<A = unknown> {
-    /** an id for tracing which candidate won */
-    id: string;
-    action: A;
-    /** the unit the action belongs to, matched against `Goals` by a stage's own `weigh` */
-    unit?: string;
-    /**
-     * Aspect-named weights this candidate contributes, e.g. `{ aggression: 3, village_value: 2 }`.
-     * `distance` is special: with a `keep_away` aspect it is penalised by `keepAwayScore`.
-     */
-    factors?: Readonly<Record<string, number>>;
-    /** the acting unit's type, when the candidate carries one */
-    type?: string;
-    /** the acting unit's role/function, e.g. `leader` or `courier` */
-    role?: string;
-    /** whether the acting unit can recruit */
-    can_recruit?: boolean;
-    /** the acting unit's own name */
-    name?: string;
-}
-export interface HeuristicContext {
-    aspects: Aspects;
-    goals?: Goals;
-    turn?: number;
-}
-export interface HeuristicStage<A = unknown> {
-    id: string;
-    /** whether this stage runs at all; it always does when omitted */
-    when?: (context: HeuristicContext) => boolean;
-    /** score one candidate; higher wins. Defaults to `defaultWeigh` */
-    weigh?: (candidate: HeuristicCandidate<A>, context: HeuristicContext) => number;
-}
-export interface HeuristicDecision<A = unknown> {
-    candidate: HeuristicCandidate<A>;
-    stage: string;
-    score: number;
-}
-/**
- * The candidate-action pipeline at the heart of a Wesnoth-style AI: stages run in order, the first
- * one whose `when` passes scores every candidate with its `weigh`, and the highest score wins (the
- * earlier candidate on a tie, so a decision is stable across equal scores).
- *
- * The default `weigh` is the aspect-weighted sum of each candidate's `factors`, which is what makes
- * the aspects worth having: a game sets `aggression: 2` once and every candidate naming
- * `aggression` is worth twice as much. `keep_away` is honoured through a candidate's `distance`
- * factor. A stage that needs more - goal priorities, terrain, this turn's state - brings its own
- * `weigh`, and `mwg` stays out of the rules.
- *
- * @example
- * ```ts
- * import { Aspects, HeuristicAI } from '@datamoc/mw_games/ai';
- *
- * const ai = new HeuristicAI<{ kind: string }>({ stages: [{ id: 'best' }] });
- * const decision = ai.decide(
- *   [
- *     { id: 'wait', action: { kind: 'wait' }, factors: { caution: 2 } },
- *     { id: 'charge', action: { kind: 'attack' }, factors: { aggression: 3 } },
- *   ],
- *   { aspects: new Aspects({ aggression: 1, caution: 1 }) },
- * );
- * console.log(decision?.candidate.id); // 'charge'
- * ```
- */
-export declare class HeuristicAI<A = unknown> {
-    private readonly stages;
-    constructor(options: {
-        stages: readonly HeuristicStage<A>[];
-    });
-    /** the first stage's best candidate, or `null` when nothing applies or no candidate is given */
-    decide(candidates: readonly HeuristicCandidate<A>[], context: HeuristicContext): HeuristicDecision<A> | null;
-}
-/**
- * The default stage weight: each factor times the aspect of the same name (an unset aspect weighs
- * 1, so a factor on its own is not erased), minus a `keepAwayScore` penalty for a candidate's
- * `distance`.
- *
- * @example
- * ```ts
- * import { Aspects, defaultWeigh } from '@datamoc/mw_games/ai';
- *
- * const score = defaultWeigh(
- *   { id: 'charge', action: {}, factors: { aggression: 3 } },
- *   { aspects: new Aspects({ aggression: 2 }) },
- * );
- * console.log(score); // 6
- * ```
- */
-export declare function defaultWeigh<A>(candidate: HeuristicCandidate<A>, context: HeuristicContext): number;
-/**
- * How much a candidate at `distance` loses for being inside a `keepAway` radius: 0 when there is no
- * radius or the candidate is outside it, otherwise the shortfall as a negative score.
- *
- * @example
- * ```ts
- * import { keepAwayScore } from '@datamoc/mw_games/ai';
- *
- * console.log(keepAwayScore(1, 3)); // -2, two tiles inside the radius
- * console.log(keepAwayScore(5, 3)); // 0, outside it
- * ```
- */
-export declare function keepAwayScore(distance: number, keepAway: number): number;
-/**
- * What a stage's own weigh can add for a goal: its `priority`, or 1 when it has none.
- *
- * @example
- * ```ts
- * import { goalScore } from '@datamoc/mw_games/ai';
- *
- * console.log(goalScore({ unit: 'u1', kind: 'attack', priority: 3 })); // 3
- * console.log(goalScore(undefined)); // 0, no goal at all
- * ```
- */
-export declare function goalScore(goal: Goal | undefined): number;
-//# sourceMappingURL=Heuristics.d.ts.map

package/dist/ai/Heuristics.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Heuristics.d.ts","sourceRoot":"","sources":["../../src/ai/Heuristics.ts"],"names":[],"mappings":"AAAA,8FAA8F;AAC9F,MAAM,MAAM,WAAW,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,SAAS,MAAM,EAAE,CAAC;AACxE,MAAM,WAAW,YAAY;IAC5B,QAAQ,EAAE,IAAI,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS,CAAC;CACjD;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,qBAAa,OAAO;IACnB,OAAO,CAAC,MAAM,CAAmC;IAEjD,YAAY,QAAQ,GAAE,YAAiB,EAItC;IAED,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAEzB;IAED,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS,CAEzC;IAED,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,GAAG,IAAI,CAE1C;IAED,yEAAyE;IACzE,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,SAAI,GAAG,MAAM,CAKzC;IAED,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,UAAQ,GAAG,OAAO,CAG5C;IAED,qFAAqF;IACrF,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAKpC;IAED,KAAK,IAAI,MAAM,EAAE,CAEhB;IAED,kFAAkF;IAClF,IAAI,CAAC,SAAS,EAAE,YAAY,GAAG,OAAO,CAMrC;IAED,MAAM,IAAI,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAEpC;IAED,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,GAAG,OAAO,CAEtE;CACD;AAED,MAAM,WAAW,eAAe;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,8DAA8D;IAC9D,OAAO,CAAC,EAAE,YAAY,CAAC;CACvB;AAED;;;;;;;;;;;;;;;GAeG;AACH,qBAAa,UAAU;IACtB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAsC;IAC7D,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAU;IAE/B,YAAY,MAAM,GAAE,SAAS,eAAe,EAAO,EAAE,IAAI,GAAE,YAAiB,EAM3E;IAED,IAAI,GAAG,IAAI,MAAM,EAAE,CAElB;IAED,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,eAAe,GAAG,SAAS,CAE3C;IAED,qFAAqF;IACrF,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAI9B;CACD;AAED,MAAM,MAAM,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG,OAAO,CAAC;AAE7E,MAAM,WAAW,IAAI;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,QAAQ,CAAC;IACf,uEAAuE;IACvE,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,+EAA+E;IAC/E,QAAQ,CAAC,EAAE,MAAM,CAAC;CAClB;AAED;;;;;;;;;;;;;;GAcG;AACH,qBAAa,KAAK;IACjB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAA2B;IAElD,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAEpB;IAED,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAExB;IAED,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,CAElC;IAED,GAAG,IAAI,SAAS,IAAI,EAAE,CAErB;IAED,IAAI,OAAO,IAAI,OAAO,CAErB;CACD;AAED;;;;;;;;;;;;GAYG;AACH,qBAAa,kBAAkB;IAC9B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAoB;IAC1C,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAgB;IAEzC,YAAY,KAAK,EAAE,SAAS,MAAM,EAAE,EAAE,QAAQ,GAAE,MAAM,GAAG,IAAW,EAGnE;IAED,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED,0FAA0F;IAC1F,EAAE,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAI/B;IAED,mFAAmF;IACnF,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,CAKxC;CACD;AAED,MAAM,WAAW,kBAAkB,CAAC,CAAC,GAAG,OAAO;IAC9C,4CAA4C;IAC5C,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,CAAC,CAAC;IACV,uFAAuF;IACvF,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;;OAGG;IACH,OAAO,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC3C,6DAA6D;IAC7D,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,kEAAkE;IAClE,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,0CAA0C;IAC1C,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,iCAAiC;IACjC,IAAI,CAAC,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,gBAAgB;IAChC,OAAO,EAAE,OAAO,CAAC;IACjB,KAAK,CAAC,EAAE,KAAK,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,cAAc,CAAC,CAAC,GAAG,OAAO;IAC1C,EAAE,EAAE,MAAM,CAAC;IACX,kEAAkE;IAClE,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,gBAAgB,KAAK,OAAO,CAAC;IAC9C,mEAAmE;IACnE,KAAK,CAAC,EAAE,CAAC,SAAS,EAAE,kBAAkB,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,gBAAgB,KAAK,MAAM,CAAC;CAChF;AAED,MAAM,WAAW,iBAAiB,CAAC,CAAC,GAAG,OAAO;IAC7C,SAAS,EAAE,kBAAkB,CAAC,CAAC,CAAC,CAAC;IACjC,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;CACd;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,qBAAa,WAAW,CAAC,CAAC,GAAG,OAAO;IACnC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAA+B;IAEtD,YAAY,OAAO,EAAE;QAAE,MAAM,EAAE,SAAS,cAAc,CAAC,CAAC,CAAC,EAAE,CAAA;KAAE,EAE5D;IAED,gGAAgG;IAChG,MAAM,CAAC,UAAU,EAAE,SAAS,kBAAkB,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,gBAAgB,GAAG,iBAAiB,CAAC,CAAC,CAAC,GAAG,IAAI,CAa3G;CACD;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,SAAS,EAAE,kBAAkB,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,gBAAgB,GAAG,MAAM,CASnG;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAGxE;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,IAAI,GAAG,SAAS,GAAG,MAAM,CAExD"}

package/dist/ai/Heuristics.js

@@ -1,298 +0,0 @@
-/**
- * The named tuning knobs of a heuristic AI - Wesnoth's "aspects" - read by whatever stage is
- * scoring candidates. `mwg` ships no values, because the numbers are game content: a side sets
- * `aggression`, `caution`, `village_value`, `keep_away` and the rest to whatever its own balance
- * wants, and a difficulty level overrides a few of them.
- *
- * Typed readers give a stage a usable number without every caller casting: a missing aspect reads
- * as the fallback the caller passes (`1` for a neutral weight, `0` where an unset aspect should zero the score).
- *
- * @example
- * ```ts
- * import { Aspects } from '@datamoc/mw_games/ai';
- *
- * const aspects = new Aspects({ aggression: 2, keep_away: 3 });
- * console.log(aspects.number('aggression')); // 2
- * console.log(aspects.number('caution')); // 0 - the fallback
- * ```
- */
-export class Aspects {
-    constructor(defaults = {}) {
-        this.values = {};
-        for (const [name, value] of Object.entries(defaults)) {
-            if (value !== undefined)
-                this.values[name] = value;
-        }
-    }
-    has(name) {
-        return this.values[name] !== undefined;
-    }
-    get(name) {
-        return this.values[name];
-    }
-    set(name, value) {
-        this.values[name] = value;
-    }
-    /** a numeric aspect, or `fallback` when it is missing or not a number */
-    number(name, fallback = 0) {
-        const value = this.values[name];
-        if (typeof value === 'number' && Number.isFinite(value))
-            return value;
-        if (typeof value === 'boolean')
-            return value ? 1 : 0;
-        return fallback;
-    }
-    flag(name, fallback = false) {
-        const value = this.values[name];
-        return typeof value === 'boolean' ? value : fallback;
-    }
-    /** a list aspect; a bare string reads as a one-entry list, anything else as empty */
-    list(name) {
-        const value = this.values[name];
-        if (Array.isArray(value))
-            return value;
-        if (typeof value === 'string')
-            return [value];
-        return [];
-    }
-    names() {
-        return Object.keys(this.values);
-    }
-    /** a new store with `overrides` laid over this one, leaving this one untouched */
-    with(overrides) {
-        const next = new Aspects(this.values);
-        for (const [name, value] of Object.entries(overrides)) {
-            if (value !== undefined)
-                next.set(name, value);
-        }
-        return next;
-    }
-    toJSON() {
-        return { ...this.values };
-    }
-    static fromJSON(values) {
-        return new Aspects(values);
-    }
-}
-/**
- * Named difficulty levels, each a set of aspect overrides - Wesnoth's native difficulty ladder,
- * which is really "the same AI with different numbers". A level is applied on top of a base aspect
- * set, so a game writes its normal AI once and a level only lists what it changes.
- *
- * @example
- * ```ts
- * import { Aspects, Difficulty } from '@datamoc/mw_games/ai';
- *
- * const difficulty = new Difficulty(
- *   [{ id: 'hard', aspects: { aggression: 2, keep_away: 3 } }],
- *   { aggression: 1 },
- * );
- * console.log(difficulty.aspectsFor('hard').number('aggression')); // 2
- * ```
- */
-export class Difficulty {
-    constructor(levels = [], base = {}) {
-        this.levels = new Map();
-        this.base = new Aspects(base);
-        for (const level of levels) {
-            if (this.levels.has(level.id))
-                throw new Error(`duplicate difficulty level: ${level.id}`);
-            this.levels.set(level.id, level);
-        }
-    }
-    get ids() {
-        return [...this.levels.keys()];
-    }
-    get(id) {
-        return this.levels.get(id);
-    }
-    /** the base aspects with a level's overrides applied; throws for an unknown level */
-    aspectsFor(id) {
-        const level = this.levels.get(id);
-        if (!level)
-            throw new Error(`unknown difficulty level: ${id}`);
-        return this.base.with(level.aspects ?? {});
-    }
-}
-/**
- * Per-unit goals - "hold this village", "attack that leader" - kept as a small registry for a
- * stage's `weigh` to read. `mwg` does not decide what a goal is worth, the same way it ships no
- * damage formula: the registry answers *what* a unit has been told to do, and a game's weigh
- * decides how much that matters.
- *
- * @example
- * ```ts
- * import { Goals } from '@datamoc/mw_games/ai';
- *
- * const goals = new Goals();
- * goals.set({ unit: 'hero', kind: 'attack', target: 'rat', priority: 3 });
- * console.log(goals.get('hero')?.kind); // 'attack'
- * ```
- */
-export class Goals {
-    constructor() {
-        this.byUnit = new Map();
-    }
-    set(goal) {
-        this.byUnit.set(goal.unit, { ...goal });
-    }
-    clear(unit) {
-        this.byUnit.delete(unit);
-    }
-    get(unit) {
-        return this.byUnit.get(unit);
-    }
-    all() {
-        return [...this.byUnit.values()];
-    }
-    get isEmpty() {
-        return this.byUnit.size === 0;
-    }
-}
-/**
- * The order a side recruits in - Wesnoth's `recruitment_pattern`, e.g. `scout, fighter, archer` -
- * cycled by turn. A side with nothing left to recruit falls back to its `fallback`, and a side
- * with neither recruits nothing.
- *
- * @example
- * ```ts
- * import { RecruitmentPattern } from '@datamoc/mw_games/ai';
- *
- * const pattern = new RecruitmentPattern(['scout', 'fighter'], 'fighter');
- * console.log(pattern.at(0), pattern.at(1), pattern.at(2)); // scout fighter scout
- * ```
- */
-export class RecruitmentPattern {
-    constructor(order, fallback = null) {
-        this.order = order;
-        this.fallback = fallback;
-    }
-    get length() {
-        return this.order.length;
-    }
-    /** the unit type at a position in the cycle, or the fallback when the pattern is empty */
-    at(index) {
-        if (this.order.length === 0)
-            return this.fallback;
-        const wrapped = ((index % this.order.length) + this.order.length) % this.order.length;
-        return this.order[wrapped];
-    }
-    /** the entry after `after` in the cycle, or the first when `after` is not in it */
-    next(after) {
-        if (this.order.length === 0)
-            return this.fallback;
-        if (after === null)
-            return this.order[0];
-        const index = this.order.indexOf(after);
-        return this.at(index < 0 ? 0 : index + 1);
-    }
-}
-/**
- * The candidate-action pipeline at the heart of a Wesnoth-style AI: stages run in order, the first
- * one whose `when` passes scores every candidate with its `weigh`, and the highest score wins (the
- * earlier candidate on a tie, so a decision is stable across equal scores).
- *
- * The default `weigh` is the aspect-weighted sum of each candidate's `factors`, which is what makes
- * the aspects worth having: a game sets `aggression: 2` once and every candidate naming
- * `aggression` is worth twice as much. `keep_away` is honoured through a candidate's `distance`
- * factor. A stage that needs more - goal priorities, terrain, this turn's state - brings its own
- * `weigh`, and `mwg` stays out of the rules.
- *
- * @example
- * ```ts
- * import { Aspects, HeuristicAI } from '@datamoc/mw_games/ai';
- *
- * const ai = new HeuristicAI<{ kind: string }>({ stages: [{ id: 'best' }] });
- * const decision = ai.decide(
- *   [
- *     { id: 'wait', action: { kind: 'wait' }, factors: { caution: 2 } },
- *     { id: 'charge', action: { kind: 'attack' }, factors: { aggression: 3 } },
- *   ],
- *   { aspects: new Aspects({ aggression: 1, caution: 1 }) },
- * );
- * console.log(decision?.candidate.id); // 'charge'
- * ```
- */
-export class HeuristicAI {
-    constructor(options) {
-        this.stages = options.stages;
-    }
-    /** the first stage's best candidate, or `null` when nothing applies or no candidate is given */
-    decide(candidates, context) {
-        if (candidates.length === 0)
-            return null;
-        for (const stage of this.stages) {
-            if (stage.when && !stage.when(context))
-                continue;
-            const weigh = stage.weigh ?? defaultWeigh;
-            let best = null;
-            for (const candidate of candidates) {
-                const score = weigh(candidate, context);
-                if (!best || score > best.score)
-                    best = { candidate, stage: stage.id, score };
-            }
-            return best;
-        }
-        return null;
-    }
-}
-/**
- * The default stage weight: each factor times the aspect of the same name (an unset aspect weighs
- * 1, so a factor on its own is not erased), minus a `keepAwayScore` penalty for a candidate's
- * `distance`.
- *
- * @example
- * ```ts
- * import { Aspects, defaultWeigh } from '@datamoc/mw_games/ai';
- *
- * const score = defaultWeigh(
- *   { id: 'charge', action: {}, factors: { aggression: 3 } },
- *   { aspects: new Aspects({ aggression: 2 }) },
- * );
- * console.log(score); // 6
- * ```
- */
-export function defaultWeigh(candidate, context) {
-    let score = 0;
-    for (const [name, weight] of Object.entries(candidate.factors ?? {})) {
-        if (name === 'distance')
-            continue;
-        score += weight * context.aspects.number(name, 1);
-    }
-    const distance = candidate.factors?.distance;
-    if (distance !== undefined)
-        score += keepAwayScore(distance, context.aspects.number('keep_away', 0));
-    return score;
-}
-/**
- * How much a candidate at `distance` loses for being inside a `keepAway` radius: 0 when there is no
- * radius or the candidate is outside it, otherwise the shortfall as a negative score.
- *
- * @example
- * ```ts
- * import { keepAwayScore } from '@datamoc/mw_games/ai';
- *
- * console.log(keepAwayScore(1, 3)); // -2, two tiles inside the radius
- * console.log(keepAwayScore(5, 3)); // 0, outside it
- * ```
- */
-export function keepAwayScore(distance, keepAway) {
-    if (!(keepAway > 0) || distance >= keepAway)
-        return 0;
-    return -(keepAway - distance);
-}
-/**
- * What a stage's own weigh can add for a goal: its `priority`, or 1 when it has none.
- *
- * @example
- * ```ts
- * import { goalScore } from '@datamoc/mw_games/ai';
- *
- * console.log(goalScore({ unit: 'u1', kind: 'attack', priority: 3 })); // 3
- * console.log(goalScore(undefined)); // 0, no goal at all
- * ```
- */
-export function goalScore(goal) {
-    return goal ? Math.max(0, goal.priority ?? 1) : 0;
-}
-//# sourceMappingURL=Heuristics.js.map

package/dist/ai/Heuristics.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Heuristics.js","sourceRoot":"","sources":["../../src/ai/Heuristics.ts"],"names":[],"mappings":"AAMA;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,OAAO,OAAO;IAGnB,YAAY,QAAQ,GAAiB,EAAE;QAF/B,WAAM,GAAgC,EAAE,CAAC;QAGhD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;YACtD,IAAI,KAAK,KAAK,SAAS;gBAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;QACpD,CAAC;IACF,CAAC;IAED,GAAG,CAAC,IAAY;QACf,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,SAAS,CAAC;IACxC,CAAC;IAED,GAAG,CAAC,IAAY;QACf,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,GAAG,CAAC,IAAY,EAAE,KAAkB;QACnC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;IAC3B,CAAC;IAED,yEAAyE;IACzE,MAAM,CAAC,IAAY,EAAE,QAAQ,GAAG,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QACtE,IAAI,OAAO,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrD,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED,IAAI,CAAC,IAAY,EAAE,QAAQ,GAAG,KAAK;QAClC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAChC,OAAO,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC;IACtD,CAAC;IAED,qFAAqF;IACrF,IAAI,CAAC,IAAY;QAChB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QACvC,IAAI,OAAO,KAAK,KAAK,QAAQ;YAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QAC9C,OAAO,EAAE,CAAC;IACX,CAAC;IAED,KAAK;QACJ,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC;IAED,kFAAkF;IAClF,IAAI,CAAC,SAAuB;QAC3B,MAAM,IAAI,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtC,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;YACvD,IAAI,KAAK,KAAK,SAAS;gBAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED,MAAM;QACL,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IAC3B,CAAC;IAED,MAAM,CAAC,QAAQ,CAAC,MAA6C;QAC5D,OAAO,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IAC5B,CAAC;CACD;AASD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,OAAO,UAAU;IAItB,YAAY,MAAM,GAA+B,EAAE,EAAE,IAAI,GAAiB,EAAE;QAH3D,WAAM,GAAG,IAAI,GAAG,EAA2B,CAAC;QAI5D,IAAI,CAAC,IAAI,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;QAC9B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;YAC1F,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAClC,CAAC;IACF,CAAC;IAED,IAAI,GAAG;QACN,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IAChC,CAAC;IAED,GAAG,CAAC,EAAU;QACb,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,qFAAqF;IACrF,UAAU,CAAC,EAAU;QACpB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK;YAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,EAAE,EAAE,CAAC,CAAC;QAC/D,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;IAC5C,CAAC;CACD;AAaD;;;;;;;;;;;;;;GAcG;AACH,MAAM,OAAO,KAAK;IAAlB;QACkB,WAAM,GAAG,IAAI,GAAG,EAAgB,CAAC;IAqBnD,CAAC;IAnBA,GAAG,CAAC,IAAU;QACb,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;IACzC,CAAC;IAED,KAAK,CAAC,IAAY;QACjB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,GAAG,CAAC,IAAY;QACf,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,GAAG;QACF,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAClC,CAAC;IAED,IAAI,OAAO;QACV,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC;IAC/B,CAAC;CACD;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,OAAO,kBAAkB;IAI9B,YAAY,KAAwB,EAAE,QAAQ,GAAkB,IAAI;QACnE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC1B,CAAC;IAED,IAAI,MAAM;QACT,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED,0FAA0F;IAC1F,EAAE,CAAC,KAAa;QACf,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,QAAQ,CAAC;QAClD,MAAM,OAAO,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QACtF,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC5B,CAAC;IAED,mFAAmF;IACnF,IAAI,CAAC,KAAoB;QACxB,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,QAAQ,CAAC;QAClD,IAAI,KAAK,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACxC,OAAO,IAAI,CAAC,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IAC3C,CAAC;CACD;AA2CD;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,OAAO,WAAW;IAGvB,YAAY,OAAiD;QAC5D,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAC9B,CAAC;IAED,gGAAgG;IAChG,MAAM,CAAC,UAA4C,EAAE,OAAyB;QAC7E,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACzC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC;gBAAE,SAAS;YACjD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,YAAe,CAAC;YAC7C,IAAI,IAAI,GAAgC,IAAI,CAAC;YAC7C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;gBACpC,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;gBACxC,IAAI,CAAC,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK;oBAAE,IAAI,GAAG,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC;YAC/E,CAAC;YACD,OAAO,IAAI,CAAC;QACb,CAAC;QACD,OAAO,IAAI,CAAC;IACb,CAAC;CACD;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,YAAY,CAAI,SAAgC,EAAE,OAAyB;IAC1F,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,CAAC;QACtE,IAAI,IAAI,KAAK,UAAU;YAAE,SAAS;QAClC,KAAK,IAAI,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACnD,CAAC;IACD,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,EAAE,QAAQ,CAAC;IAC7C,IAAI,QAAQ,KAAK,SAAS;QAAE,KAAK,IAAI,aAAa,CAAC,QAAQ,EAAE,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;IACrG,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,aAAa,CAAC,QAAgB,EAAE,QAAgB;IAC/D,IAAI,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,QAAQ,IAAI,QAAQ;QAAE,OAAO,CAAC,CAAC;IACtD,OAAO,CAAC,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,SAAS,CAAC,IAAsB;IAC/C,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACnD,CAAC"}

package/dist/ai/Neural.d.ts

@@ -1,65 +0,0 @@
-import type { AIAction, AIBehavior, AIValue } from './index.ts';
-/** Flat row-major weights: output neuron first, then input feature. */
-export interface DenseLayer {
-    inputSize: number;
-    outputSize: number;
-    weights: readonly number[];
-    biases: readonly number[];
-}
-/** Game-owned, redistributable weights and an explicit observation-schema version. */
-export interface NeuralModel {
-    version: 1;
-    observationVersion: string;
-    layers: readonly DenseLayer[];
-}
-export interface NeuralObservation {
-    input: readonly number[];
-    /** Omitted means all actions are legal; false excludes an action. */
-    mask?: readonly boolean[];
-}
-/**
- * The self-contained evaluator shared by the local policy and serialized worker tasks.
- * Limits apply before copying weights: at most 32 layers, 4096 neurons per layer and
- * one million weights plus biases. Activations reuse buffers; returned outputs are owned
- * by the caller. Hidden layers use ReLU, output scores remain linear.
- */
-export declare function createNeuralEvaluator(model: NeuralModel): {
-    predict(input: readonly number[], output?: Float64Array): Float64Array;
-    select(observation: NeuralObservation, random?: () => number): number | null;
-};
-/**
- * A small shared dense policy, usable inside existing JavaScriptAI behaviours.
- * Model weights are copied on construction. Supply a seeded random callback to sample
- * softmax scores; omit it for the first highest-scoring legal action. All-masked is idle.
- * Async batches return detached results, never mutate game state; callers must discard
- * results whose scene or position changed while awaiting them.
- *
- * @example
- * ```ts
- * import { NeuralPolicy, JavaScriptAI } from '@datamoc/mw_games/ai';
- * const policy = new NeuralPolicy({ version: 1, observationVersion: 'v1', layers: [
- *   { inputSize: 1, outputSize: 2, weights: [-1, 1], biases: [0, 0] },
- * ] });
- * console.log(policy.selectAction({ input: [2] })); // 1
- * const ai = new JavaScriptAI({ seed: 7 });
- * ai.register({ id: 'npc', behaviors: [policy.behavior('neural',
- *   [{ type: 'left' }, { type: 'right' }], () => ({ input: [2] }))] });
- * console.log(ai.decide('npc', { perception: null }).action?.type); // right
- * const scores = await policy.predictBatchAsync([[2], [-2]]);
- * ```
- */
-export declare class NeuralPolicy {
-    private readonly model;
-    private readonly evaluator;
-    constructor(model: NeuralModel);
-    predict(input: readonly number[], output?: Float64Array): Float64Array;
-    selectAction(observation: NeuralObservation, random?: () => number): number | null;
-    exportModel(): NeuralModel;
-    behavior(id: string, actions: readonly AIAction[], observe: (perception: AIValue) => NeuralObservation, sample?: boolean): AIBehavior;
-    /** One cancellable worker batch: at most 65536 observations and one million input or output values. */
-    predictBatchAsync(inputs: readonly (readonly number[])[], options?: {
-        signal?: AbortSignal;
-        timeout?: number;
-    }): Promise<Float64Array[]>;
-}
-//# sourceMappingURL=Neural.d.ts.map

package/dist/ai/Neural.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Neural.d.ts","sourceRoot":"","sources":["../../src/ai/Neural.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAEhE,uEAAuE;AACvE,MAAM,WAAW,UAAU;IAC1B,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3B,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;CAC1B;AAED,sFAAsF;AACtF,MAAM,WAAW,WAAW;IAC3B,OAAO,EAAE,CAAC,CAAC;IACX,kBAAkB,EAAE,MAAM,CAAC;IAC3B,MAAM,EAAE,SAAS,UAAU,EAAE,CAAC;CAC9B;AAED,MAAM,WAAW,iBAAiB;IACjC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IACzB,qEAAqE;IACrE,IAAI,CAAC,EAAE,SAAS,OAAO,EAAE,CAAC;CAC1B;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,WAAW,GAAG;IAC1D,OAAO,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,EAAE,MAAM,CAAC,EAAE,YAAY,GAAG,YAAY,CAAC;IACvE,MAAM,CAAC,WAAW,EAAE,iBAAiB,EAAE,MAAM,CAAC,EAAE,MAAM,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;CAC7E,CA2FA;AASD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,qBAAa,YAAY;IACxB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAc;IACpC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAA2C;IAErE,YAAY,KAAK,EAAE,WAAW,EAG7B;IAED,OAAO,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,EAAE,MAAM,CAAC,EAAE,YAAY,GAAG,YAAY,CAErE;IAED,YAAY,CAAC,WAAW,EAAE,iBAAiB,EAAE,MAAM,CAAC,EAAE,MAAM,MAAM,GAAG,MAAM,GAAG,IAAI,CAEjF;IAED,WAAW,IAAI,WAAW,CAEzB;IAED,QAAQ,CACP,EAAE,EAAE,MAAM,EACV,OAAO,EAAE,SAAS,QAAQ,EAAE,EAC5B,OAAO,EAAE,CAAC,UAAU,EAAE,OAAO,KAAK,iBAAiB,EACnD,MAAM,UAAQ,GACZ,UAAU,CAYZ;IAED,uGAAuG;IACvG,iBAAiB,CAChB,MAAM,EAAE,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,EACtC,OAAO,GAAE;QAAE,MAAM,CAAC,EAAE,WAAW,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAA;KAAO,GACtD,OAAO,CAAC,YAAY,EAAE,CAAC,CASzB;CACD"}