@v12-engine/engine 0.1.0 → 0.4.0

package/dist/ai/view.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"view.js","names":[],"sources":["../../src/ai/view.ts"],"sourcesContent":["import { inShape } from '#engine/areas'\nimport { builtSoFar } from '#engine/systems/construction'\nimport type { Component } from '#engine/components'\nimport type { ResourceId, UnitTypeDef } from '#engine/defs'\nimport type { PlayerId } from '#engine/entity'\nimport type { EventKey } from '#engine/events'\nimport type { Lane } from '#engine/lanes'\nimport type { MapRegion } from '#engine/map'\nimport { distSq, type Vec2 } from '#engine/math'\nimport type { Message } from '#engine/messages'\nimport type { ObjectiveState } from '#engine/objectives'\nimport type { Registry } from '#engine/registry'\nimport type {\n\tCampInfo,\n\tEntityState,\n\tGameSession,\n\tGroundItemState,\n\tHeroSummary,\n\tMineInfo,\n\tPlayerState,\n\tSessionEvent,\n\tSnapshot\n} from '#engine/session/protocol'\nimport { type AiRole, findRoles, reachableTypes, type Roles, type RolesFinder } from './roles'\nimport { Strength, type StrengthFormula } from './strength'\nimport { ThreatMap } from './threat'\nimport { BASE_REACH, CELL } from './reach'\n\n/*\n * The view: a computer player's reading of its snapshot (AI plan, A2). A snapshot is plain data, one flat list of\n * entities (`Snapshot.entities`), and every question a brain asks of it (\"my idle workers\", \"enemies near home\", \"the\n * nearest mine\") would be a walk over the whole list; the old melee player walked it dozens of times a think. The view\n * walks it once, as the think begins, and sorts what it finds: by owner and relation (`mine`, `allies`, `enemies`,\n * `creeps`, `neutral`, `resources`), by id (`byId`), and by place (a coarse grid of cells over the map, which answers\n * \"what is near here\" from a few cells instead of everything). What it gives back are `UnitSet`s: arrays of entity\n * states with the questions as methods (`idle()`, `withRole('worker')`, `near(home, 20)`), each giving a set again, so\n * that a goal's author writes `ai.view.enemies.near(home, 20).fighters()` and reads what they meant.\n *\n * The view is of one think: made from the snapshot as the think begins, thrown away with it. Entities move, so the\n * grid is never kept between thinks, and neither is the threat map (`threat`, made when first asked). What is kept is\n * what costs and does not change: the roles of the game's unit types (`roles.ts`), found once and kept while the\n * game's definitions stand, and what the types' numbers come to (`strength`, `strength.ts`).\n *\n * Nothing here takes the world itself (a test asserts it): the view reads the session's snapshot, cut to the player's\n * fog, and the map's facts everyone knows (regions, mines, camps, the ground for `canPlace` and `findPath`)\n */\n\n/** A set this small is scanned for what is near rather than asked of the grid: the grid pays for itself only on big sets */\nconst SCAN = 24\n\n/**\n * A set of entities as the view gives them, in the snapshot's order, with the questions a brain asks as methods, each\n * giving a set again, so that they chain: `ai.view.mine.withRole('worker').idle()`, `ai.view.enemies.near(home,\n * 20).fighters()`. It reads as an array (`length`, `for..of`, `map`, `filter`, `find`, `some`, `every`, `forEach`,\n * `first`, `at`; `items` is the plain array) but is not one: `map` and `filter` give plain arrays, `where` gives a set.\n * (Not an `Array` subclass on purpose: the engines run `filter` and `find` on one several times slower, species\n * lookup, and a think asks dozens.) A set is of one think: it reads the view it came from\n *\n * @beta\n */\nexport class UnitSet implements Iterable<EntityState> {\n\t/** What this set remembers beside what is in sight (`known`): the structures seen before, for the view's own sets */\n\tprivate readonly remembered: EntityState[] | undefined\n\t/** The answers to the questions that are asked again and again, by their name */\n\tprivate memo: Map<string, UnitSet> | undefined\n\tprivate idSet: Set<number> | undefined\n\tprivate strengthSum: number | undefined\n\n\tconstructor(\n\t\t/** The view the set reads: the definitions, the roles, the grid */\n\t\treadonly view: AiView,\n\t\t/** The entities, as a plain array, in the snapshot's order */\n\t\treadonly items: readonly EntityState[] = [],\n\t\tremembered?: EntityState[]\n\t) {\n\t\tthis.remembered = remembered\n\t}\n\n\t/** How many */\n\tget length(): number {\n\t\treturn this.items.length\n\t}\n\n\t/** Iterates the set's entities in order */\n\t[Symbol.iterator](): Iterator<EntityState> {\n\t\treturn this.items[Symbol.iterator]()\n\t}\n\n\t/** The first of them: none in an empty set */\n\tfirst(): EntityState | undefined {\n\t\treturn this.items[0]\n\t}\n\n\t/** Some of them, as an array's `slice` takes them: as a set */\n\tslice(start?: number, end?: number): UnitSet {\n\t\treturn this.make(this.items.slice(start, end))\n\t}\n\n\t/** The one at an index, from the end for a negative one */\n\tat(index: number): EntityState | undefined {\n\t\treturn this.items.at(index)\n\t}\n\n\t/** As an array does: a plain array */\n\tmap<T>(fn: (entity: EntityState, index: number) => T): T[] {\n\t\treturn this.items.map(fn)\n\t}\n\n\t/** As an array does: a plain array. `where` gives a set */\n\tfilter(fn: (entity: EntityState, index: number) => unknown): EntityState[] {\n\t\treturn this.items.filter(fn)\n\t}\n\n\t/** The first entity `fn` is true for, or nothing; `fn` is given the entity and its index */\n\tfind(fn: (entity: EntityState, index: number) => unknown): EntityState | undefined {\n\t\treturn this.items.find(fn)\n\t}\n\n\t/** Whether `fn` is true for any entity of the set */\n\tsome(fn: (entity: EntityState, index: number) => unknown): boolean {\n\t\treturn this.items.some(fn)\n\t}\n\n\t/** Whether `fn` is true for every entity of the set */\n\tevery(fn: (entity: EntityState, index: number) => unknown): boolean {\n\t\treturn this.items.every(fn)\n\t}\n\n\t/** Calls `fn` with each entity and its index, in order */\n\tforEach(fn: (entity: EntityState, index: number) => void): void {\n\t\tthis.items.forEach(fn)\n\t}\n\n\t/** A set of these, of the same view */\n\tprivate make(items: readonly EntityState[]): UnitSet {\n\t\treturn new UnitSet(this.view, items)\n\t}\n\n\t/** The answer to a question asked by name, worked out once */\n\tprivate cached(key: string, answer: () => UnitSet): UnitSet {\n\t\tthis.memo ??= new Map()\n\t\tlet found = this.memo.get(key)\n\t\tif (!found) this.memo.set(key, (found = answer()))\n\t\treturn found\n\t}\n\n\t/** Those that satisfy a predicate, as a set */\n\twhere(predicate: (entity: EntityState, def: UnitTypeDef) => boolean): UnitSet {\n\t\tconst { view } = this\n\t\treturn this.make(this.items.filter((entity) => predicate(entity, view.def(entity))))\n\t}\n\n\t/** Those of a unit type, or that count as it (`UnitTypeDef.provides`: a keep is a town hall too) */\n\tofType(type: string): UnitSet {\n\t\treturn this.cached(`type:${type}`, () => this.where((entity, def) => entity.type === type || !!def.provides?.includes(type)))\n\t}\n\n\t/** Those whose type has a role (`AiRole`: `'worker'`, `'hall'`, a game's own word) */\n\twithRole(role: AiRole): UnitSet {\n\t\treturn this.cached(`role:${role}`, () => {\n\t\t\tconst { roles } = this.view\n\t\t\treturn this.make(this.items.filter((entity) => roles.has(entity.type, role)))\n\t\t})\n\t}\n\n\t/** Those whose type has a tag: the kit's (`ranged`, `melee`, `hitsAir`) or the game's (`UnitTypeDef.ai.tags`) */\n\twithTag(tag: string): UnitSet {\n\t\treturn this.cached(`tag:${tag}`, () => {\n\t\t\tconst { roles } = this.view\n\t\t\treturn this.make(this.items.filter((entity) => roles.hasTag(entity.type, tag)))\n\t\t})\n\t}\n\n\t/** Those that fight: soldiers and heroes */\n\tfighters(): UnitSet {\n\t\treturn this.cached('fighters', () => {\n\t\t\tconst { roles } = this.view\n\t\t\treturn this.make(this.items.filter((entity) => roles.has(entity.type, 'soldier') || roles.has(entity.type, 'hero')))\n\t\t})\n\t}\n\n\t/** Those that gather and build (role `worker`) */\n\tworkers(): UnitSet {\n\t\treturn this.withRole('worker')\n\t}\n\n\t/** The heroes among them */\n\theroes(): UnitSet {\n\t\treturn this.withRole('hero')\n\t}\n\n\t/** The buildings among them, under construction too (`finished` leaves those out) */\n\tbuildings(): UnitSet {\n\t\treturn this.cached('buildings', () => this.where((_, def) => def.kind === 'building'))\n\t}\n\n\t/** The units among them: what moves, buildings and resources left out */\n\tunits(): UnitSet {\n\t\treturn this.cached('units', () => this.where((_, def) => def.kind === 'unit'))\n\t}\n\n\t/** Those that stand finished: not under construction (a building turning into another type stands) */\n\tfinished(): UnitSet {\n\t\treturn this.cached('finished', () => this.make(this.items.filter((entity) => builtSoFar(entity) === undefined)))\n\t}\n\n\t/** Those of mine with nothing to do: no order, and not inside something (a worker in a mine). Only one's own say what they do */\n\tidle(): UnitSet {\n\t\treturn this.cached('idle', () => this.make(this.items.filter((entity) => !!entity.own && !entity.own.order && !entity.own.hidden)))\n\t}\n\n\t/** Those in sight now: a structure seen before and out of sight is not (`EntityState.visible`) */\n\tvisible(): UnitSet {\n\t\treturn this.cached('visible', () => this.make(this.items.filter((entity) => entity.visible)))\n\t}\n\n\t/** Those with health left */\n\talive(): UnitSet {\n\t\treturn this.cached('alive', () => this.make(this.items.filter((entity) => entity.health > 0)))\n\t}\n\n\t/** Deposits of a resource with something left in them (a gold mine, a tree): for the view's `resources` */\n\tofResource(kind: ResourceId): UnitSet {\n\t\treturn this.cached(`resource:${kind}`, () => this.where((entity, def) => (entity.resource ?? 0) > 0 && def.resource?.id === kind))\n\t}\n\n\t/** Those of a player */\n\tofOwner(player: PlayerId): UnitSet {\n\t\treturn this.cached(`owner:${player}`, () => this.make(this.items.filter((entity) => entity.owner === player)))\n\t}\n\n\t/**\n\t * Those within a distance of a point, in the snapshot's order. A big set is asked of the view's grid, a small one is\n\t * scanned: the answer is the same\n\t */\n\tnear(point: Vec2, radius: number): UnitSet {\n\t\tconst reach = radius * radius\n\t\tif (this.items.length <= SCAN) return this.make(this.items.filter((entity) => distSq(entity, point) <= reach))\n\t\tconst ids = this.ids()\n\t\treturn this.make(this.view.gridNear(point, radius).filter((entity) => ids.has(entity.id) && distSq(entity, point) <= reach))\n\t}\n\n\t/** The one nearest a point: none in an empty set. The first of two as near */\n\tnearest(point: Vec2): EntityState | undefined {\n\t\tlet best: EntityState | undefined\n\t\tlet bestDistance = Infinity\n\t\tfor (const entity of this.items) {\n\t\t\tconst d = distSq(entity, point)\n\t\t\tif (d < bestDistance) {\n\t\t\t\tbestDistance = d\n\t\t\t\tbest = entity\n\t\t\t}\n\t\t}\n\t\treturn best\n\t}\n\n\t/** The middle of them: none for an empty set */\n\tcentre(): Vec2 | undefined {\n\t\tconst { items } = this\n\t\tif (!items.length) return undefined\n\t\tlet x = 0\n\t\tlet z = 0\n\t\tfor (const entity of items) {\n\t\t\tx += entity.x\n\t\t\tz += entity.z\n\t\t}\n\t\treturn { x: x / items.length, z: z / items.length }\n\t}\n\n\t/**\n\t * How strong they are together: the strength of each (`Strength.of`: by its stats and the health it has left),\n\t * summed. 0 for what does not fight. Against someone in particular, ask `view.strength.odds(these, those)`\n\t */\n\tstrength(): number {\n\t\treturn (this.strengthSum ??= this.view.strength.sum(this.items))\n\t}\n\n\t/** Their ids, as a set: for \"is it one of these\" */\n\tids(): ReadonlySet<number> {\n\t\treturn (this.idSet ??= new Set(this.items.map((entity) => entity.id)))\n\t}\n\n\t/** Whether an entity, by id, is one of these */\n\thas(id: number): boolean {\n\t\treturn this.ids().has(id)\n\t}\n\n\t/** These and another set's, together, in the snapshot's order, each once */\n\tand(other: UnitSet): UnitSet {\n\t\tconst { view } = this\n\t\tconst all = [...this.items, ...other.items.filter((entity) => !this.has(entity.id))]\n\t\tall.sort((a, b) => view.indexOf(a) - view.indexOf(b))\n\t\treturn this.make(all)\n\t}\n\n\t/**\n\t * These and what is remembered of them beside what is in sight: for `view.enemies`, the enemy structures seen before\n\t * and out of sight now (`visible: false`), which may be gone. Ask it of the view's set before narrowing it\n\t * (`view.enemies.known().buildings()`): a narrowed set remembers nothing more\n\t */\n\tknown(): UnitSet {\n\t\tif (!this.remembered?.length) return this\n\t\treturn this.cached('known', () => this.and(this.make(this.remembered!)))\n\t}\n}\n\n/**\n * The player a brain plays, as its picture of the game shows them: what the snapshot has of one's own player\n * (`PlayerState.own`), beside who they are. Mutable for the think: a module that sends a `train` bumps `supplyUsed`\n * itself, so that the next module does not queue past the cap before the command lands\n *\n * @beta\n */\nexport interface Me {\n\t/** The player's id */\n\tid: PlayerId\n\t/** The player's name */\n\tname: string\n\t/** The player's team number */\n\tteam: number\n\t/** The race they play (`raceOf`): left out in a game without races */\n\trace?: string\n\t/** Whether the player is out of the game */\n\tdefeated: boolean\n\t/** What they have of each resource, by resource id */\n\tresources: Record<ResourceId, number>\n\t/** How much supply the player's units and queues use */\n\tsupplyUsed: number\n\t/** How much supply the player may use at most */\n\tsupplyCap: number\n\t/** The game's other pools of supply, by name (`RuleSettings.supply.pools`) */\n\tsupplies?: Record<string, { used: number; cap: number }>\n\t/** What the size of the army costs in income */\n\tupkeep: { tier: number; name: string; income: number }\n\t/** The levels of the upgrades the player has, by upgrade id */\n\tupgrades: Record<string, number>\n\t/** The ids of the upgrades being researched */\n\tresearching: string[]\n\t/** Types of the finished buildings the player has, with what those count as */\n\ttech: string[]\n\t/** The player's heroes, each in short */\n\theroes: HeroSummary[]\n\t/** What the player is set to do, in a mission. Empty in a game without objectives */\n\tobjectives: ObjectiveState[]\n\t/** What the game's `requirement` hook decided, where it differs from what the requirements say (`PlayerState.own.unlocks`) */\n\tunlocks?: Record<string, Message | null>\n\t/** What the game's `available` hook decided, where it differs from what their race says (`PlayerState.own.availability`) */\n\tavailability?: Record<string, boolean>\n\t/**\n\t * What the player gathers of each resource a minute, of late, as the brain's knowledge works it out\n\t * (`Knowledge.own.income`): set by the brain after the view is made; left out for a view of no brain's\n\t */\n\tincome?: Record<ResourceId, number>\n\t/**\n\t * What is free to spend this think, by resource: the resources less what is promised and held, less what the think\n\t * spent so far (the brain's purse, `ai.purse`). Set by the brain after the view is made; left out for a view of no brain's\n\t */\n\tpurse?: Readonly<Record<ResourceId, number>>\n}\n\n/**\n * One of a player's bases, as the view clusters its buildings: around each building that takes deposits (a hall, what\n * stands on a mine), or around any building where none does\n *\n * @beta\n */\nexport interface Base {\n\t/** Where it is: the building it is around */\n\tat: Vec2\n\t/** The building it is around: a hall where there is one */\n\tcentre: EntityState\n\t/** Its buildings, the centre among them */\n\tbuildings: UnitSet\n}\n\n/** The coarse grid of the view: every entity in the cell its place falls in, for what is near a point */\nclass Grid {\n\tprivate readonly cells: (EntityState[] | undefined)[]\n\tprivate readonly cols: number\n\tprivate readonly rows: number\n\n\tconstructor(\n\t\twidth: number,\n\t\tdepth: number,\n\t\t/** Where each entity comes in the snapshot, by id: what `near` gives its answer in the order of */\n\t\tprivate readonly index: ReadonlyMap<number, number>\n\t) {\n\t\tthis.cols = Math.max(1, Math.ceil(width / CELL))\n\t\tthis.rows = Math.max(1, Math.ceil(depth / CELL))\n\t\tthis.cells = new Array(this.cols * this.rows)\n\t}\n\n\tprivate col(x: number): number {\n\t\treturn Math.min(this.cols - 1, Math.max(0, Math.floor(x / CELL)))\n\t}\n\n\tprivate row(z: number): number {\n\t\treturn Math.min(this.rows - 1, Math.max(0, Math.floor(z / CELL)))\n\t}\n\n\tadd(entity: EntityState): void {\n\t\tconst index = this.row(entity.z) * this.cols + this.col(entity.x)\n\t\t;(this.cells[index] ??= []).push(entity)\n\t}\n\n\t/** Everything in the cells a circle touches, in the snapshot's order: more than what is within the circle */\n\tnear(point: Vec2, radius: number): EntityState[] {\n\t\tconst found: EntityState[] = []\n\t\tconst c0 = this.col(point.x - radius)\n\t\tconst c1 = this.col(point.x + radius)\n\t\tconst r0 = this.row(point.z - radius)\n\t\tconst r1 = this.row(point.z + radius)\n\t\tfor (let r = r0; r <= r1; r++) {\n\t\t\tfor (let c = c0; c <= c1; c++) {\n\t\t\t\tconst cell = this.cells[r * this.cols + c]\n\t\t\t\tif (cell) for (const entity of cell) found.push(entity)\n\t\t\t}\n\t\t}\n\t\t// cells came row by row: back into the snapshot's order, so that the answer is the same as a scan's\n\t\tconst { index } = this\n\t\tfound.sort((a, b) => index.get(a.id)! - index.get(b.id)!)\n\t\treturn found\n\t}\n}\n\n/**\n * The events of a think, by kind (`AiView.events`): what happened in the tick of the picture that cannot be read from\n * the state (deaths, damage, pings, the game's own)\n *\n * @beta\n */\nexport class ViewEvents {\n\tprivate byType: Map<string, SessionEvent[]> | undefined\n\n\tconstructor(\n\t\t/** Every event of the tick, in order */\n\t\treadonly all: readonly SessionEvent[]\n\t) {}\n\n\t/** The events of one kind, typed: `events.of('death')`, `events.of('ping')` */\n\tof<T extends SessionEvent['type']>(type: T): Extract<SessionEvent, { type: T }>[] {\n\t\tif (!this.byType) {\n\t\t\tthis.byType = new Map()\n\t\t\tfor (const event of this.all) {\n\t\t\t\tlet list = this.byType.get(event.type)\n\t\t\t\tif (!list) this.byType.set(event.type, (list = []))\n\t\t\t\tlist.push(event)\n\t\t\t}\n\t\t}\n\t\treturn (this.byType.get(type) ?? []) as Extract<SessionEvent, { type: T }>[]\n\t}\n\n\t/** What an event of the game's own said this tick (`defineEvent`, replicated to this player), each time it was emitted */\n\tgame<T>(key: EventKey<T>): T[] {\n\t\treturn this.of('game')\n\t\t\t.filter((event) => event.event === key.id)\n\t\t\t.map((event) => event.payload as T)\n\t}\n}\n\n/**\n * What the view is handed beside the snapshot: the last think's view, whose roles it keeps where the game's\n * definitions stand, and a game's own way of finding the roles (`AiOptions.roles`)\n *\n * @beta\n */\nexport interface ViewOptions {\n\t/** The view of the think before: what cost and did not change is kept from it (the roles, the player's reach) */\n\tbefore?: AiView\n\t/** A game's own say on what unit types are for, in place of the kit's inference (`AiOptions.roles`) */\n\troles?: RolesFinder\n\t/** A game's own formula for how strong a unit is, in place of the kit's (`AiOptions.strength`, `BrainDef.strength`) */\n\tstrength?: StrengthFormula\n}\n\n/**\n * A computer player's reading of its picture of the game (`Brain.view`): the snapshot of its seat, indexed once a\n * think and queried as sets (`UnitSet`): `mine`, `allies`, `enemies` (what is in sight now; `enemies.known()` adds\n * the structures remembered), `hostile` (enemies and creeps), `creeps`, `neutral`, `resources`, `all`; the player's\n * own state (`me`); what unit types are for (`roles`, `typesOf`); where things are (`near`, `home`, `bases`, `mines`,\n * `camps`, `regions`); how strong things are (`strength`: `odds`, `matchup`, `counterFor`) and where the strength\n * is (`threat`, the map made when first asked); what the game tells this player (`report`, `component`,\n * `events.game`); and the map's facts (`canPlace`, `findPath`, `cellAt`). Made from the snapshot as the think begins; a set of\n * it is good for the think\n *\n * @beta\n */\nexport class AiView {\n\t/** The game's definitions, as the seat has them */\n\treadonly registry: Registry\n\t/** The player it reads for */\n\treadonly playerId: PlayerId\n\t/** Every entity the player knows of, in the snapshot's order: in sight, and the structures remembered */\n\treadonly all: UnitSet\n\t/** The player's own units and buildings */\n\treadonly mine: UnitSet\n\t/** The allies' units and buildings (one's own left out) */\n\treadonly allies: UnitSet\n\t/** The enemies' units and buildings in sight now, creeps left out. `enemies.known()` adds their structures seen before */\n\treadonly enemies: UnitSet\n\t/** Whatever attacks the player and is in sight: enemies and creeps */\n\treadonly hostile: UnitSet\n\t/** The creeps in sight: hostile to everyone, no one's rival */\n\treadonly creeps: UnitSet\n\t/** What is nobody's and not a resource, in sight: a shop, a neutral building. `neutral.known()` adds those seen before */\n\treadonly neutral: UnitSet\n\t/** The deposits the player knows of: mines and trees in sight, and those seen before (`ofResource(kind)` for one kind) */\n\treadonly resources: UnitSet\n\t/** Every player, as the snapshot has them */\n\treadonly players: readonly PlayerState[]\n\t/** The player a brain plays: resources, supply, tech, heroes, objectives. Mutable for the think */\n\treadonly me: Me\n\t/** What happened in the tick of the picture, by kind */\n\treadonly events: ViewEvents\n\t/** What unit types are for, by the game's definitions: found once, kept while they stand */\n\treadonly roles: Roles\n\t/** The unit types the player has or can come to make: what the roles are narrowed to for it (`typesOf`) */\n\treadonly reachable: ReadonlySet<string>\n\t/**\n\t * How strong things are: a unit, a group, one force against another (`odds`), what answers what (`counterFor`). The\n\t * kit's formula unless the brain was given one; what a type's numbers come to is kept between thinks\n\t */\n\treadonly strength: Strength\n\tprivate threatMap: ThreatMap | undefined\n\tprivate readonly grid: Grid\n\tprivate readonly byIdMap = new Map<number, EntityState>()\n\tprivate readonly indexById = new Map<number, number>()\n\tprivate readonly playerById = new Map<PlayerId, PlayerState>()\n\tprivate readonly namesMap = new Map<string, EntityState>()\n\tprivate readonly typesByRole: Map<string, readonly UnitTypeDef[]>\n\t/** The race the view's reach was found for: a player given another race finds it anew */\n\tprivate readonly race: string | undefined\n\tprivate basesFound: Base[] | undefined\n\tprivate lanesFound: readonly Lane[] | undefined\n\n\tconstructor(\n\t\t/** The picture it reads: the snapshot of the seat, plain data, the only input a brain has */\n\t\treadonly snapshot: Snapshot,\n\t\t/** The seat, for the map's facts: the ground, the regions, the mines, the camps */\n\t\treadonly session: GameSession,\n\t\toptions: ViewOptions = {}\n\t) {\n\t\tconst { registry, playerId, terrain } = session\n\t\tthis.registry = registry\n\t\tthis.playerId = playerId\n\t\tthis.players = snapshot.players\n\t\tfor (const player of snapshot.players) this.playerById.set(player.id, player)\n\t\tconst self = this.playerById.get(playerId)\n\t\tthis.me = meOf(self, playerId)\n\t\tthis.events = new ViewEvents(snapshot.events)\n\t\tthis.grid = new Grid(terrain.width, terrain.depth, this.indexById)\n\n\t\t// the one pass over the picture: every entity to its sets, its cell, its index, its name\n\t\tconst mine: EntityState[] = []\n\t\tconst allies: EntityState[] = []\n\t\tconst enemies: EntityState[] = []\n\t\tconst enemiesRemembered: EntityState[] = []\n\t\tconst hostile: EntityState[] = []\n\t\tconst hostileRemembered: EntityState[] = []\n\t\tconst creeps: EntityState[] = []\n\t\tconst creepsRemembered: EntityState[] = []\n\t\tconst neutral: EntityState[] = []\n\t\tconst neutralRemembered: EntityState[] = []\n\t\tconst resources: EntityState[] = []\n\t\tconst ownedTypes = new Set<string>()\n\t\tsnapshot.entities.forEach((entity, index) => {\n\t\t\tthis.byIdMap.set(entity.id, entity)\n\t\t\tthis.indexById.set(entity.id, index)\n\t\t\tthis.grid.add(entity)\n\t\t\tif (entity.name !== undefined) this.namesMap.set(entity.name, entity)\n\t\t\tif (entity.owner === playerId) {\n\t\t\t\tmine.push(entity)\n\t\t\t\townedTypes.add(entity.type)\n\t\t\t\treturn\n\t\t\t}\n\t\t\tif (registry.units.has(entity.type) && registry.unit(entity.type).kind === 'resource') {\n\t\t\t\tresources.push(entity)\n\t\t\t\treturn\n\t\t\t}\n\t\t\tconst owner = this.playerById.get(entity.owner)\n\t\t\tif (!owner) return\n\t\t\t// creeps are hostile to everyone and no one's rival: with the enemies in `hostile`, apart in `creeps`; a creep\n\t\t\t// made friendly (`setRelation`) is in `creeps` alone\n\t\t\tif (owner.creeps) (entity.visible ? creeps : creepsRemembered).push(entity)\n\t\t\tswitch (owner.relation) {\n\t\t\t\tcase 'ally':\n\t\t\t\t\tif (!owner.creeps) allies.push(entity)\n\t\t\t\t\tbreak\n\t\t\t\tcase 'enemy':\n\t\t\t\t\t;(entity.visible ? hostile : hostileRemembered).push(entity)\n\t\t\t\t\tif (!owner.creeps) (entity.visible ? enemies : enemiesRemembered).push(entity)\n\t\t\t\t\tbreak\n\t\t\t\tdefault:\n\t\t\t\t\tif (!owner.creeps) (entity.visible ? neutral : neutralRemembered).push(entity)\n\t\t\t}\n\t\t})\n\t\tthis.all = new UnitSet(this, snapshot.entities)\n\t\tthis.mine = new UnitSet(this, mine)\n\t\tthis.allies = new UnitSet(this, allies)\n\t\tthis.enemies = new UnitSet(this, enemies, enemiesRemembered)\n\t\tthis.hostile = new UnitSet(this, hostile, hostileRemembered)\n\t\tthis.creeps = new UnitSet(this, creeps, creepsRemembered)\n\t\tthis.neutral = new UnitSet(this, neutral, neutralRemembered)\n\t\tthis.resources = new UnitSet(this, resources)\n\n\t\t// what costs and does not change between thinks is kept from the view before: the roles of the game's types,\n\t\t// and the player's reach, found again when it has a type it could not make (given one, a race of two) or when\n\t\t// what the game lets it make changed (a type a mission unlocks)\n\t\tconst before = options.before\n\t\tconst player = { id: playerId, race: self?.race, availability: self?.own?.availability }\n\t\tthis.race = self?.race\n\t\tthis.roles = before?.roles ?? findRoles(registry, player, options.roles)\n\t\tlet kept = before && before.race === this.race && sameAvailability(before.me.availability, player.availability) ? before : undefined\n\t\tif (kept) {\n\t\t\tconst reach = kept.reachable\n\t\t\tfor (const type of ownedTypes) if (!reach.has(type)) kept = undefined\n\t\t}\n\t\tthis.reachable = kept?.reachable ?? reachableTypes(registry, player, ownedTypes)\n\t\tthis.typesByRole = kept?.typesByRole ?? new Map()\n\t\t// what the types' numbers come to is kept too, as long as the formula is the one it was found by\n\t\tconst formula = options.strength ?? before?.strength.formula\n\t\tthis.strength = before && before.strength.formula === formula ? before.strength : new Strength(registry, formula)\n\t\tthis.strength.view = this\n\t}\n\n\t/**\n\t * Where the strength is: an influence map over the picture, the friendly and the enemy strength that reaches each\n\t * cell of a coarse grid, by layer (`threat.at(point)`, `around`, `hot`). Made when first asked, once a think\n\t */\n\tget threat(): ThreatMap {\n\t\treturn (this.threatMap ??= new ThreatMap(this))\n\t}\n\n\t/** @internal What is in the cells of the grid a circle touches, in the snapshot's order: for a set's `near` */\n\tgridNear(point: Vec2, radius: number): EntityState[] {\n\t\treturn this.grid.near(point, radius)\n\t}\n\n\t/** The tick of the picture */\n\tget tick(): number {\n\t\treturn this.snapshot.tick\n\t}\n\n\t/** Seconds into the game, as of the picture */\n\tget time(): number {\n\t\treturn this.snapshot.tick / this.session.tickRate\n\t}\n\n\t/** Items lying on the ground where the player sees it */\n\tget items(): readonly GroundItemState[] {\n\t\treturn this.snapshot.items\n\t}\n\n\t/** What the game tells the player about itself (`Rules.report`): a wave number, a score */\n\tget report(): Record<string, unknown> | undefined {\n\t\treturn this.snapshot.report\n\t}\n\n\t/** An entity the player knows of, by id: none for one gone, or never seen */\n\tbyId(id: number | undefined): EntityState | undefined {\n\t\treturn id === undefined ? undefined : this.byIdMap.get(id)\n\t}\n\n\t/** @internal Where an entity comes in the snapshot: for sets to keep its order */\n\tindexOf(entity: EntityState): number {\n\t\treturn this.indexById.get(entity.id) ?? Infinity\n\t}\n\n\t/** The definition of an entity's type */\n\tdef(entity: EntityState): UnitTypeDef {\n\t\treturn this.registry.unit(entity.type)\n\t}\n\n\t/** A player, by id */\n\tplayer(id: PlayerId): PlayerState | undefined {\n\t\treturn this.playerById.get(id)\n\t}\n\n\t/** What an entity's owner is to the player: `self`, `ally`, `enemy`, `neutral`. Creeps are `enemy` */\n\trelation(entity: EntityState): PlayerState['relation'] | undefined {\n\t\treturn this.playerById.get(entity.owner)?.relation\n\t}\n\n\t/** Whether an entity is a rival's, or a creep */\n\tisHostile(entity: EntityState): boolean {\n\t\treturn this.relation(entity) === 'enemy'\n\t}\n\n\t/** Whether an entity is a creep's */\n\tisCreep(entity: EntityState): boolean {\n\t\treturn !!this.playerById.get(entity.owner)?.creeps\n\t}\n\n\t/** Whether an entity is the player's own or an ally's */\n\tisFriendly(entity: EntityState): boolean {\n\t\tconst relation = this.relation(entity)\n\t\treturn relation === 'self' || relation === 'ally'\n\t}\n\n\t/** The roles of an entity's type, or of a type by id */\n\troleOf(entity: EntityState | string): readonly AiRole[] {\n\t\treturn this.roles.of(typeof entity === 'string' ? entity : entity.type)\n\t}\n\n\t/** Whether an entity's type, or a type by id, has a role */\n\thasRole(entity: EntityState | string, role: AiRole): boolean {\n\t\treturn this.roles.has(typeof entity === 'string' ? entity : entity.type, role)\n\t}\n\n\t/**\n\t * The unit types with a role that are the player's own: those it has or can come to make (`reachable`), in the\n\t * game's order, so that the first of a kind is the one meant first. A game of two races gives each player its own\n\t */\n\ttypesOf(role: AiRole): readonly UnitTypeDef[] {\n\t\tlet found = this.typesByRole.get(role)\n\t\tif (!found) this.typesByRole.set(role, (found = this.roles.types(role).filter((def) => this.reachable.has(def.id))))\n\t\treturn found\n\t}\n\n\t/** Whether the player has the finished buildings something asks for (`UnitTypeDef.requires`) */\n\thas(requires: readonly string[] | undefined): boolean {\n\t\treturn (requires ?? []).every((id) => this.me.tech.includes(id))\n\t}\n\n\t/** The player's home: its first hall, or its first building where it has no hall. None with no buildings */\n\thome(): EntityState | undefined {\n\t\treturn this.mine.withRole('hall').first() ?? this.mine.buildings().first()\n\t}\n\n\t/**\n\t * The player's bases: its buildings clustered around what takes deposits (halls, what stands on a mine), each to\n\t * the nearest of those within reach; and where there is nothing that takes deposits (a game with no economy), around\n\t * any building, the clusters made as the buildings come. Home first\n\t */\n\tbases(): readonly Base[] {\n\t\tif (this.basesFound) return this.basesFound\n\t\tconst buildings = this.mine.buildings()\n\t\tconst reach = BASE_REACH * BASE_REACH\n\t\t// what takes deposits is the middle of a base; one within reach of an earlier one is of that base (a hall and what\n\t\t// stands on the mine beside it), not a base of its own\n\t\tconst centres: EntityState[] = []\n\t\tfor (const building of buildings) {\n\t\t\tif (!this.def(building).dropOff || centres.some((centre) => distSq(building, centre) < reach)) continue\n\t\t\tcentres.push(building)\n\t\t}\n\t\tconst members = new Map<number, EntityState[]>()\n\t\tfor (const centre of centres) members.set(centre.id, [])\n\t\tfor (const building of buildings) {\n\t\t\tlet best: EntityState | undefined\n\t\t\tlet bestDistance = reach\n\t\t\tfor (const centre of centres) {\n\t\t\t\tconst d = distSq(building, centre)\n\t\t\t\tif (d < bestDistance) {\n\t\t\t\t\tbestDistance = d\n\t\t\t\t\tbest = centre\n\t\t\t\t}\n\t\t\t}\n\t\t\t// too far from every base to be of one: a base of its own, around it\n\t\t\tif (!best) {\n\t\t\t\tbest = building\n\t\t\t\tcentres.push(building)\n\t\t\t\tmembers.set(building.id, [])\n\t\t\t}\n\t\t\tmembers.get(best.id)!.push(building)\n\t\t}\n\t\treturn (this.basesFound = centres.map((centre) => ({\n\t\t\tat: { x: centre.x, z: centre.z },\n\t\t\tcentre,\n\t\t\tbuildings: new UnitSet(this, members.get(centre.id))\n\t\t})))\n\t}\n\n\t/** The deposits near a base, in sight or remembered: what it gathers from */\n\tresourcesNear(base: Base | Vec2, radius = BASE_REACH): UnitSet {\n\t\treturn this.resources.near('at' in base ? base.at : base, radius)\n\t}\n\n\t/**\n\t * Where the game's money is mined, as the map shows them, under the fog too (`GameSession.mines`): what a computer\n\t * player looks to for another hall. Where the session does not say, the deposits of the money it knows of\n\t */\n\tmines(): readonly MineInfo[] {\n\t\tconst known = this.session.can.computer?.mines()\n\t\tif (known) return known\n\t\tconst money = this.registry.currency ?? this.registry.resources[0]?.id ?? ''\n\t\treturn this.resources.ofResource(money).map((mine) => ({ id: mine.id, x: mine.x, z: mine.z }))\n\t}\n\n\t/** The creep camps of the map: where they are is part of the map, which everyone knows */\n\tcamps(): readonly CampInfo[] {\n\t\treturn this.session.camps()\n\t}\n\n\t/**\n\t * The lanes of the map (`GameSession.lanes`: its paths with a spawner of each side at their ends), as the map shows\n\t * them: none where the session does not say, or the map has none. Read once a think\n\t */\n\tlanes(): readonly Lane[] {\n\t\treturn (this.lanesFound ??= this.session.can.computer?.lanes() ?? [])\n\t}\n\n\t/** The regions of the map, by name, as the map was made */\n\tget regions(): readonly MapRegion[] {\n\t\treturn this.session.regions\n\t}\n\n\t/** A region of the map, by name */\n\tregion(name: string): MapRegion | undefined {\n\t\treturn this.session.regions.find((region) => region.name === name)\n\t}\n\n\t/** Whether a point is in a named region of the map. False for a region the map does not have */\n\tinRegion(name: string, point: Vec2): boolean {\n\t\tconst region = this.region(name)\n\t\treturn !!region && inShape(region.shape, point)\n\t}\n\n\t/** An entity the map or the rules named (`world.named`), where the player knows of it: \"the gate\", \"the hero\" */\n\tnamed(name: string): EntityState | undefined {\n\t\treturn this.namesMap.get(name)\n\t}\n\n\t/** What the game replicates to this player of an entity (`Component.replicate`), with the component's type */\n\tcomponent<T, S = T>(entity: EntityState, component: Component<T, S>): S | undefined {\n\t\treturn entity.components?.[component.id] as S | undefined\n\t}\n\n\t/** Whether the player could build this here, as far as it can tell: no on ground it has not explored */\n\tcanPlace(unitType: string, point: Vec2): boolean {\n\t\treturn this.session.canPlace(unitType, point)\n\t}\n\n\t/** The value of one of the game's layers of cells at a point (`Terrain.cells`, `CellLayerDef`): 0 where it is not painted */\n\tcellAt(layer: string, x: number, z: number): number {\n\t\treturn this.session.terrain.cellAt(layer, x, z)\n\t}\n\n\t/** One of the game's layers of cells whole, row by row (`Terrain.cells`), to read and not to change: none where nothing is painted */\n\tcells(layer: string): Readonly<Uint8Array> | undefined {\n\t\treturn this.session.terrain.cells[layer]\n\t}\n\n\t/** The route a unit would take, over the ground the player knows */\n\tfindPath(from: Vec2, to: Vec2, flying?: boolean): Vec2[] | null {\n\t\treturn this.session.findPath(from, to, flying)\n\t}\n\n\t/** What the view found of the roles, for the debug tools: each role and its types among the player's own */\n\tinspect(): Record<string, unknown> {\n\t\tconst roles: Record<string, string[]> = {}\n\t\tfor (const [role, types] of Object.entries(this.roles.report())) {\n\t\t\tconst own = types.filter((type) => this.reachable.has(type))\n\t\t\tif (own.length) roles[role] = own\n\t\t}\n\t\treturn { roles }\n\t}\n}\n\n/** The player's own state out of the snapshot: empty where the snapshot has none (a seat out of the game) */\nfunction meOf(self: PlayerState | undefined, id: PlayerId): Me {\n\tconst own = self?.own\n\treturn {\n\t\tid,\n\t\tname: self?.name ?? '',\n\t\tteam: self?.team ?? 0,\n\t\t...(self?.race !== undefined && { race: self.race }),\n\t\tdefeated: self?.defeated ?? true,\n\t\tresources: own?.resources ?? {},\n\t\tsupplyUsed: own?.supplyUsed ?? 0,\n\t\tsupplyCap: own?.supplyCap ?? 0,\n\t\t...(own?.supplies && { supplies: own.supplies }),\n\t\tupkeep: own?.upkeep ?? { tier: 0, name: '', income: 1 },\n\t\tupgrades: own?.upgrades ?? {},\n\t\tresearching: own?.researching ?? [],\n\t\ttech: own?.tech ?? [],\n\t\theroes: own?.heroes ?? [],\n\t\tobjectives: own?.objectives ?? [],\n\t\t...(own?.unlocks && { unlocks: own.unlocks }),\n\t\t...(own?.availability && { availability: own.availability })\n\t}\n}\n\n/** Whether two of what the game's `available` hook decided are the same: by type, either left out as none */\nfunction sameAvailability(a: Record<string, boolean> | undefined, b: Record<string, boolean> | undefined): boolean {\n\tif (a === b) return true\n\tconst keys = Object.keys(a ?? {})\n\tif (keys.length !== Object.keys(b ?? {}).length) return false\n\treturn keys.every((key) => a![key] === b?.[key])\n}\n"],"mappings":";;;;;;;;;AAgDA,IAAM,OAAO;;;;;;;;;;;AAYb,IAAa,UAAb,MAAa,QAAyC;CAU3C;CAEA;;CAVV;;CAEA;CACA;CACA;CAEA,YAEC,MAEA,QAAyC,CAAC,GAC1C,YACC;EAJQ,KAAA,OAAA;EAEA,KAAA,QAAA;EAGT,KAAK,aAAa;CACnB;;CAGA,IAAI,SAAiB;EACpB,OAAO,KAAK,MAAM;CACnB;;CAGA,CAAC,OAAO,YAAmC;EAC1C,OAAO,KAAK,MAAM,OAAO,SAAS,CAAC;CACpC;;CAGA,QAAiC;EAChC,OAAO,KAAK,MAAM;CACnB;;CAGA,MAAM,OAAgB,KAAuB;EAC5C,OAAO,KAAK,KAAK,KAAK,MAAM,MAAM,OAAO,GAAG,CAAC;CAC9C;;CAGA,GAAG,OAAwC;EAC1C,OAAO,KAAK,MAAM,GAAG,KAAK;CAC3B;;CAGA,IAAO,IAAoD;EAC1D,OAAO,KAAK,MAAM,IAAI,EAAE;CACzB;;CAGA,OAAO,IAAoE;EAC1E,OAAO,KAAK,MAAM,OAAO,EAAE;CAC5B;;CAGA,KAAK,IAA8E;EAClF,OAAO,KAAK,MAAM,KAAK,EAAE;CAC1B;;CAGA,KAAK,IAA8D;EAClE,OAAO,KAAK,MAAM,KAAK,EAAE;CAC1B;;CAGA,MAAM,IAA8D;EACnE,OAAO,KAAK,MAAM,MAAM,EAAE;CAC3B;;CAGA,QAAQ,IAAwD;EAC/D,KAAK,MAAM,QAAQ,EAAE;CACtB;;CAGA,KAAa,OAAwC;EACpD,OAAO,IAAI,QAAQ,KAAK,MAAM,KAAK;CACpC;;CAGA,OAAe,KAAa,QAAgC;EAC3D,KAAK,yBAAS,IAAI,IAAI;EACtB,IAAI,QAAQ,KAAK,KAAK,IAAI,GAAG;EAC7B,IAAI,CAAC,OAAO,KAAK,KAAK,IAAI,KAAM,QAAQ,OAAO,CAAE;EACjD,OAAO;CACR;;CAGA,MAAM,WAAwE;EAC7E,MAAM,EAAE,SAAS;EACjB,OAAO,KAAK,KAAK,KAAK,MAAM,QAAQ,WAAW,UAAU,QAAQ,KAAK,IAAI,MAAM,CAAC,CAAC,CAAC;CACpF;;CAGA,OAAO,MAAuB;EAC7B,OAAO,KAAK,OAAO,QAAQ,cAAc,KAAK,OAAO,QAAQ,QAAQ,OAAO,SAAS,QAAQ,CAAC,CAAC,IAAI,UAAU,SAAS,IAAI,CAAC,CAAC;CAC7H;;CAGA,SAAS,MAAuB;EAC/B,OAAO,KAAK,OAAO,QAAQ,cAAc;GACxC,MAAM,EAAE,UAAU,KAAK;GACvB,OAAO,KAAK,KAAK,KAAK,MAAM,QAAQ,WAAW,MAAM,IAAI,OAAO,MAAM,IAAI,CAAC,CAAC;EAC7E,CAAC;CACF;;CAGA,QAAQ,KAAsB;EAC7B,OAAO,KAAK,OAAO,OAAO,aAAa;GACtC,MAAM,EAAE,UAAU,KAAK;GACvB,OAAO,KAAK,KAAK,KAAK,MAAM,QAAQ,WAAW,MAAM,OAAO,OAAO,MAAM,GAAG,CAAC,CAAC;EAC/E,CAAC;CACF;;CAGA,WAAoB;EACnB,OAAO,KAAK,OAAO,kBAAkB;GACpC,MAAM,EAAE,UAAU,KAAK;GACvB,OAAO,KAAK,KAAK,KAAK,MAAM,QAAQ,WAAW,MAAM,IAAI,OAAO,MAAM,SAAS,KAAK,MAAM,IAAI,OAAO,MAAM,MAAM,CAAC,CAAC;EACpH,CAAC;CACF;;CAGA,UAAmB;EAClB,OAAO,KAAK,SAAS,QAAQ;CAC9B;;CAGA,SAAkB;EACjB,OAAO,KAAK,SAAS,MAAM;CAC5B;;CAGA,YAAqB;EACpB,OAAO,KAAK,OAAO,mBAAmB,KAAK,OAAO,GAAG,QAAQ,IAAI,SAAS,UAAU,CAAC;CACtF;;CAGA,QAAiB;EAChB,OAAO,KAAK,OAAO,eAAe,KAAK,OAAO,GAAG,QAAQ,IAAI,SAAS,MAAM,CAAC;CAC9E;;CAGA,WAAoB;EACnB,OAAO,KAAK,OAAO,kBAAkB,KAAK,KAAK,KAAK,MAAM,QAAQ,WAAW,WAAW,MAAM,MAAM,KAAA,CAAS,CAAC,CAAC;CAChH;;CAGA,OAAgB;EACf,OAAO,KAAK,OAAO,cAAc,KAAK,KAAK,KAAK,MAAM,QAAQ,WAAW,CAAC,CAAC,OAAO,OAAO,CAAC,OAAO,IAAI,SAAS,CAAC,OAAO,IAAI,MAAM,CAAC,CAAC;CACnI;;CAGA,UAAmB;EAClB,OAAO,KAAK,OAAO,iBAAiB,KAAK,KAAK,KAAK,MAAM,QAAQ,WAAW,OAAO,OAAO,CAAC,CAAC;CAC7F;;CAGA,QAAiB;EAChB,OAAO,KAAK,OAAO,eAAe,KAAK,KAAK,KAAK,MAAM,QAAQ,WAAW,OAAO,SAAS,CAAC,CAAC,CAAC;CAC9F;;CAGA,WAAW,MAA2B;EACrC,OAAO,KAAK,OAAO,YAAY,cAAc,KAAK,OAAO,QAAQ,SAAS,OAAO,YAAY,KAAK,KAAK,IAAI,UAAU,OAAO,IAAI,CAAC;CAClI;;CAGA,QAAQ,QAA2B;EAClC,OAAO,KAAK,OAAO,SAAS,gBAAgB,KAAK,KAAK,KAAK,MAAM,QAAQ,WAAW,OAAO,UAAU,MAAM,CAAC,CAAC;CAC9G;;;;;CAMA,KAAK,OAAa,QAAyB;EAC1C,MAAM,QAAQ,SAAS;EACvB,IAAI,KAAK,MAAM,UAAU,MAAM,OAAO,KAAK,KAAK,KAAK,MAAM,QAAQ,WAAW,OAAO,QAAQ,KAAK,KAAK,KAAK,CAAC;EAC7G,MAAM,MAAM,KAAK,IAAI;EACrB,OAAO,KAAK,KAAK,KAAK,KAAK,SAAS,OAAO,MAAM,CAAC,CAAC,QAAQ,WAAW,IAAI,IAAI,OAAO,EAAE,KAAK,OAAO,QAAQ,KAAK,KAAK,KAAK,CAAC;CAC5H;;CAGA,QAAQ,OAAsC;EAC7C,IAAI;EACJ,IAAI,eAAe;EACnB,KAAK,MAAM,UAAU,KAAK,OAAO;GAChC,MAAM,IAAI,OAAO,QAAQ,KAAK;GAC9B,IAAI,IAAI,cAAc;IACrB,eAAe;IACf,OAAO;GACR;EACD;EACA,OAAO;CACR;;CAGA,SAA2B;EAC1B,MAAM,EAAE,UAAU;EAClB,IAAI,CAAC,MAAM,QAAQ,OAAO,KAAA;EAC1B,IAAI,IAAI;EACR,IAAI,IAAI;EACR,KAAK,MAAM,UAAU,OAAO;GAC3B,KAAK,OAAO;GACZ,KAAK,OAAO;EACb;EACA,OAAO;GAAE,GAAG,IAAI,MAAM;GAAQ,GAAG,IAAI,MAAM;EAAO;CACnD;;;;;CAMA,WAAmB;EAClB,OAAQ,KAAK,gBAAgB,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK;CAC/D;;CAGA,MAA2B;EAC1B,OAAQ,KAAK,UAAU,IAAI,IAAI,KAAK,MAAM,KAAK,WAAW,OAAO,EAAE,CAAC;CACrE;;CAGA,IAAI,IAAqB;EACxB,OAAO,KAAK,IAAI,CAAC,CAAC,IAAI,EAAE;CACzB;;CAGA,IAAI,OAAyB;EAC5B,MAAM,EAAE,SAAS;EACjB,MAAM,MAAM,CAAC,GAAG,KAAK,OAAO,GAAG,MAAM,MAAM,QAAQ,WAAW,CAAC,KAAK,IAAI,OAAO,EAAE,CAAC,CAAC;EACnF,IAAI,MAAM,GAAG,MAAM,KAAK,QAAQ,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC;EACpD,OAAO,KAAK,KAAK,GAAG;CACrB;;;;;;CAOA,QAAiB;EAChB,IAAI,CAAC,KAAK,YAAY,QAAQ,OAAO;EACrC,OAAO,KAAK,OAAO,eAAe,KAAK,IAAI,KAAK,KAAK,KAAK,UAAW,CAAC,CAAC;CACxE;AACD;;AAwEA,IAAM,OAAN,MAAW;CASQ;CARlB;CACA;CACA;CAEA,YACC,OACA,OAEA,OACC;EADgB,KAAA,QAAA;EAEjB,KAAK,OAAO,KAAK,IAAI,GAAG,KAAK,KAAK,QAAA,CAAY,CAAC;EAC/C,KAAK,OAAO,KAAK,IAAI,GAAG,KAAK,KAAK,QAAA,CAAY,CAAC;EAC/C,KAAK,QAAQ,IAAI,MAAM,KAAK,OAAO,KAAK,IAAI;CAC7C;CAEA,IAAY,GAAmB;EAC9B,OAAO,KAAK,IAAI,KAAK,OAAO,GAAG,KAAK,IAAI,GAAG,KAAK,MAAM,IAAA,CAAQ,CAAC,CAAC;CACjE;CAEA,IAAY,GAAmB;EAC9B,OAAO,KAAK,IAAI,KAAK,OAAO,GAAG,KAAK,IAAI,GAAG,KAAK,MAAM,IAAA,CAAQ,CAAC,CAAC;CACjE;CAEA,IAAI,QAA2B;EAC9B,MAAM,QAAQ,KAAK,IAAI,OAAO,CAAC,IAAI,KAAK,OAAO,KAAK,IAAI,OAAO,CAAC;EAC/D,CAAC,KAAK,MAAM,WAAW,CAAC,EAAA,CAAG,KAAK,MAAM;CACxC;;CAGA,KAAK,OAAa,QAA+B;EAChD,MAAM,QAAuB,CAAC;EAC9B,MAAM,KAAK,KAAK,IAAI,MAAM,IAAI,MAAM;EACpC,MAAM,KAAK,KAAK,IAAI,MAAM,IAAI,MAAM;EACpC,MAAM,KAAK,KAAK,IAAI,MAAM,IAAI,MAAM;EACpC,MAAM,KAAK,KAAK,IAAI,MAAM,IAAI,MAAM;EACpC,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,KACzB,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,KAAK;GAC9B,MAAM,OAAO,KAAK,MAAM,IAAI,KAAK,OAAO;GACxC,IAAI,MAAM,KAAK,MAAM,UAAU,MAAM,MAAM,KAAK,MAAM;EACvD;EAGD,MAAM,EAAE,UAAU;EAClB,MAAM,MAAM,GAAG,MAAM,MAAM,IAAI,EAAE,EAAE,IAAK,MAAM,IAAI,EAAE,EAAE,CAAE;EACxD,OAAO;CACR;AACD;;;;;;;AAQA,IAAa,aAAb,MAAwB;CAKb;CAJV;CAEA,YAEC,KACC;EADQ,KAAA,MAAA;CACP;;CAGH,GAAmC,MAA+C;EACjF,IAAI,CAAC,KAAK,QAAQ;GACjB,KAAK,yBAAS,IAAI,IAAI;GACtB,KAAK,MAAM,SAAS,KAAK,KAAK;IAC7B,IAAI,OAAO,KAAK,OAAO,IAAI,MAAM,IAAI;IACrC,IAAI,CAAC,MAAM,KAAK,OAAO,IAAI,MAAM,MAAO,OAAO,CAAC,CAAE;IAClD,KAAK,KAAK,KAAK;GAChB;EACD;EACA,OAAQ,KAAK,OAAO,IAAI,IAAI,KAAK,CAAC;CACnC;;CAGA,KAAQ,KAAuB;EAC9B,OAAO,KAAK,GAAG,MAAM,CAAC,CACpB,QAAQ,UAAU,MAAM,UAAU,IAAI,EAAE,CAAC,CACzC,KAAK,UAAU,MAAM,OAAY;CACpC;AACD;;;;;;;;;;;;;AA6BA,IAAa,SAAb,MAAoB;CAkDT;CAEA;;CAlDV;;CAEA;;CAEA;;CAEA;;CAEA;;CAEA;;CAEA;;CAEA;;CAEA;;CAEA;;CAEA;;CAEA;;CAEA;;CAEA;;CAEA;;;;;CAKA;CACA;CACA;CACA,0BAA2B,IAAI,IAAyB;CACxD,4BAA6B,IAAI,IAAoB;CACrD,6BAA8B,IAAI,IAA2B;CAC7D,2BAA4B,IAAI,IAAyB;CACzD;;CAEA;CACA;CACA;CAEA,YAEC,UAEA,SACA,UAAuB,CAAC,GACvB;EAJQ,KAAA,WAAA;EAEA,KAAA,UAAA;EAGT,MAAM,EAAE,UAAU,UAAU,YAAY;EACxC,KAAK,WAAW;EAChB,KAAK,WAAW;EAChB,KAAK,UAAU,SAAS;EACxB,KAAK,MAAM,UAAU,SAAS,SAAS,KAAK,WAAW,IAAI,OAAO,IAAI,MAAM;EAC5E,MAAM,OAAO,KAAK,WAAW,IAAI,QAAQ;EACzC,KAAK,KAAK,KAAK,MAAM,QAAQ;EAC7B,KAAK,SAAS,IAAI,WAAW,SAAS,MAAM;EAC5C,KAAK,OAAO,IAAI,KAAK,QAAQ,OAAO,QAAQ,OAAO,KAAK,SAAS;EAGjE,MAAM,OAAsB,CAAC;EAC7B,MAAM,SAAwB,CAAC;EAC/B,MAAM,UAAyB,CAAC;EAChC,MAAM,oBAAmC,CAAC;EAC1C,MAAM,UAAyB,CAAC;EAChC,MAAM,oBAAmC,CAAC;EAC1C,MAAM,SAAwB,CAAC;EAC/B,MAAM,mBAAkC,CAAC;EACzC,MAAM,UAAyB,CAAC;EAChC,MAAM,oBAAmC,CAAC;EAC1C,MAAM,YAA2B,CAAC;EAClC,MAAM,6BAAa,IAAI,IAAY;EACnC,SAAS,SAAS,SAAS,QAAQ,UAAU;GAC5C,KAAK,QAAQ,IAAI,OAAO,IAAI,MAAM;GAClC,KAAK,UAAU,IAAI,OAAO,IAAI,KAAK;GACnC,KAAK,KAAK,IAAI,MAAM;GACpB,IAAI,OAAO,SAAS,KAAA,GAAW,KAAK,SAAS,IAAI,OAAO,MAAM,MAAM;GACpE,IAAI,OAAO,UAAU,UAAU;IAC9B,KAAK,KAAK,MAAM;IAChB,WAAW,IAAI,OAAO,IAAI;IAC1B;GACD;GACA,IAAI,SAAS,MAAM,IAAI,OAAO,IAAI,KAAK,SAAS,KAAK,OAAO,IAAI,CAAC,CAAC,SAAS,YAAY;IACtF,UAAU,KAAK,MAAM;IACrB;GACD;GACA,MAAM,QAAQ,KAAK,WAAW,IAAI,OAAO,KAAK;GAC9C,IAAI,CAAC,OAAO;GAGZ,IAAI,MAAM,QAAQ,CAAC,OAAO,UAAU,SAAS,iBAAA,CAAkB,KAAK,MAAM;GAC1E,QAAQ,MAAM,UAAd;IACC,KAAK;KACJ,IAAI,CAAC,MAAM,QAAQ,OAAO,KAAK,MAAM;KACrC;IACD,KAAK;KACH,CAAC,OAAO,UAAU,UAAU,kBAAA,CAAmB,KAAK,MAAM;KAC3D,IAAI,CAAC,MAAM,QAAQ,CAAC,OAAO,UAAU,UAAU,kBAAA,CAAmB,KAAK,MAAM;KAC7E;IACD,SACC,IAAI,CAAC,MAAM,QAAQ,CAAC,OAAO,UAAU,UAAU,kBAAA,CAAmB,KAAK,MAAM;GAC/E;EACD,CAAC;EACD,KAAK,MAAM,IAAI,QAAQ,MAAM,SAAS,QAAQ;EAC9C,KAAK,OAAO,IAAI,QAAQ,MAAM,IAAI;EAClC,KAAK,SAAS,IAAI,QAAQ,MAAM,MAAM;EACtC,KAAK,UAAU,IAAI,QAAQ,MAAM,SAAS,iBAAiB;EAC3D,KAAK,UAAU,IAAI,QAAQ,MAAM,SAAS,iBAAiB;EAC3D,KAAK,SAAS,IAAI,QAAQ,MAAM,QAAQ,gBAAgB;EACxD,KAAK,UAAU,IAAI,QAAQ,MAAM,SAAS,iBAAiB;EAC3D,KAAK,YAAY,IAAI,QAAQ,MAAM,SAAS;EAK5C,MAAM,SAAS,QAAQ;EACvB,MAAM,SAAS;GAAE,IAAI;GAAU,MAAM,MAAM;GAAM,cAAc,MAAM,KAAK;EAAa;EACvF,KAAK,OAAO,MAAM;EAClB,KAAK,QAAQ,QAAQ,SAAS,UAAU,UAAU,QAAQ,QAAQ,KAAK;EACvE,IAAI,OAAO,UAAU,OAAO,SAAS,KAAK,QAAQ,iBAAiB,OAAO,GAAG,cAAc,OAAO,YAAY,IAAI,SAAS,KAAA;EAC3H,IAAI,MAAM;GACT,MAAM,QAAQ,KAAK;GACnB,KAAK,MAAM,QAAQ,YAAY,IAAI,CAAC,MAAM,IAAI,IAAI,GAAG,OAAO,KAAA;EAC7D;EACA,KAAK,YAAY,MAAM,aAAa,eAAe,UAAU,QAAQ,UAAU;EAC/E,KAAK,cAAc,MAAM,+BAAe,IAAI,IAAI;EAEhD,MAAM,UAAU,QAAQ,YAAY,QAAQ,SAAS;EACrD,KAAK,WAAW,UAAU,OAAO,SAAS,YAAY,UAAU,OAAO,WAAW,IAAI,SAAS,UAAU,OAAO;EAChH,KAAK,SAAS,OAAO;CACtB;;;;;CAMA,IAAI,SAAoB;EACvB,OAAQ,KAAK,cAAc,IAAI,UAAU,IAAI;CAC9C;;CAGA,SAAS,OAAa,QAA+B;EACpD,OAAO,KAAK,KAAK,KAAK,OAAO,MAAM;CACpC;;CAGA,IAAI,OAAe;EAClB,OAAO,KAAK,SAAS;CACtB;;CAGA,IAAI,OAAe;EAClB,OAAO,KAAK,SAAS,OAAO,KAAK,QAAQ;CAC1C;;CAGA,IAAI,QAAoC;EACvC,OAAO,KAAK,SAAS;CACtB;;CAGA,IAAI,SAA8C;EACjD,OAAO,KAAK,SAAS;CACtB;;CAGA,KAAK,IAAiD;EACrD,OAAO,OAAO,KAAA,IAAY,KAAA,IAAY,KAAK,QAAQ,IAAI,EAAE;CAC1D;;CAGA,QAAQ,QAA6B;EACpC,OAAO,KAAK,UAAU,IAAI,OAAO,EAAE,KAAK;CACzC;;CAGA,IAAI,QAAkC;EACrC,OAAO,KAAK,SAAS,KAAK,OAAO,IAAI;CACtC;;CAGA,OAAO,IAAuC;EAC7C,OAAO,KAAK,WAAW,IAAI,EAAE;CAC9B;;CAGA,SAAS,QAA0D;EAClE,OAAO,KAAK,WAAW,IAAI,OAAO,KAAK,CAAC,EAAE;CAC3C;;CAGA,UAAU,QAA8B;EACvC,OAAO,KAAK,SAAS,MAAM,MAAM;CAClC;;CAGA,QAAQ,QAA8B;EACrC,OAAO,CAAC,CAAC,KAAK,WAAW,IAAI,OAAO,KAAK,CAAC,EAAE;CAC7C;;CAGA,WAAW,QAA8B;EACxC,MAAM,WAAW,KAAK,SAAS,MAAM;EACrC,OAAO,aAAa,UAAU,aAAa;CAC5C;;CAGA,OAAO,QAAiD;EACvD,OAAO,KAAK,MAAM,GAAG,OAAO,WAAW,WAAW,SAAS,OAAO,IAAI;CACvE;;CAGA,QAAQ,QAA8B,MAAuB;EAC5D,OAAO,KAAK,MAAM,IAAI,OAAO,WAAW,WAAW,SAAS,OAAO,MAAM,IAAI;CAC9E;;;;;CAMA,QAAQ,MAAsC;EAC7C,IAAI,QAAQ,KAAK,YAAY,IAAI,IAAI;EACrC,IAAI,CAAC,OAAO,KAAK,YAAY,IAAI,MAAO,QAAQ,KAAK,MAAM,MAAM,IAAI,CAAC,CAAC,QAAQ,QAAQ,KAAK,UAAU,IAAI,IAAI,EAAE,CAAC,CAAE;EACnH,OAAO;CACR;;CAGA,IAAI,UAAkD;EACrD,QAAQ,YAAY,CAAC,EAAA,CAAG,OAAO,OAAO,KAAK,GAAG,KAAK,SAAS,EAAE,CAAC;CAChE;;CAGA,OAAgC;EAC/B,OAAO,KAAK,KAAK,SAAS,MAAM,CAAC,CAAC,MAAM,KAAK,KAAK,KAAK,UAAU,CAAC,CAAC,MAAM;CAC1E;;;;;;CAOA,QAAyB;EACxB,IAAI,KAAK,YAAY,OAAO,KAAK;EACjC,MAAM,YAAY,KAAK,KAAK,UAAU;EACtC,MAAM,QAAA;EAGN,MAAM,UAAyB,CAAC;EAChC,KAAK,MAAM,YAAY,WAAW;GACjC,IAAI,CAAC,KAAK,IAAI,QAAQ,CAAC,CAAC,WAAW,QAAQ,MAAM,WAAW,OAAO,UAAU,MAAM,IAAI,KAAK,GAAG;GAC/F,QAAQ,KAAK,QAAQ;EACtB;EACA,MAAM,0BAAU,IAAI,IAA2B;EAC/C,KAAK,MAAM,UAAU,SAAS,QAAQ,IAAI,OAAO,IAAI,CAAC,CAAC;EACvD,KAAK,MAAM,YAAY,WAAW;GACjC,IAAI;GACJ,IAAI,eAAe;GACnB,KAAK,MAAM,UAAU,SAAS;IAC7B,MAAM,IAAI,OAAO,UAAU,MAAM;IACjC,IAAI,IAAI,cAAc;KACrB,eAAe;KACf,OAAO;IACR;GACD;GAEA,IAAI,CAAC,MAAM;IACV,OAAO;IACP,QAAQ,KAAK,QAAQ;IACrB,QAAQ,IAAI,SAAS,IAAI,CAAC,CAAC;GAC5B;GACA,QAAQ,IAAI,KAAK,EAAE,CAAC,CAAE,KAAK,QAAQ;EACpC;EACA,OAAQ,KAAK,aAAa,QAAQ,KAAK,YAAY;GAClD,IAAI;IAAE,GAAG,OAAO;IAAG,GAAG,OAAO;GAAE;GAC/B;GACA,WAAW,IAAI,QAAQ,MAAM,QAAQ,IAAI,OAAO,EAAE,CAAC;EACpD,EAAE;CACH;;CAGA,cAAc,MAAmB,SAAA,IAA8B;EAC9D,OAAO,KAAK,UAAU,KAAK,QAAQ,OAAO,KAAK,KAAK,MAAM,MAAM;CACjE;;;;;CAMA,QAA6B;EAC5B,MAAM,QAAQ,KAAK,QAAQ,IAAI,UAAU,MAAM;EAC/C,IAAI,OAAO,OAAO;EAClB,MAAM,QAAQ,KAAK,SAAS,YAAY,KAAK,SAAS,UAAU,EAAE,EAAE,MAAM;EAC1E,OAAO,KAAK,UAAU,WAAW,KAAK,CAAC,CAAC,KAAK,UAAU;GAAE,IAAI,KAAK;GAAI,GAAG,KAAK;GAAG,GAAG,KAAK;EAAE,EAAE;CAC9F;;CAGA,QAA6B;EAC5B,OAAO,KAAK,QAAQ,MAAM;CAC3B;;;;;CAMA,QAAyB;EACxB,OAAQ,KAAK,eAAe,KAAK,QAAQ,IAAI,UAAU,MAAM,KAAK,CAAC;CACpE;;CAGA,IAAI,UAAgC;EACnC,OAAO,KAAK,QAAQ;CACrB;;CAGA,OAAO,MAAqC;EAC3C,OAAO,KAAK,QAAQ,QAAQ,MAAM,WAAW,OAAO,SAAS,IAAI;CAClE;;CAGA,SAAS,MAAc,OAAsB;EAC5C,MAAM,SAAS,KAAK,OAAO,IAAI;EAC/B,OAAO,CAAC,CAAC,UAAU,QAAQ,OAAO,OAAO,KAAK;CAC/C;;CAGA,MAAM,MAAuC;EAC5C,OAAO,KAAK,SAAS,IAAI,IAAI;CAC9B;;CAGA,UAAoB,QAAqB,WAA2C;EACnF,OAAO,OAAO,aAAa,UAAU;CACtC;;CAGA,SAAS,UAAkB,OAAsB;EAChD,OAAO,KAAK,QAAQ,SAAS,UAAU,KAAK;CAC7C;;CAGA,OAAO,OAAe,GAAW,GAAmB;EACnD,OAAO,KAAK,QAAQ,QAAQ,OAAO,OAAO,GAAG,CAAC;CAC/C;;CAGA,MAAM,OAAiD;EACtD,OAAO,KAAK,QAAQ,QAAQ,MAAM;CACnC;;CAGA,SAAS,MAAY,IAAU,QAAiC;EAC/D,OAAO,KAAK,QAAQ,SAAS,MAAM,IAAI,MAAM;CAC9C;;CAGA,UAAmC;EAClC,MAAM,QAAkC,CAAC;EACzC,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,KAAK,MAAM,OAAO,CAAC,GAAG;GAChE,MAAM,MAAM,MAAM,QAAQ,SAAS,KAAK,UAAU,IAAI,IAAI,CAAC;GAC3D,IAAI,IAAI,QAAQ,MAAM,QAAQ;EAC/B;EACA,OAAO,EAAE,MAAM;CAChB;AACD;;AAGA,SAAS,KAAK,MAA+B,IAAkB;CAC9D,MAAM,MAAM,MAAM;CAClB,OAAO;EACN;EACA,MAAM,MAAM,QAAQ;EACpB,MAAM,MAAM,QAAQ;EACpB,GAAI,MAAM,SAAS,KAAA,KAAa,EAAE,MAAM,KAAK,KAAK;EAClD,UAAU,MAAM,YAAY;EAC5B,WAAW,KAAK,aAAa,CAAC;EAC9B,YAAY,KAAK,cAAc;EAC/B,WAAW,KAAK,aAAa;EAC7B,GAAI,KAAK,YAAY,EAAE,UAAU,IAAI,SAAS;EAC9C,QAAQ,KAAK,UAAU;GAAE,MAAM;GAAG,MAAM;GAAI,QAAQ;EAAE;EACtD,UAAU,KAAK,YAAY,CAAC;EAC5B,aAAa,KAAK,eAAe,CAAC;EAClC,MAAM,KAAK,QAAQ,CAAC;EACpB,QAAQ,KAAK,UAAU,CAAC;EACxB,YAAY,KAAK,cAAc,CAAC;EAChC,GAAI,KAAK,WAAW,EAAE,SAAS,IAAI,QAAQ;EAC3C,GAAI,KAAK,gBAAgB,EAAE,cAAc,IAAI,aAAa;CAC3D;AACD;;AAGA,SAAS,iBAAiB,GAAwC,GAAiD;CAClH,IAAI,MAAM,GAAG,OAAO;CACpB,MAAM,OAAO,OAAO,KAAK,KAAK,CAAC,CAAC;CAChC,IAAI,KAAK,WAAW,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,OAAO;CACxD,OAAO,KAAK,OAAO,QAAQ,EAAG,SAAS,IAAI,IAAI;AAChD"}

package/dist/ai/waves.d.ts

@@ -69,11 +69,13 @@ export interface WavesOptions {
  * @beta
  */
 export interface WavesMemory {
+    /** The version of the memory's format: 1 so far */
     v: 1;
     /** The index of the wave whose turn it is: the waves sent and skipped before it */
     index: number;
     /** Where in the list it is (for a list), and how many times the wave there went */
     entry: number;
+    /** How many times the wave at the entry has gone */
     went: number;
     /** The tick the last wave went at (or was skipped at): what the next one's `after` counts from */
     last: number;
@@ -95,13 +97,16 @@ export interface WavesMemory {
  * @beta
  */
 export interface WavesReport {
+    /** The index of the wave whose turn it is */
     index: number;
+    /** The wave whose turn it is: its units as free and wanted by type, seconds until it may go, whether it is ready and a status in words */
     current?: {
         units: Record<string, [free: number, wanted: number]>;
         in: number;
         ready: boolean;
         status: string;
     };
+    /** The waves sent, each with its index, squad, size, target and tick */
     sent: {
         index: number;
         squad: string;
@@ -109,6 +114,7 @@ export interface WavesReport {
         at: [number, number];
         tick: number;
     }[];
+    /** How many waves were skipped for a failing condition */
     skipped: number;
 }
 /**

package/dist/ai/waves.js

@@ -0,0 +1,410 @@
+import { distSq } from "../math.js";
+import { defineModule } from "./module.js";
+import { evaluate } from "./rules.js";
+import { pair, point, where } from "./geometry.js";
+import { Team } from "./team.js";
+//#region src/ai/waves.ts
+/** How far out of home towards the target a wave gathers, where it is not told */
+var RALLY_OUT = 12;
+/** How many sent waves the memory keeps */
+var SENT_KEPT = 10;
+/** The prefix of the wants of a wave's units, on the build plan */
+var WANT = "waves.";
+/** Whose the waves' squads are: their units held by the module until the wave is over */
+var OWNER = "waves";
+/**
+* A brain's waves (`ai.waves`): the wave whose turn it is (`current`), what it is made of and how far along, the waves
+* sent. Run by the `waves()` module each think; idle without waves given
+*
+* @internal
+*/
+var Waves = class Waves {
+	ai;
+	/** What finds it on a brain (`ai.area(Waves)`): made the first time a module asks for it */
+	static id = "waves";
+	/** Makes the waves of a brain; what `ai.area(Waves)` calls the first time a module asks for it */
+	static make(ai) {
+		return new Waves(ai);
+	}
+	/** Its id among the brain's areas: what its memory and its report are kept under */
+	id = "waves";
+	/** What the log says where a save's memory of it is of a shape it does not read */
+	afresh = "the save remembers the computer player’s waves in a shape this brain does not read: they start afresh";
+	/** Whether a `waves()` module is in the brain */
+	enabled = false;
+	memory = {
+		v: 1,
+		index: 0,
+		entry: 0,
+		went: 0,
+		last: 0,
+		sent: [],
+		skipped: 0
+	};
+	moduleOptions = {};
+	thoughtAt = -1;
+	status = "no waves";
+	constructor(ai) {
+		this.ai = ai;
+	}
+	/**
+	* Puts the `waves()` module's options under the brain's settings; and while it has waves to send, the production
+	* plan's composition is left aside (what is trained is the waves' groups, wanted outright)
+	*/
+	configure(options) {
+		this.moduleOptions = options;
+		this.enabled = true;
+		const { production } = this.ai.plans;
+		const before = production.settings.composition;
+		production.configure({ composition: ((brain) => {
+			if (brain.area(Waves).active) return {};
+			return typeof before === "function" ? before(brain) : before;
+		}) });
+	}
+	/** How it sends waves: the module's options, the brain's settings over them (`ai.settings.waves`), the groups of both */
+	get options() {
+		const settings = this.ai.settings.waves;
+		const groups = settings?.groups && this.moduleOptions.groups ? [...this.moduleOptions.groups, ...settings.groups] : void 0;
+		return {
+			...this.moduleOptions,
+			...settings,
+			...groups && { groups }
+		};
+	}
+	/** Whether it was given waves: the module is in the brain, and waves were given it (all sent, or some to go) */
+	get given() {
+		return this.enabled && this.options.waves !== void 0;
+	}
+	/** Whether it has waves to send: given waves, and one whose turn it is. The melee player makes its own otherwise */
+	get active() {
+		return this.given && this.current() !== void 0;
+	}
+	/** The index of the wave whose turn it is: the waves sent and skipped before it (`{ wave }` in a condition) */
+	get index() {
+		return this.memory.index;
+	}
+	/** The wave whose turn it is: none when there are no (more) waves */
+	current() {
+		const { waves } = this.options;
+		if (!waves) return void 0;
+		if (typeof waves === "function") return waves(this.ai, this.memory.index);
+		return waves[this.memory.entry];
+	}
+	/** A wave's group as units by type or role: the group named, or the units given in place. None for a name not given */
+	groupOf(wave) {
+		if (typeof wave.group !== "string") return {
+			id: `wave ${this.memory.index + 1}`,
+			units: wave.group
+		};
+		return this.options.groups?.find((group) => group.id === wave.group);
+	}
+	/**
+	* Whether a unit counts as one of a key of a group: of the type by id where a type has the id, else of the role. A
+	* key that is both (the fixture's `soldier`) is the type: an archer, a soldier by role, is not one of `soldier: 4`
+	*/
+	matches(unit, key) {
+		if (this.ai.registry.units.has(key)) return unit.type === key;
+		return this.ai.view.hasRole(unit, key);
+	}
+	/** The type trained for a key of a group: the type of that id, or the first of the role it can make */
+	typeFor(key) {
+		const { registry, view } = this.ai;
+		if (registry.units.has(key)) return registry.unit(key);
+		return view.typesOf(key).find((def) => def.kind === "unit");
+	}
+	/** The units free for a wave: in the pool (nothing holds them), idle or on their way to nothing, fighters */
+	free() {
+		return this.ai.squads.pool().fighters().where((unit) => unit.own?.order !== "harvest").items;
+	}
+	/** For each key of the group, the free units that count as it, at most as many as wanted, each unit once */
+	chosen(group) {
+		const taken = /* @__PURE__ */ new Set();
+		const by = /* @__PURE__ */ new Map();
+		const free = this.free();
+		for (const [key, count] of Object.entries(group.units)) {
+			const units = [];
+			for (const unit of free) {
+				if (units.length >= count) break;
+				if (taken.has(unit.id) || !this.matches(unit, key)) continue;
+				taken.add(unit.id);
+				units.push(unit);
+			}
+			by.set(key, units);
+		}
+		return by;
+	}
+	/** Where a wave goes, as its target says: their base nearest home when it says nothing. None where nothing is known */
+	targetOf(wave) {
+		const { ai } = this;
+		const target = wave.target ?? "nearestBase";
+		if (typeof target === "function") return target(ai);
+		if (typeof target === "object") return point(target);
+		const home = ai.view.home();
+		const from = home ? point(home) : {
+			x: 0,
+			z: 0
+		};
+		const knows = ai.def.knowledge !== false;
+		const bases = knows ? ai.knowledge.enemy.bases().filter((base) => !base.gone) : [];
+		const told = ai.options.enemyBases ?? [];
+		const nearest = (places) => places.reduce((best, each) => !best || distSq(each, from) < distSq(best, from) ? each : best, void 0);
+		switch (target) {
+			case "army": {
+				const army = knows ? ai.knowledge.enemy.armySeen()[0] : void 0;
+				if (army) return point(army.at);
+				break;
+			}
+			case "expansion": {
+				const expansion = nearest(bases.filter((base) => base.expansion).map((base) => base.at));
+				if (expansion) return point(expansion);
+				break;
+			}
+			case "weakestBase": {
+				const threat = ai.view.threat;
+				let best;
+				for (const base of bases) {
+					const score = threat.at(base.at, { remembered: true }).enemy;
+					if (!best || score < best.score) best = {
+						at: base.at,
+						score
+					};
+				}
+				if (best) return point(best.at);
+				break;
+			}
+		}
+		const known = nearest(bases.map((base) => base.at));
+		if (known) return point(known);
+		return told.length ? point(told[this.memory.index % told.length]) : void 0;
+	}
+	/** Where a wave gathers: the place given (by name or as a point), or a little out of home towards its target */
+	rallyOf(wave, target) {
+		const { ai } = this;
+		if (typeof wave.rally === "string") {
+			const named = ai.view.named(wave.rally);
+			return named ? point(named) : void 0;
+		}
+		if (wave.rally) return point(wave.rally);
+		const home = ai.view.home();
+		if (!home) return void 0;
+		if (!target) return point(home);
+		const dx = target.x - home.x;
+		const dz = target.z - home.z;
+		const length = Math.sqrt(dx * dx + dz * dz) || 1;
+		return {
+			x: home.x + dx / length * RALLY_OUT,
+			z: home.z + dz / length * RALLY_OUT
+		};
+	}
+	/**
+	* The think, once a think: the wave whose turn it is skipped where its condition fails; its group wanted of the
+	* production plan; once enough of it is free and its time has come, sent (a squad that gathers, then attacks), the
+	* next wave's turn begun. Without waves, nothing
+	*/
+	think() {
+		const { ai } = this;
+		if (this.thoughtAt === ai.tick) return;
+		this.thoughtAt = ai.tick;
+		for (const squad of ai.squads.of(OWNER).squads) if (squad.idle) ai.squads.disband(squad, `wave over: ${squad.done ?? "idle"}`);
+		const wave = this.current();
+		if (!wave) {
+			this.dropWants();
+			this.status = this.options.waves ? "no more waves" : "no waves";
+			return;
+		}
+		const group = this.groupOf(wave);
+		if (!group) {
+			this.status = `no group "${String(wave.group)}"`;
+			if (!this.warned) {
+				this.warned = true;
+				ai.log.warn("ai", `a wave names the group "${String(wave.group)}", which no group is: it is skipped`);
+			}
+			this.next(true);
+			return;
+		}
+		if (wave.when && !evaluate(wave.when, ai) || group.when && !evaluate(group.when, ai)) {
+			ai.decide(`skips wave ${this.memory.index + 1}: its condition does not hold`, { kind: "waves" });
+			this.next(true);
+			return;
+		}
+		const chosen = this.chosen(group);
+		if (this.options.train ?? true) this.want(group, chosen);
+		const total = Object.values(group.units).reduce((sum, count) => sum + count, 0);
+		const have = [...chosen.values()].reduce((sum, units) => sum + units.length, 0);
+		const enough = Math.max(1, Math.ceil(total * Math.min(1, Math.max(0, wave.minForces ?? 1))));
+		const due = this.memory.last + Math.round((wave.after ?? 0) * ai.session.tickRate);
+		if (ai.tick < due) {
+			this.status = `waits ${Math.ceil((due - ai.tick) / ai.session.tickRate)} s more (${have} of ${total})`;
+			return;
+		}
+		if (have < enough) {
+			this.status = `builds up: ${have} of ${total}, ${enough} enough`;
+			return;
+		}
+		const target = this.targetOf(wave);
+		if (!target) {
+			this.status = "nowhere to go";
+			return;
+		}
+		let plan = wave.together && ai.area(Team).enabled ? ai.area(Team).plan : void 0;
+		if (wave.together && ai.area(Team).enabled) {
+			if (plan && !plan.joined.includes(ai.playerId) && ai.tick >= plan.at) plan = void 0;
+			if (!plan) plan = ai.area(Team).propose(target);
+			else if (!plan.joined.includes(ai.playerId)) ai.area(Team).join();
+			if (ai.tick < plan.at) {
+				this.status = `waits for its team: goes in ${Math.ceil((plan.at - ai.tick) / ai.session.tickRate)} s`;
+				return;
+			}
+		}
+		this.send(wave, chosen, plan?.target ?? target);
+		this.next(false);
+	}
+	warned = false;
+	/** The group's units wanted of the production plan: as many more of each type as the free ones fall short of */
+	want(group, chosen) {
+		const { ai } = this;
+		const keys = /* @__PURE__ */ new Set();
+		for (const [key, count] of Object.entries(group.units)) {
+			const type = this.typeFor(key);
+			if (!type) continue;
+			const id = `${WANT}${key}`;
+			keys.add(id);
+			const free = chosen.get(key)?.length ?? 0;
+			ai.plans.want({
+				id,
+				type: type.id,
+				count: ai.view.mine.ofType(type.id).length - free + count,
+				priority: this.options.priority ?? 30,
+				by: `wave ${this.memory.index + 1}`
+			});
+		}
+		for (const want of ai.plans.build.list()) if (want.id?.startsWith(WANT) && !keys.has(want.id)) ai.plans.drop(want.id);
+	}
+	/** The wants of a wave's units let go of */
+	dropWants() {
+		const { ai } = this;
+		for (const want of ai.plans.build.list()) if (want.id?.startsWith(WANT)) ai.plans.drop(want.id);
+	}
+	/** A wave sent: its units a squad that gathers at the rally, then attacks; said, noted, written down */
+	send(wave, chosen, target) {
+		const { ai } = this;
+		const units = [...chosen.values()].flat();
+		const index = this.memory.index + 1;
+		const name = `wave ${index}`;
+		const rally = this.rallyOf(wave, target) ?? target;
+		const squad = ai.squads.make(name, units, { owner: OWNER });
+		squad.gather(rally, {
+			minForces: wave.minForces ?? 1,
+			seconds: wave.gatherFor ?? 15,
+			then: {
+				kind: "attack",
+				data: { at: point(target) }
+			}
+		});
+		ai.knowledge.own.attackSent(target, units.length);
+		ai.area(Team).say("attacking");
+		const sent = {
+			index: this.memory.index,
+			squad: name,
+			size: units.length,
+			at: point(target),
+			tick: ai.tick
+		};
+		this.memory.sent.push(sent);
+		if (this.memory.sent.length > SENT_KEPT) this.memory.sent.splice(0, this.memory.sent.length - SENT_KEPT);
+		const made = [...chosen.entries()].filter(([, each]) => each.length).map(([key, each]) => `${each.length} ${key}`);
+		ai.decide(`sends wave ${index}: ${made.join(", ")}, gathering at ${where(rally)} for ${wave.gatherFor ?? 15} s, then at ${where(target)}`, { kind: "waves" });
+		this.status = `sent ${name}`;
+		return squad;
+	}
+	/** On to the next wave's turn: the same again where it repeats, else the next of the list */
+	next(skipped) {
+		const { memory } = this;
+		const wave = this.current();
+		memory.index++;
+		memory.last = this.ai.tick;
+		if (skipped) memory.skipped++;
+		const repeat = skipped ? false : wave?.repeat;
+		memory.went++;
+		if (repeat === true || typeof repeat === "number" && memory.went < repeat) return;
+		memory.entry++;
+		memory.went = 0;
+	}
+	/** The waves as the report shows them */
+	report() {
+		const { ai } = this;
+		const wave = this.enabled ? this.current() : void 0;
+		const group = wave && this.groupOf(wave);
+		const chosen = group ? this.chosen(group) : void 0;
+		const due = wave ? this.memory.last + Math.round((wave.after ?? 0) * ai.session.tickRate) : 0;
+		return {
+			index: this.memory.index,
+			...wave && group && chosen && { current: {
+				units: Object.fromEntries(Object.entries(group.units).map(([key, count]) => [key, [chosen.get(key)?.length ?? 0, count]])),
+				in: Math.max(0, Math.ceil((due - ai.tick) / ai.session.tickRate)),
+				ready: this.status.startsWith("sent"),
+				status: this.status
+			} },
+			sent: this.memory.sent.map((each) => ({
+				index: each.index,
+				squad: each.squad,
+				size: each.size,
+				at: pair(each.at),
+				tick: each.tick
+			})),
+			skipped: this.memory.skipped
+		};
+	}
+	/** What it remembers, for a save: a copy */
+	/** Whether it has anything to remember now: one that does not is left out of a save */
+	remembers() {
+		return this.enabled;
+	}
+	/** Its part of the brain's report */
+	reportTo(report) {
+		if (this.enabled) report.waves = this.report();
+	}
+	/** Gives a copy of the waves' memory, for a save of the brain */
+	save() {
+		return structuredClone(this.memory);
+	}
+	/** Takes back what `save` gave: whether it was read */
+	restore(memory) {
+		const given = memory;
+		if (!given || typeof given !== "object" || given.v !== 1) return false;
+		this.memory = {
+			v: 1,
+			index: given.index ?? 0,
+			entry: given.entry ?? 0,
+			went: given.went ?? 0,
+			last: given.last ?? 0,
+			sent: structuredClone(given.sent ?? []),
+			skipped: given.skipped ?? 0
+		};
+		return true;
+	}
+};
+/**
+* The waves module: the wave whose turn it is, each think (`ai.waves.think`): its group wanted, sent once enough of it is
+* free and its time has come, gathering at the rally, then attacking. Idle without waves given. With how it sends waves
+* where the brain's definition and the seat's options say nothing (`WavesOptions`)
+*
+* @beta
+*/
+var waves = (options = {}) => defineModule({
+	id: "waves",
+	make: (ai) => {
+		ai.area(Waves).configure(options);
+		return {
+			id: "waves",
+			phase: "act",
+			after: ["goals"],
+			before: ["squads"],
+			think: () => ai.area(Waves).think()
+		};
+	}
+});
+//#endregion
+export { Waves, waves };
+
+//# sourceMappingURL=waves.js.map

package/dist/ai/waves.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"waves.js","names":[],"sources":["../../src/ai/waves.ts"],"sourcesContent":["import type { UnitTypeDef } from '#engine/defs'\nimport { Team } from './team'\nimport type { AiArea } from './area'\nimport type { AiReport } from './report'\nimport { distSq, type Vec2 } from '#engine/math'\nimport type { EntityState } from '#engine/session/protocol'\nimport { type Brain } from './brain'\nimport { type AiModule, type AiModuleDef, defineModule } from './module'\nimport { type AiCondition, evaluate } from './rules'\nimport type { Squad } from './squads'\nimport { pair, point, where } from './geometry'\n\n/*\n * Attack groups and waves (AI plan, D2): the classic RTS attack data, made general. The melee player's waves were \"the\n * ready units, two more each time\": no say in what a wave is made of, when it goes, or where. A game, a map or a\n * mission says it here, as data:\n *\n * - **An attack group** (`AttackGroup`) is what a wave is made of: so many of each unit type or role (`{ footman: 4,\n *   rifleman: 2 }`, `{ caster: 1 }`).\n * - **A wave** (`AttackWave`) names its group (or gives one in place), and says when it goes (`after` seconds from the\n *   last wave, or from the start for the first; and `when`, a condition: a wave whose condition does not hold when its\n *   turn comes is skipped), how much of the group is enough (`minForces`, a share), how long it gathers at the rally\n *   before it goes (`gatherFor`), whether it goes again (`repeat`: for ever, or so many times), whether it waits for\n *   its team to go together (`together`, C5), and where it goes (`target`: their nearest base, their weakest, an\n *   expansion of theirs, their army as last seen, a place, or a function).\n * - **The waves module** (`waves()`) works on the wave whose turn it is: its group becomes **wants** of the production\n *   plan (B3: the units are trained, and the buildings they need put up, as wants are), and nothing else of the army is\n *   trained meanwhile (the composition left aside: a wave of four footmen and two riflemen trains exactly that); once\n *   enough of it stands idle in the pool and its time has come, it is made a squad (`wave 1`, `wave 2`, …) that\n *   **gathers** at the rally and then **attacks** (C1's tasks), and the next wave's turn begins.\n * - **Without waves** the melee player makes its own, as it always did (`waveSize` growing by two, the nearest base):\n *   the module is there, and idle.\n *\n * The data forms are JSON (a map's file, `MapPlayer.data.ai.waves`; a seat's `AiOptions.waves` and `groups`); the waves\n * as a function (`(ai, index) => wave`) make them as the game goes. What the module remembers (whose turn it is, how many\n * times it went, the waves sent) is plain data in the brain's memory (`BrainMemory.waves`). `{ wave: … }` in a condition\n * (B2) is the index of the wave whose turn it is.\n */\n\n/**\n * What a wave is made of: so many of each unit type (by id) or role (`caster`, a game's own), by name, under a condition\n *\n * @beta\n */\nexport interface AttackGroup {\n\t/** Its name: what a wave names it by */\n\tid: string\n\t/** So many of each unit type or role: `{ footman: 4, rifleman: 2 }` */\n\tunits: Record<string, number>\n\t/** Only while this holds: a wave of a group whose condition fails is skipped as its own would be */\n\twhen?: AiCondition\n}\n\n/**\n * Where a wave goes: their base nearest home, their weakest (the fewest towers and army seen there), an expansion of\n * theirs, their army as last seen, a place, or a function of the brain\n *\n * @beta\n */\nexport type WaveTarget = 'nearestBase' | 'weakestBase' | 'expansion' | 'army' | Vec2 | ((ai: Brain) => Vec2 | undefined)\n\n/**\n * One wave (the classic attack wave): its group, when it goes, how much of it is enough, how long it gathers, whether it\n * goes again, together or not, and where to\n *\n * @beta\n */\nexport interface AttackWave {\n\t/** Its group: a group's name (`WavesOptions.groups`), or the units in place (`{ footman: 4 }`) */\n\tgroup: string | Record<string, number>\n\t/** Seconds after the wave before it (after the start, for the first) before it may go: 0 when left out */\n\tafter?: number\n\t/** The share of its group that is enough to go with, 0 to 1: all of it when left out */\n\tminForces?: number\n\t/** Seconds it gathers at the rally before it goes, whoever is late: 15 when left out */\n\tgatherFor?: number\n\t/** Whether it goes again once sent: `true` for ever, a number for so many times in all. Once when left out */\n\trepeat?: boolean | number\n\t/** Only when this holds as its turn comes: a wave whose condition fails is skipped */\n\twhen?: AiCondition\n\t/** Whether it waits for its team's attack together (`TeamOptions.together`, C5) */\n\ttogether?: boolean\n\t/** Where it goes: their base nearest home when left out */\n\ttarget?: WaveTarget\n\t/** Where it gathers: a place, or a name the map or the rules gave. A little out of home towards the target when left out */\n\trally?: Vec2 | string\n}\n\n/**\n * How a brain sends its waves (`BrainDef.waves`; the seat's `AiOptions.waves` and `groups`, the data of it, go over)\n *\n * @beta\n */\nexport interface WavesOptions {\n\t/** The groups waves are made of, by name */\n\tgroups?: AttackGroup[]\n\t/** The waves, in order, or a function giving the wave whose turn it is (by its index), none for no more */\n\twaves?: AttackWave[] | ((ai: Brain, index: number) => AttackWave | undefined)\n\t/** Whether a wave's group is trained (wants of the production plan): yes when left out. No for units that are given (a lanes game) */\n\ttrain?: boolean\n\t/** How important a wave's units are to the purse, as wants: 30 when left out (under a hall, a barracks, a hero) */\n\tpriority?: number\n}\n\n/**\n * What the waves module remembers between thinks, as a save keeps it\n *\n * @beta\n */\nexport interface WavesMemory {\n\t/** The version of the memory's format: 1 so far */\n\tv: 1\n\t/** The index of the wave whose turn it is: the waves sent and skipped before it */\n\tindex: number\n\t/** Where in the list it is (for a list), and how many times the wave there went */\n\tentry: number\n\t/** How many times the wave at the entry has gone */\n\twent: number\n\t/** The tick the last wave went at (or was skipped at): what the next one's `after` counts from */\n\tlast: number\n\t/** The waves sent, the last ten: index, squad, size, target, tick */\n\tsent: { index: number; squad: string; size: number; at: Vec2; tick: number }[]\n\t/** How many were skipped, their condition failing */\n\tskipped: number\n}\n\n/**\n * The waves as the report shows them (`AiReport.waves`): the wave whose turn it is, its group as it stands, when it may go;\n * the waves sent\n *\n * @beta\n */\nexport interface WavesReport {\n\t/** The index of the wave whose turn it is */\n\tindex: number\n\t/** The wave whose turn it is: its units as free and wanted by type, seconds until it may go, whether it is ready and a status in words */\n\tcurrent?: { units: Record<string, [free: number, wanted: number]>; in: number; ready: boolean; status: string }\n\t/** The waves sent, each with its index, squad, size, target and tick */\n\tsent: { index: number; squad: string; size: number; at: [number, number]; tick: number }[]\n\t/** How many waves were skipped for a failing condition */\n\tskipped: number\n}\n\n/** How far out of home towards the target a wave gathers, where it is not told */\nconst RALLY_OUT = 12\n/** How many sent waves the memory keeps */\nconst SENT_KEPT = 10\n/** The prefix of the wants of a wave's units, on the build plan */\nconst WANT = 'waves.'\n/** Whose the waves' squads are: their units held by the module until the wave is over */\nconst OWNER = 'waves'\n\n/**\n * A brain's waves (`ai.waves`): the wave whose turn it is (`current`), what it is made of and how far along, the waves\n * sent. Run by the `waves()` module each think; idle without waves given\n *\n * @internal\n */\nexport class Waves implements AiArea {\n\t/** What finds it on a brain (`ai.area(Waves)`): made the first time a module asks for it */\n\tstatic readonly id = 'waves'\n\t/** Makes the waves of a brain; what `ai.area(Waves)` calls the first time a module asks for it */\n\tstatic make(ai: Brain): Waves {\n\t\treturn new Waves(ai)\n\t}\n\t/** Its id among the brain's areas: what its memory and its report are kept under */\n\treadonly id = 'waves'\n\t/** What the log says where a save's memory of it is of a shape it does not read */\n\treadonly afresh = 'the save remembers the computer player’s waves in a shape this brain does not read: they start afresh'\n\n\t/** Whether a `waves()` module is in the brain */\n\tenabled = false\n\tprivate memory: WavesMemory = { v: 1, index: 0, entry: 0, went: 0, last: 0, sent: [], skipped: 0 }\n\tprivate moduleOptions: WavesOptions = {}\n\tprivate thoughtAt = -1\n\tprivate status = 'no waves'\n\n\tconstructor(\n\t\t/** The brain it sends waves for */\n\t\treadonly ai: Brain\n\t) {}\n\n\t/**\n\t * Puts the `waves()` module's options under the brain's settings; and while it has waves to send, the production\n\t * plan's composition is left aside (what is trained is the waves' groups, wanted outright)\n\t */\n\tconfigure(options: WavesOptions): void {\n\t\tthis.moduleOptions = options\n\t\tthis.enabled = true\n\t\tconst { production } = this.ai.plans\n\t\tconst before = production.settings.composition\n\t\tproduction.configure({\n\t\t\tcomposition: ((brain: Brain) => {\n\t\t\t\tif (brain.area(Waves).active) return {}\n\t\t\t\treturn typeof before === 'function' ? before(brain) : before\n\t\t\t}) as (ai: Brain) => Record<string, number>\n\t\t})\n\t}\n\n\t/** How it sends waves: the module's options, the brain's settings over them (`ai.settings.waves`), the groups of both */\n\tget options(): WavesOptions {\n\t\tconst settings = this.ai.settings.waves\n\t\tconst groups = settings?.groups && this.moduleOptions.groups ? [...this.moduleOptions.groups, ...settings.groups] : undefined\n\t\treturn { ...this.moduleOptions, ...settings, ...(groups && { groups }) }\n\t}\n\n\t/** Whether it was given waves: the module is in the brain, and waves were given it (all sent, or some to go) */\n\tget given(): boolean {\n\t\treturn this.enabled && this.options.waves !== undefined\n\t}\n\n\t/** Whether it has waves to send: given waves, and one whose turn it is. The melee player makes its own otherwise */\n\tget active(): boolean {\n\t\treturn this.given && this.current() !== undefined\n\t}\n\n\t/** The index of the wave whose turn it is: the waves sent and skipped before it (`{ wave }` in a condition) */\n\tget index(): number {\n\t\treturn this.memory.index\n\t}\n\n\t/** The wave whose turn it is: none when there are no (more) waves */\n\tcurrent(): AttackWave | undefined {\n\t\tconst { waves } = this.options\n\t\tif (!waves) return undefined\n\t\tif (typeof waves === 'function') return waves(this.ai, this.memory.index)\n\t\treturn waves[this.memory.entry]\n\t}\n\n\t/** A wave's group as units by type or role: the group named, or the units given in place. None for a name not given */\n\tgroupOf(wave: AttackWave): AttackGroup | undefined {\n\t\tif (typeof wave.group !== 'string') return { id: `wave ${this.memory.index + 1}`, units: wave.group }\n\t\treturn this.options.groups?.find((group) => group.id === wave.group)\n\t}\n\n\t/**\n\t * Whether a unit counts as one of a key of a group: of the type by id where a type has the id, else of the role. A\n\t * key that is both (the fixture's `soldier`) is the type: an archer, a soldier by role, is not one of `soldier: 4`\n\t */\n\tprivate matches(unit: EntityState, key: string): boolean {\n\t\tif (this.ai.registry.units.has(key)) return unit.type === key\n\t\treturn this.ai.view.hasRole(unit, key)\n\t}\n\n\t/** The type trained for a key of a group: the type of that id, or the first of the role it can make */\n\tprivate typeFor(key: string): UnitTypeDef | undefined {\n\t\tconst { registry, view } = this.ai\n\t\tif (registry.units.has(key)) return registry.unit(key)\n\t\treturn view.typesOf(key).find((def) => def.kind === 'unit')\n\t}\n\n\t/** The units free for a wave: in the pool (nothing holds them), idle or on their way to nothing, fighters */\n\tprivate free(): EntityState[] {\n\t\treturn this.ai.squads\n\t\t\t.pool()\n\t\t\t.fighters()\n\t\t\t.where((unit) => unit.own?.order !== 'harvest').items as EntityState[]\n\t}\n\n\t/** For each key of the group, the free units that count as it, at most as many as wanted, each unit once */\n\tprivate chosen(group: AttackGroup): Map<string, EntityState[]> {\n\t\tconst taken = new Set<number>()\n\t\tconst by = new Map<string, EntityState[]>()\n\t\tconst free = this.free()\n\t\tfor (const [key, count] of Object.entries(group.units)) {\n\t\t\tconst units: EntityState[] = []\n\t\t\tfor (const unit of free) {\n\t\t\t\tif (units.length >= count) break\n\t\t\t\tif (taken.has(unit.id) || !this.matches(unit, key)) continue\n\t\t\t\ttaken.add(unit.id)\n\t\t\t\tunits.push(unit)\n\t\t\t}\n\t\t\tby.set(key, units)\n\t\t}\n\t\treturn by\n\t}\n\n\t/** Where a wave goes, as its target says: their base nearest home when it says nothing. None where nothing is known */\n\ttargetOf(wave: AttackWave): Vec2 | undefined {\n\t\tconst { ai } = this\n\t\tconst target = wave.target ?? 'nearestBase'\n\t\tif (typeof target === 'function') return target(ai)\n\t\tif (typeof target === 'object') return point(target)\n\t\tconst home = ai.view.home()\n\t\tconst from = home ? point(home) : { x: 0, z: 0 }\n\t\tconst knows = ai.def.knowledge !== false\n\t\tconst bases = knows ? ai.knowledge.enemy.bases().filter((base) => !base.gone) : []\n\t\tconst told = ai.options.enemyBases ?? []\n\t\tconst nearest = (places: readonly Vec2[]) =>\n\t\t\tplaces.reduce<Vec2 | undefined>((best, each) => (!best || distSq(each, from) < distSq(best, from) ? each : best), undefined)\n\t\tswitch (target) {\n\t\t\tcase 'army': {\n\t\t\t\tconst army = knows ? ai.knowledge.enemy.armySeen()[0] : undefined\n\t\t\t\tif (army) return point(army.at)\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tcase 'expansion': {\n\t\t\t\tconst expansion = nearest(bases.filter((base) => base.expansion).map((base) => base.at))\n\t\t\t\tif (expansion) return point(expansion)\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tcase 'weakestBase': {\n\t\t\t\t// the fewest of their buildings that shoot remembered there, and the least of their strength seen near it\n\t\t\t\tconst threat = ai.view.threat\n\t\t\t\tlet best: { at: Vec2; score: number } | undefined\n\t\t\t\tfor (const base of bases) {\n\t\t\t\t\tconst score = threat.at(base.at, { remembered: true }).enemy\n\t\t\t\t\tif (!best || score < best.score) best = { at: base.at, score }\n\t\t\t\t}\n\t\t\t\tif (best) return point(best.at)\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tconst known = nearest(bases.map((base) => base.at))\n\t\tif (known) return point(known)\n\t\treturn told.length ? point(told[this.memory.index % told.length]) : undefined\n\t}\n\n\t/** Where a wave gathers: the place given (by name or as a point), or a little out of home towards its target */\n\trallyOf(wave: AttackWave, target: Vec2 | undefined): Vec2 | undefined {\n\t\tconst { ai } = this\n\t\tif (typeof wave.rally === 'string') {\n\t\t\tconst named = ai.view.named(wave.rally)\n\t\t\treturn named ? point(named) : undefined\n\t\t}\n\t\tif (wave.rally) return point(wave.rally)\n\t\tconst home = ai.view.home()\n\t\tif (!home) return undefined\n\t\tif (!target) return point(home)\n\t\tconst dx = target.x - home.x\n\t\tconst dz = target.z - home.z\n\t\tconst length = Math.sqrt(dx * dx + dz * dz) || 1\n\t\treturn { x: home.x + (dx / length) * RALLY_OUT, z: home.z + (dz / length) * RALLY_OUT }\n\t}\n\n\t/**\n\t * The think, once a think: the wave whose turn it is skipped where its condition fails; its group wanted of the\n\t * production plan; once enough of it is free and its time has come, sent (a squad that gathers, then attacks), the\n\t * next wave's turn begun. Without waves, nothing\n\t */\n\tthink(): void {\n\t\tconst { ai } = this\n\t\tif (this.thoughtAt === ai.tick) return\n\t\tthis.thoughtAt = ai.tick\n\t\t// the waves that are done (cleared, fallen back, or wiped) let go of: their units back to the pool for the next\n\t\tfor (const squad of ai.squads.of(OWNER).squads) if (squad.idle) ai.squads.disband(squad, `wave over: ${squad.done ?? 'idle'}`)\n\t\tconst wave = this.current()\n\t\tif (!wave) {\n\t\t\tthis.dropWants()\n\t\t\tthis.status = this.options.waves ? 'no more waves' : 'no waves'\n\t\t\treturn\n\t\t}\n\t\tconst group = this.groupOf(wave)\n\t\tif (!group) {\n\t\t\tthis.status = `no group \"${String(wave.group)}\"`\n\t\t\tif (!this.warned) {\n\t\t\t\tthis.warned = true\n\t\t\t\tai.log.warn('ai', `a wave names the group \"${String(wave.group)}\", which no group is: it is skipped`)\n\t\t\t}\n\t\t\tthis.next(true)\n\t\t\treturn\n\t\t}\n\t\tif ((wave.when && !evaluate(wave.when, ai)) || (group.when && !evaluate(group.when, ai))) {\n\t\t\tai.decide(`skips wave ${this.memory.index + 1}: its condition does not hold`, { kind: 'waves' })\n\t\t\tthis.next(true)\n\t\t\treturn\n\t\t}\n\t\tconst chosen = this.chosen(group)\n\t\tif (this.options.train ?? true) this.want(group, chosen)\n\t\tconst total = Object.values(group.units).reduce((sum, count) => sum + count, 0)\n\t\tconst have = [...chosen.values()].reduce((sum, units) => sum + units.length, 0)\n\t\tconst enough = Math.max(1, Math.ceil(total * Math.min(1, Math.max(0, wave.minForces ?? 1))))\n\t\tconst due = this.memory.last + Math.round((wave.after ?? 0) * ai.session.tickRate)\n\t\tif (ai.tick < due) {\n\t\t\tthis.status = `waits ${Math.ceil((due - ai.tick) / ai.session.tickRate)} s more (${have} of ${total})`\n\t\t\treturn\n\t\t}\n\t\tif (have < enough) {\n\t\t\tthis.status = `builds up: ${have} of ${total}, ${enough} enough`\n\t\t\treturn\n\t\t}\n\t\tconst target = this.targetOf(wave)\n\t\tif (!target) {\n\t\t\tthis.status = 'nowhere to go'\n\t\t\treturn\n\t\t}\n\t\t// with its team, at the time the team's plan says (C5): the plan standing joined (one whose time went by unjoined\n\t\t// is too late to join), or a plan proposed; the wave waits for its time\n\t\tlet plan = wave.together && ai.area(Team).enabled ? ai.area(Team).plan : undefined\n\t\tif (wave.together && ai.area(Team).enabled) {\n\t\t\tif (plan && !plan.joined.includes(ai.playerId) && ai.tick >= plan.at) plan = undefined\n\t\t\tif (!plan) plan = ai.area(Team).propose(target)\n\t\t\telse if (!plan.joined.includes(ai.playerId)) ai.area(Team).join()\n\t\t\tif (ai.tick < plan.at) {\n\t\t\t\tthis.status = `waits for its team: goes in ${Math.ceil((plan.at - ai.tick) / ai.session.tickRate)} s`\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t\tthis.send(wave, chosen, plan?.target ?? target)\n\t\tthis.next(false)\n\t}\n\n\tprivate warned = false\n\n\t/** The group's units wanted of the production plan: as many more of each type as the free ones fall short of */\n\tprivate want(group: AttackGroup, chosen: Map<string, EntityState[]>): void {\n\t\tconst { ai } = this\n\t\tconst keys = new Set<string>()\n\t\tfor (const [key, count] of Object.entries(group.units)) {\n\t\t\tconst type = this.typeFor(key)\n\t\t\tif (!type) continue\n\t\t\tconst id = `${WANT}${key}`\n\t\t\tkeys.add(id)\n\t\t\tconst free = chosen.get(key)?.length ?? 0\n\t\t\t// those it has of the type, less the free ones counted, and the group's: what is out or busy stays out of it. A\n\t\t\t// number, worked out each think: plain data, so that a save keeps the want and a loaded game trains alike\n\t\t\tai.plans.want({\n\t\t\t\tid,\n\t\t\t\ttype: type.id,\n\t\t\t\tcount: ai.view.mine.ofType(type.id).length - free + count,\n\t\t\t\tpriority: this.options.priority ?? 30,\n\t\t\t\tby: `wave ${this.memory.index + 1}`\n\t\t\t})\n\t\t}\n\t\tfor (const want of ai.plans.build.list()) if (want.id?.startsWith(WANT) && !keys.has(want.id)) ai.plans.drop(want.id)\n\t}\n\n\t/** The wants of a wave's units let go of */\n\tprivate dropWants(): void {\n\t\tconst { ai } = this\n\t\tfor (const want of ai.plans.build.list()) if (want.id?.startsWith(WANT)) ai.plans.drop(want.id)\n\t}\n\n\t/** A wave sent: its units a squad that gathers at the rally, then attacks; said, noted, written down */\n\tprivate send(wave: AttackWave, chosen: Map<string, EntityState[]>, target: Vec2): Squad {\n\t\tconst { ai } = this\n\t\tconst units = [...chosen.values()].flat()\n\t\tconst index = this.memory.index + 1\n\t\tconst name = `wave ${index}`\n\t\tconst rally = this.rallyOf(wave, target) ?? target\n\t\tconst squad = ai.squads.make(name, units, { owner: OWNER })\n\t\tsquad.gather(rally, { minForces: wave.minForces ?? 1, seconds: wave.gatherFor ?? 15, then: { kind: 'attack', data: { at: point(target) } } })\n\t\tai.knowledge.own.attackSent(target, units.length)\n\t\tai.area(Team).say('attacking')\n\t\tconst sent = { index: this.memory.index, squad: name, size: units.length, at: point(target), tick: ai.tick }\n\t\tthis.memory.sent.push(sent)\n\t\tif (this.memory.sent.length > SENT_KEPT) this.memory.sent.splice(0, this.memory.sent.length - SENT_KEPT)\n\t\tconst made = [...chosen.entries()].filter(([, each]) => each.length).map(([key, each]) => `${each.length} ${key}`)\n\t\tai.decide(`sends wave ${index}: ${made.join(', ')}, gathering at ${where(rally)} for ${wave.gatherFor ?? 15} s, then at ${where(target)}`, {\n\t\t\tkind: 'waves'\n\t\t})\n\t\tthis.status = `sent ${name}`\n\t\treturn squad\n\t}\n\n\t/** On to the next wave's turn: the same again where it repeats, else the next of the list */\n\tprivate next(skipped: boolean): void {\n\t\tconst { memory } = this\n\t\tconst wave = this.current()\n\t\tmemory.index++\n\t\tmemory.last = this.ai.tick\n\t\tif (skipped) memory.skipped++\n\t\tconst repeat = skipped ? false : wave?.repeat\n\t\tmemory.went++\n\t\tif (repeat === true || (typeof repeat === 'number' && memory.went < repeat)) return\n\t\tmemory.entry++\n\t\tmemory.went = 0\n\t}\n\n\t/** The waves as the report shows them */\n\treport(): WavesReport {\n\t\tconst { ai } = this\n\t\tconst wave = this.enabled ? this.current() : undefined\n\t\tconst group = wave && this.groupOf(wave)\n\t\tconst chosen = group ? this.chosen(group) : undefined\n\t\tconst due = wave ? this.memory.last + Math.round((wave.after ?? 0) * ai.session.tickRate) : 0\n\t\treturn {\n\t\t\tindex: this.memory.index,\n\t\t\t...(wave &&\n\t\t\t\tgroup &&\n\t\t\t\tchosen && {\n\t\t\t\t\tcurrent: {\n\t\t\t\t\t\tunits: Object.fromEntries(Object.entries(group.units).map(([key, count]) => [key, [chosen.get(key)?.length ?? 0, count]])) as Record<\n\t\t\t\t\t\t\tstring,\n\t\t\t\t\t\t\t[number, number]\n\t\t\t\t\t\t>,\n\t\t\t\t\t\tin: Math.max(0, Math.ceil((due - ai.tick) / ai.session.tickRate)),\n\t\t\t\t\t\tready: this.status.startsWith('sent'),\n\t\t\t\t\t\tstatus: this.status\n\t\t\t\t\t}\n\t\t\t\t}),\n\t\t\tsent: this.memory.sent.map((each) => ({ index: each.index, squad: each.squad, size: each.size, at: pair(each.at), tick: each.tick })),\n\t\t\tskipped: this.memory.skipped\n\t\t}\n\t}\n\n\t/** What it remembers, for a save: a copy */\n\t/** Whether it has anything to remember now: one that does not is left out of a save */\n\tremembers(): boolean {\n\t\treturn this.enabled\n\t}\n\n\t/** Its part of the brain's report */\n\treportTo(report: AiReport): void {\n\t\tif (this.enabled) report.waves = this.report()\n\t}\n\n\t/** Gives a copy of the waves' memory, for a save of the brain */\n\tsave(): WavesMemory {\n\t\treturn structuredClone(this.memory)\n\t}\n\n\t/** Takes back what `save` gave: whether it was read */\n\trestore(memory: unknown): boolean {\n\t\tconst given = memory as WavesMemory | undefined\n\t\tif (!given || typeof given !== 'object' || given.v !== 1) return false\n\t\tthis.memory = {\n\t\t\tv: 1,\n\t\t\tindex: given.index ?? 0,\n\t\t\tentry: given.entry ?? 0,\n\t\t\twent: given.went ?? 0,\n\t\t\tlast: given.last ?? 0,\n\t\t\tsent: structuredClone(given.sent ?? []),\n\t\t\tskipped: given.skipped ?? 0\n\t\t}\n\t\treturn true\n\t}\n}\n\n/**\n * The waves module: the wave whose turn it is, each think (`ai.waves.think`): its group wanted, sent once enough of it is\n * free and its time has come, gathering at the rally, then attacking. Idle without waves given. With how it sends waves\n * where the brain's definition and the seat's options say nothing (`WavesOptions`)\n *\n * @beta\n */\nexport const waves = (options: WavesOptions = {}): AiModuleDef =>\n\tdefineModule({ id: 'waves', make: (ai: Brain): AiModule => {\n\t\tai.area(Waves).configure(options)\n\t\treturn {\n\t\t\tid: 'waves',\n\t\t\tphase: 'act',\n\t\t\tafter: ['goals'],\n\t\t\tbefore: ['squads'],\n\t\t\tthink: () => ai.area(Waves).think()\n\t\t}\n\t} })\n\ndeclare module './area' {\n\tinterface AreaMemories {\n\t\twaves?: WavesMemory\n\t}\n}\n"],"mappings":";;;;;;;AAgJA,IAAM,YAAY;;AAElB,IAAM,YAAY;;AAElB,IAAM,OAAO;;AAEb,IAAM,QAAQ;;;;;;;AAQd,IAAa,QAAb,MAAa,MAAwB;CAqB1B;;CAnBV,OAAgB,KAAK;;CAErB,OAAO,KAAK,IAAkB;EAC7B,OAAO,IAAI,MAAM,EAAE;CACpB;;CAEA,KAAc;;CAEd,SAAkB;;CAGlB,UAAU;CACV,SAA8B;EAAE,GAAG;EAAG,OAAO;EAAG,OAAO;EAAG,MAAM;EAAG,MAAM;EAAG,MAAM,CAAC;EAAG,SAAS;CAAE;CACjG,gBAAsC,CAAC;CACvC,YAAoB;CACpB,SAAiB;CAEjB,YAEC,IACC;EADQ,KAAA,KAAA;CACP;;;;;CAMH,UAAU,SAA6B;EACtC,KAAK,gBAAgB;EACrB,KAAK,UAAU;EACf,MAAM,EAAE,eAAe,KAAK,GAAG;EAC/B,MAAM,SAAS,WAAW,SAAS;EACnC,WAAW,UAAU,EACpB,eAAe,UAAiB;GAC/B,IAAI,MAAM,KAAK,KAAK,CAAC,CAAC,QAAQ,OAAO,CAAC;GACtC,OAAO,OAAO,WAAW,aAAa,OAAO,KAAK,IAAI;EACvD,GACD,CAAC;CACF;;CAGA,IAAI,UAAwB;EAC3B,MAAM,WAAW,KAAK,GAAG,SAAS;EAClC,MAAM,SAAS,UAAU,UAAU,KAAK,cAAc,SAAS,CAAC,GAAG,KAAK,cAAc,QAAQ,GAAG,SAAS,MAAM,IAAI,KAAA;EACpH,OAAO;GAAE,GAAG,KAAK;GAAe,GAAG;GAAU,GAAI,UAAU,EAAE,OAAO;EAAG;CACxE;;CAGA,IAAI,QAAiB;EACpB,OAAO,KAAK,WAAW,KAAK,QAAQ,UAAU,KAAA;CAC/C;;CAGA,IAAI,SAAkB;EACrB,OAAO,KAAK,SAAS,KAAK,QAAQ,MAAM,KAAA;CACzC;;CAGA,IAAI,QAAgB;EACnB,OAAO,KAAK,OAAO;CACpB;;CAGA,UAAkC;EACjC,MAAM,EAAE,UAAU,KAAK;EACvB,IAAI,CAAC,OAAO,OAAO,KAAA;EACnB,IAAI,OAAO,UAAU,YAAY,OAAO,MAAM,KAAK,IAAI,KAAK,OAAO,KAAK;EACxE,OAAO,MAAM,KAAK,OAAO;CAC1B;;CAGA,QAAQ,MAA2C;EAClD,IAAI,OAAO,KAAK,UAAU,UAAU,OAAO;GAAE,IAAI,QAAQ,KAAK,OAAO,QAAQ;GAAK,OAAO,KAAK;EAAM;EACpG,OAAO,KAAK,QAAQ,QAAQ,MAAM,UAAU,MAAM,OAAO,KAAK,KAAK;CACpE;;;;;CAMA,QAAgB,MAAmB,KAAsB;EACxD,IAAI,KAAK,GAAG,SAAS,MAAM,IAAI,GAAG,GAAG,OAAO,KAAK,SAAS;EAC1D,OAAO,KAAK,GAAG,KAAK,QAAQ,MAAM,GAAG;CACtC;;CAGA,QAAgB,KAAsC;EACrD,MAAM,EAAE,UAAU,SAAS,KAAK;EAChC,IAAI,SAAS,MAAM,IAAI,GAAG,GAAG,OAAO,SAAS,KAAK,GAAG;EACrD,OAAO,KAAK,QAAQ,GAAG,CAAC,CAAC,MAAM,QAAQ,IAAI,SAAS,MAAM;CAC3D;;CAGA,OAA8B;EAC7B,OAAO,KAAK,GAAG,OACb,KAAK,CAAC,CACN,SAAS,CAAC,CACV,OAAO,SAAS,KAAK,KAAK,UAAU,SAAS,CAAC,CAAC;CAClD;;CAGA,OAAe,OAAgD;EAC9D,MAAM,wBAAQ,IAAI,IAAY;EAC9B,MAAM,qBAAK,IAAI,IAA2B;EAC1C,MAAM,OAAO,KAAK,KAAK;EACvB,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,KAAK,GAAG;GACvD,MAAM,QAAuB,CAAC;GAC9B,KAAK,MAAM,QAAQ,MAAM;IACxB,IAAI,MAAM,UAAU,OAAO;IAC3B,IAAI,MAAM,IAAI,KAAK,EAAE,KAAK,CAAC,KAAK,QAAQ,MAAM,GAAG,GAAG;IACpD,MAAM,IAAI,KAAK,EAAE;IACjB,MAAM,KAAK,IAAI;GAChB;GACA,GAAG,IAAI,KAAK,KAAK;EAClB;EACA,OAAO;CACR;;CAGA,SAAS,MAAoC;EAC5C,MAAM,EAAE,OAAO;EACf,MAAM,SAAS,KAAK,UAAU;EAC9B,IAAI,OAAO,WAAW,YAAY,OAAO,OAAO,EAAE;EAClD,IAAI,OAAO,WAAW,UAAU,OAAO,MAAM,MAAM;EACnD,MAAM,OAAO,GAAG,KAAK,KAAK;EAC1B,MAAM,OAAO,OAAO,MAAM,IAAI,IAAI;GAAE,GAAG;GAAG,GAAG;EAAE;EAC/C,MAAM,QAAQ,GAAG,IAAI,cAAc;EACnC,MAAM,QAAQ,QAAQ,GAAG,UAAU,MAAM,MAAM,CAAC,CAAC,QAAQ,SAAS,CAAC,KAAK,IAAI,IAAI,CAAC;EACjF,MAAM,OAAO,GAAG,QAAQ,cAAc,CAAC;EACvC,MAAM,WAAW,WAChB,OAAO,QAA0B,MAAM,SAAU,CAAC,QAAQ,OAAO,MAAM,IAAI,IAAI,OAAO,MAAM,IAAI,IAAI,OAAO,MAAO,KAAA,CAAS;EAC5H,QAAQ,QAAR;GACC,KAAK,QAAQ;IACZ,MAAM,OAAO,QAAQ,GAAG,UAAU,MAAM,SAAS,CAAC,CAAC,KAAK,KAAA;IACxD,IAAI,MAAM,OAAO,MAAM,KAAK,EAAE;IAC9B;GACD;GACA,KAAK,aAAa;IACjB,MAAM,YAAY,QAAQ,MAAM,QAAQ,SAAS,KAAK,SAAS,CAAC,CAAC,KAAK,SAAS,KAAK,EAAE,CAAC;IACvF,IAAI,WAAW,OAAO,MAAM,SAAS;IACrC;GACD;GACA,KAAK,eAAe;IAEnB,MAAM,SAAS,GAAG,KAAK;IACvB,IAAI;IACJ,KAAK,MAAM,QAAQ,OAAO;KACzB,MAAM,QAAQ,OAAO,GAAG,KAAK,IAAI,EAAE,YAAY,KAAK,CAAC,CAAC,CAAC;KACvD,IAAI,CAAC,QAAQ,QAAQ,KAAK,OAAO,OAAO;MAAE,IAAI,KAAK;MAAI;KAAM;IAC9D;IACA,IAAI,MAAM,OAAO,MAAM,KAAK,EAAE;IAC9B;GACD;EACD;EACA,MAAM,QAAQ,QAAQ,MAAM,KAAK,SAAS,KAAK,EAAE,CAAC;EAClD,IAAI,OAAO,OAAO,MAAM,KAAK;EAC7B,OAAO,KAAK,SAAS,MAAM,KAAK,KAAK,OAAO,QAAQ,KAAK,OAAO,IAAI,KAAA;CACrE;;CAGA,QAAQ,MAAkB,QAA4C;EACrE,MAAM,EAAE,OAAO;EACf,IAAI,OAAO,KAAK,UAAU,UAAU;GACnC,MAAM,QAAQ,GAAG,KAAK,MAAM,KAAK,KAAK;GACtC,OAAO,QAAQ,MAAM,KAAK,IAAI,KAAA;EAC/B;EACA,IAAI,KAAK,OAAO,OAAO,MAAM,KAAK,KAAK;EACvC,MAAM,OAAO,GAAG,KAAK,KAAK;EAC1B,IAAI,CAAC,MAAM,OAAO,KAAA;EAClB,IAAI,CAAC,QAAQ,OAAO,MAAM,IAAI;EAC9B,MAAM,KAAK,OAAO,IAAI,KAAK;EAC3B,MAAM,KAAK,OAAO,IAAI,KAAK;EAC3B,MAAM,SAAS,KAAK,KAAK,KAAK,KAAK,KAAK,EAAE,KAAK;EAC/C,OAAO;GAAE,GAAG,KAAK,IAAK,KAAK,SAAU;GAAW,GAAG,KAAK,IAAK,KAAK,SAAU;EAAU;CACvF;;;;;;CAOA,QAAc;EACb,MAAM,EAAE,OAAO;EACf,IAAI,KAAK,cAAc,GAAG,MAAM;EAChC,KAAK,YAAY,GAAG;EAEpB,KAAK,MAAM,SAAS,GAAG,OAAO,GAAG,KAAK,CAAC,CAAC,QAAQ,IAAI,MAAM,MAAM,GAAG,OAAO,QAAQ,OAAO,cAAc,MAAM,QAAQ,QAAQ;EAC7H,MAAM,OAAO,KAAK,QAAQ;EAC1B,IAAI,CAAC,MAAM;GACV,KAAK,UAAU;GACf,KAAK,SAAS,KAAK,QAAQ,QAAQ,kBAAkB;GACrD;EACD;EACA,MAAM,QAAQ,KAAK,QAAQ,IAAI;EAC/B,IAAI,CAAC,OAAO;GACX,KAAK,SAAS,aAAa,OAAO,KAAK,KAAK,EAAE;GAC9C,IAAI,CAAC,KAAK,QAAQ;IACjB,KAAK,SAAS;IACd,GAAG,IAAI,KAAK,MAAM,2BAA2B,OAAO,KAAK,KAAK,EAAE,oCAAoC;GACrG;GACA,KAAK,KAAK,IAAI;GACd;EACD;EACA,IAAK,KAAK,QAAQ,CAAC,SAAS,KAAK,MAAM,EAAE,KAAO,MAAM,QAAQ,CAAC,SAAS,MAAM,MAAM,EAAE,GAAI;GACzF,GAAG,OAAO,cAAc,KAAK,OAAO,QAAQ,EAAE,gCAAgC,EAAE,MAAM,QAAQ,CAAC;GAC/F,KAAK,KAAK,IAAI;GACd;EACD;EACA,MAAM,SAAS,KAAK,OAAO,KAAK;EAChC,IAAI,KAAK,QAAQ,SAAS,MAAM,KAAK,KAAK,OAAO,MAAM;EACvD,MAAM,QAAQ,OAAO,OAAO,MAAM,KAAK,CAAC,CAAC,QAAQ,KAAK,UAAU,MAAM,OAAO,CAAC;EAC9E,MAAM,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC,CAAC,QAAQ,KAAK,UAAU,MAAM,MAAM,QAAQ,CAAC;EAC9E,MAAM,SAAS,KAAK,IAAI,GAAG,KAAK,KAAK,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,aAAa,CAAC,CAAC,CAAC,CAAC;EAC3F,MAAM,MAAM,KAAK,OAAO,OAAO,KAAK,OAAO,KAAK,SAAS,KAAK,GAAG,QAAQ,QAAQ;EACjF,IAAI,GAAG,OAAO,KAAK;GAClB,KAAK,SAAS,SAAS,KAAK,MAAM,MAAM,GAAG,QAAQ,GAAG,QAAQ,QAAQ,EAAE,WAAW,KAAK,MAAM,MAAM;GACpG;EACD;EACA,IAAI,OAAO,QAAQ;GAClB,KAAK,SAAS,cAAc,KAAK,MAAM,MAAM,IAAI,OAAO;GACxD;EACD;EACA,MAAM,SAAS,KAAK,SAAS,IAAI;EACjC,IAAI,CAAC,QAAQ;GACZ,KAAK,SAAS;GACd;EACD;EAGA,IAAI,OAAO,KAAK,YAAY,GAAG,KAAK,IAAI,CAAC,CAAC,UAAU,GAAG,KAAK,IAAI,CAAC,CAAC,OAAO,KAAA;EACzE,IAAI,KAAK,YAAY,GAAG,KAAK,IAAI,CAAC,CAAC,SAAS;GAC3C,IAAI,QAAQ,CAAC,KAAK,OAAO,SAAS,GAAG,QAAQ,KAAK,GAAG,QAAQ,KAAK,IAAI,OAAO,KAAA;GAC7E,IAAI,CAAC,MAAM,OAAO,GAAG,KAAK,IAAI,CAAC,CAAC,QAAQ,MAAM;QACzC,IAAI,CAAC,KAAK,OAAO,SAAS,GAAG,QAAQ,GAAG,GAAG,KAAK,IAAI,CAAC,CAAC,KAAK;GAChE,IAAI,GAAG,OAAO,KAAK,IAAI;IACtB,KAAK,SAAS,+BAA+B,KAAK,MAAM,KAAK,KAAK,GAAG,QAAQ,GAAG,QAAQ,QAAQ,EAAE;IAClG;GACD;EACD;EACA,KAAK,KAAK,MAAM,QAAQ,MAAM,UAAU,MAAM;EAC9C,KAAK,KAAK,KAAK;CAChB;CAEA,SAAiB;;CAGjB,KAAa,OAAoB,QAA0C;EAC1E,MAAM,EAAE,OAAO;EACf,MAAM,uBAAO,IAAI,IAAY;EAC7B,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,KAAK,GAAG;GACvD,MAAM,OAAO,KAAK,QAAQ,GAAG;GAC7B,IAAI,CAAC,MAAM;GACX,MAAM,KAAK,GAAG,OAAO;GACrB,KAAK,IAAI,EAAE;GACX,MAAM,OAAO,OAAO,IAAI,GAAG,CAAC,EAAE,UAAU;GAGxC,GAAG,MAAM,KAAK;IACb;IACA,MAAM,KAAK;IACX,OAAO,GAAG,KAAK,KAAK,OAAO,KAAK,EAAE,CAAC,CAAC,SAAS,OAAO;IACpD,UAAU,KAAK,QAAQ,YAAY;IACnC,IAAI,QAAQ,KAAK,OAAO,QAAQ;GACjC,CAAC;EACF;EACA,KAAK,MAAM,QAAQ,GAAG,MAAM,MAAM,KAAK,GAAG,IAAI,KAAK,IAAI,WAAW,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,EAAE,GAAG,GAAG,MAAM,KAAK,KAAK,EAAE;CACrH;;CAGA,YAA0B;EACzB,MAAM,EAAE,OAAO;EACf,KAAK,MAAM,QAAQ,GAAG,MAAM,MAAM,KAAK,GAAG,IAAI,KAAK,IAAI,WAAW,IAAI,GAAG,GAAG,MAAM,KAAK,KAAK,EAAE;CAC/F;;CAGA,KAAa,MAAkB,QAAoC,QAAqB;EACvF,MAAM,EAAE,OAAO;EACf,MAAM,QAAQ,CAAC,GAAG,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK;EACxC,MAAM,QAAQ,KAAK,OAAO,QAAQ;EAClC,MAAM,OAAO,QAAQ;EACrB,MAAM,QAAQ,KAAK,QAAQ,MAAM,MAAM,KAAK;EAC5C,MAAM,QAAQ,GAAG,OAAO,KAAK,MAAM,OAAO,EAAE,OAAO,MAAM,CAAC;EAC1D,MAAM,OAAO,OAAO;GAAE,WAAW,KAAK,aAAa;GAAG,SAAS,KAAK,aAAa;GAAI,MAAM;IAAE,MAAM;IAAU,MAAM,EAAE,IAAI,MAAM,MAAM,EAAE;GAAE;EAAE,CAAC;EAC5I,GAAG,UAAU,IAAI,WAAW,QAAQ,MAAM,MAAM;EAChD,GAAG,KAAK,IAAI,CAAC,CAAC,IAAI,WAAW;EAC7B,MAAM,OAAO;GAAE,OAAO,KAAK,OAAO;GAAO,OAAO;GAAM,MAAM,MAAM;GAAQ,IAAI,MAAM,MAAM;GAAG,MAAM,GAAG;EAAK;EAC3G,KAAK,OAAO,KAAK,KAAK,IAAI;EAC1B,IAAI,KAAK,OAAO,KAAK,SAAS,WAAW,KAAK,OAAO,KAAK,OAAO,GAAG,KAAK,OAAO,KAAK,SAAS,SAAS;EACvG,MAAM,OAAO,CAAC,GAAG,OAAO,QAAQ,CAAC,CAAC,CAAC,QAAQ,GAAG,UAAU,KAAK,MAAM,CAAC,CAAC,KAAK,CAAC,KAAK,UAAU,GAAG,KAAK,OAAO,GAAG,KAAK;EACjH,GAAG,OAAO,cAAc,MAAM,IAAI,KAAK,KAAK,IAAI,EAAE,iBAAiB,MAAM,KAAK,EAAE,OAAO,KAAK,aAAa,GAAG,cAAc,MAAM,MAAM,KAAK,EAC1I,MAAM,QACP,CAAC;EACD,KAAK,SAAS,QAAQ;EACtB,OAAO;CACR;;CAGA,KAAa,SAAwB;EACpC,MAAM,EAAE,WAAW;EACnB,MAAM,OAAO,KAAK,QAAQ;EAC1B,OAAO;EACP,OAAO,OAAO,KAAK,GAAG;EACtB,IAAI,SAAS,OAAO;EACpB,MAAM,SAAS,UAAU,QAAQ,MAAM;EACvC,OAAO;EACP,IAAI,WAAW,QAAS,OAAO,WAAW,YAAY,OAAO,OAAO,QAAS;EAC7E,OAAO;EACP,OAAO,OAAO;CACf;;CAGA,SAAsB;EACrB,MAAM,EAAE,OAAO;EACf,MAAM,OAAO,KAAK,UAAU,KAAK,QAAQ,IAAI,KAAA;EAC7C,MAAM,QAAQ,QAAQ,KAAK,QAAQ,IAAI;EACvC,MAAM,SAAS,QAAQ,KAAK,OAAO,KAAK,IAAI,KAAA;EAC5C,MAAM,MAAM,OAAO,KAAK,OAAO,OAAO,KAAK,OAAO,KAAK,SAAS,KAAK,GAAG,QAAQ,QAAQ,IAAI;EAC5F,OAAO;GACN,OAAO,KAAK,OAAO;GACnB,GAAI,QACH,SACA,UAAU,EACT,SAAS;IACR,OAAO,OAAO,YAAY,OAAO,QAAQ,MAAM,KAAK,CAAC,CAAC,KAAK,CAAC,KAAK,WAAW,CAAC,KAAK,CAAC,OAAO,IAAI,GAAG,CAAC,EAAE,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC;IAIzH,IAAI,KAAK,IAAI,GAAG,KAAK,MAAM,MAAM,GAAG,QAAQ,GAAG,QAAQ,QAAQ,CAAC;IAChE,OAAO,KAAK,OAAO,WAAW,MAAM;IACpC,QAAQ,KAAK;GACd,EACD;GACD,MAAM,KAAK,OAAO,KAAK,KAAK,UAAU;IAAE,OAAO,KAAK;IAAO,OAAO,KAAK;IAAO,MAAM,KAAK;IAAM,IAAI,KAAK,KAAK,EAAE;IAAG,MAAM,KAAK;GAAK,EAAE;GACpI,SAAS,KAAK,OAAO;EACtB;CACD;;;CAIA,YAAqB;EACpB,OAAO,KAAK;CACb;;CAGA,SAAS,QAAwB;EAChC,IAAI,KAAK,SAAS,OAAO,QAAQ,KAAK,OAAO;CAC9C;;CAGA,OAAoB;EACnB,OAAO,gBAAgB,KAAK,MAAM;CACnC;;CAGA,QAAQ,QAA0B;EACjC,MAAM,QAAQ;EACd,IAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,MAAM,GAAG,OAAO;EACjE,KAAK,SAAS;GACb,GAAG;GACH,OAAO,MAAM,SAAS;GACtB,OAAO,MAAM,SAAS;GACtB,MAAM,MAAM,QAAQ;GACpB,MAAM,MAAM,QAAQ;GACpB,MAAM,gBAAgB,MAAM,QAAQ,CAAC,CAAC;GACtC,SAAS,MAAM,WAAW;EAC3B;EACA,OAAO;CACR;AACD;;;;;;;;AASA,IAAa,SAAS,UAAwB,CAAC,MAC9C,aAAa;CAAE,IAAI;CAAS,OAAO,OAAwB;EAC1D,GAAG,KAAK,KAAK,CAAC,CAAC,UAAU,OAAO;EAChC,OAAO;GACN,IAAI;GACJ,OAAO;GACP,OAAO,CAAC,OAAO;GACf,QAAQ,CAAC,QAAQ;GACjB,aAAa,GAAG,KAAK,KAAK,CAAC,CAAC,MAAM;EACnC;CACD;AAAE,CAAC"}