@v12-engine/engine 0.1.1 → 0.4.0

package/dist/packs/pack.d.ts

@@ -1,23 +1,23 @@
-import type { EffectKind } from '#engine/abilities/effects';
+import type { EffectType } from '#engine/abilities/effects';
 import type { CommandDef } from '#engine/commands';
 import type { Component } from '#engine/components';
 import type { ListenerDef } from '#engine/events';
 import type { HookDef } from '#engine/hooks';
 import type { OrderBehavior, SystemDef } from '#engine/registry';
-import type { StatPart } from '#engine/stats';
+import type { StatField } from '#engine/stats';
 import type { StatDef } from '#engine/defs';
 import type { EventKey } from '#engine/events';
-import type { ReplicatedEvent, SnapshotPart } from '#engine/replication';
+import type { ReplicatedEvent, SnapshotField } from '#engine/replication';
 import type { PlayerId } from '#engine/entity';
 import type { GameMap } from '#engine/map';
 import type { MapProblem } from '#engine/mapFields';
 import type { Registry } from '#engine/registry';
-import type { GameRules, RulesInit } from '#engine/rules';
+import type { RuleSettings, RuleSettingsInit } from '#engine/rules';
 import type { World } from '#engine/world';
 import type { TimerDef } from '#engine/timers';
 /**
- * A part of the rules a game opts into (`GameModule.packs`): commands, orders, systems, hooks and the state it keeps,
- * which a game without it pays nothing for. The engine's heroes, camps and shops are one (`withHeroes`). A game's
+ * A part of the rules a game opts into (`Rules.packs`): commands, orders, systems, hooks and the state it keeps,
+ * which a game without it pays nothing for. The engine's heroes, camps and shops are one (`heroesPack`). A game's
  * own lists come after a pack's, so a command, an order, a hook or a system of the same id or name takes its place;
  * `withoutCommands`, `withoutOrders`, `withoutSystems` and `withoutHooks` take one of a pack's out as they do the
  * engine's
@@ -36,33 +36,33 @@ export interface GamePack {
     /** Its handlers of hooks, after the engine's and before the game's (`defineHook`) */
     hooks?: HookDef[];
     /** Kinds of ability effects it brings (`defineEffect`), beside the engine's: one of the game's of the same type takes its place */
-    effects?: EffectKind[];
+    effects?: EffectType[];
     /** How it reacts to events (`defineListener`) */
     listeners?: ListenerDef[];
     /** The state it keeps on entities, players and the world (`defineComponent`) */
     components?: Component<any>[];
     /** What it sets to go off later (`defineTimer`): listed, so that a save finds them by id */
     timers?: TimerDef[];
-    /** The stats it brings, next to the engine's and the game's own (`StatDef`, as `GameModule.stats`) */
+    /** The stats it brings, next to the engine's and the game's own (`StatDef`, as `Rules.stats`) */
     stats?: StatDef[];
-    /** What it adds to a unit's stats, kept up to date as the engine keeps the rest (`StatPart`) */
-    statParts?: StatPart[];
+    /** What it adds to a unit's stats, kept up to date as the engine keeps the rest (`StatField`) */
+    statFields?: StatField[];
     /** The events it tells of (`defineEvent`), listed as a game's are */
     events?: EventKey<any>[];
     /** How events of the world of its own are told to the players (`replicateEvent`), after the engine's */
     replications?: ReplicatedEvent[];
-    /** Parts of the players' snapshots of its own (`SnapshotPart`), after the engine's */
-    snapshotParts?: SnapshotPart[];
-    /** What it adds to the game's report of a player at the end (`GameModule.report`), beside the game's own */
+    /** Parts of the players' snapshots of its own (`SnapshotField`), after the engine's */
+    snapshotFields?: SnapshotField[];
+    /** What it adds to the game's report of a player at the end (`Rules.report`), beside the game's own */
     report?(world: World, player: PlayerId): Record<string, unknown>;
-    /** How a game with it is won, where the game says nothing of its own (`GameModule.victory`): the last pack's that says */
+    /** How a game with it is won, where the game says nothing of its own (`Rules.victory`): the last pack's that says */
     victory?: SystemDef | null;
     /**
      * The rules it changes: handed the game's as they come out (the engine's, the game's over them, the packs' before it),
      * it gives what it lays over them. A function of them, so that what it says can be made of what was there (the lanes'
      * supply: none for a minion, the game's own for the rest)
      */
-    rules?(rules: Readonly<GameRules>): RulesInit;
+    settings?(settings: Readonly<RuleSettings>): RuleSettingsInit;
     /** What it finds wrong with a map in the editor, beside what the game finds (`MapEditorDef.check`) */
     check?(map: GameMap, registry: Registry): MapProblem[];
     /** The packs it is made to go with, by id: a game with it and without one of them is refused */

package/dist/packs/pack.js

@@ -0,0 +1,14 @@
+//#region src/packs/pack.ts
+/**
+* Whether a game has a pack on, by its id: `hasPack(game, HEROES)`, what the editor asks before it shows a hero's
+* fields
+*
+* @beta
+*/
+function hasPack(game, id) {
+	return !!game?.packs?.some((pack) => pack.id === id);
+}
+//#endregion
+export { hasPack };
+
+//# sourceMappingURL=pack.js.map

package/dist/packs/pack.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pack.js","names":[],"sources":["../../src/packs/pack.ts"],"sourcesContent":["import type { EffectType } from '#engine/abilities/effects'\nimport type { CommandDef } from '#engine/commands'\nimport type { Component } from '#engine/components'\nimport type { ListenerDef } from '#engine/events'\nimport type { HookDef } from '#engine/hooks'\nimport type { OrderBehavior, SystemDef } from '#engine/registry'\nimport type { StatField } from '#engine/stats'\nimport type { StatDef } from '#engine/defs'\nimport type { EventKey } from '#engine/events'\nimport type { ReplicatedEvent, SnapshotField } from '#engine/replication'\nimport type { PlayerId } from '#engine/entity'\nimport type { GameMap } from '#engine/map'\nimport type { MapProblem } from '#engine/mapFields'\nimport type { Registry } from '#engine/registry'\nimport type { RuleSettings, RuleSettingsInit } from '#engine/rules'\nimport type { World } from '#engine/world'\nimport type { TimerDef } from '#engine/timers'\n\n/**\n * A part of the rules a game opts into (`Rules.packs`): commands, orders, systems, hooks and the state it keeps,\n * which a game without it pays nothing for. The engine's heroes, camps and shops are one (`heroesPack`). A game's\n * own lists come after a pack's, so a command, an order, a hook or a system of the same id or name takes its place;\n * `withoutCommands`, `withoutOrders`, `withoutSystems` and `withoutHooks` take one of a pack's out as they do the\n * engine's\n *\n * @beta\n */\nexport interface GamePack {\n\t/** Unique among a game's packs: how a game, a mod or the editor asks whether it is on (`hasPack`) */\n\tid: string\n\t/** Commands it takes, beside the engine's (`defineCommand`) */\n\tcommands?: CommandDef[]\n\t/** Orders its units can be given, beside the engine's */\n\torders?: OrderBehavior[]\n\t/** Systems, run with the engine's in the phase each says (see `System`) */\n\tsystems?: SystemDef[]\n\t/** Its handlers of hooks, after the engine's and before the game's (`defineHook`) */\n\thooks?: HookDef[]\n\t/** Kinds of ability effects it brings (`defineEffect`), beside the engine's: one of the game's of the same type takes its place */\n\teffects?: EffectType[]\n\t/** How it reacts to events (`defineListener`) */\n\tlisteners?: ListenerDef[]\n\t/** The state it keeps on entities, players and the world (`defineComponent`) */\n\tcomponents?: Component<any>[]\n\t/** What it sets to go off later (`defineTimer`): listed, so that a save finds them by id */\n\ttimers?: TimerDef[]\n\t/** The stats it brings, next to the engine's and the game's own (`StatDef`, as `Rules.stats`) */\n\tstats?: StatDef[]\n\t/** What it adds to a unit's stats, kept up to date as the engine keeps the rest (`StatField`) */\n\tstatFields?: StatField[]\n\t/** The events it tells of (`defineEvent`), listed as a game's are */\n\tevents?: EventKey<any>[]\n\t/** How events of the world of its own are told to the players (`replicateEvent`), after the engine's */\n\treplications?: ReplicatedEvent[]\n\t/** Parts of the players' snapshots of its own (`SnapshotField`), after the engine's */\n\tsnapshotFields?: SnapshotField[]\n\t/** What it adds to the game's report of a player at the end (`Rules.report`), beside the game's own */\n\treport?(world: World, player: PlayerId): Record<string, unknown>\n\t/** How a game with it is won, where the game says nothing of its own (`Rules.victory`): the last pack's that says */\n\tvictory?: SystemDef | null\n\t/**\n\t * The rules it changes: handed the game's as they come out (the engine's, the game's over them, the packs' before it),\n\t * it gives what it lays over them. A function of them, so that what it says can be made of what was there (the lanes'\n\t * supply: none for a minion, the game's own for the rest)\n\t */\n\tsettings?(settings: Readonly<RuleSettings>): RuleSettingsInit\n\t/** What it finds wrong with a map in the editor, beside what the game finds (`MapEditorDef.check`) */\n\tcheck?(map: GameMap, registry: Registry): MapProblem[]\n\t/** The packs it is made to go with, by id: a game with it and without one of them is refused */\n\trequires?: string[]\n\t/**\n\t * What it was made with, as plain data: what a game's hash names it by, beside its id (`gameHash`), so that one pack\n\t * made two ways is two games\n\t */\n\toptions?: unknown\n}\n\n/**\n * Whether a game has a pack on, by its id: `hasPack(game, HEROES)`, what the editor asks before it shows a hero's\n * fields\n *\n * @beta\n */\nexport function hasPack(game: { packs?: readonly GamePack[] } | null | undefined, id: string): boolean {\n\treturn !!game?.packs?.some((pack) => pack.id === id)\n}\n"],"mappings":";;;;;;;AAmFA,SAAgB,QAAQ,MAA0D,IAAqB;CACtG,OAAO,CAAC,CAAC,MAAM,OAAO,MAAM,SAAS,KAAK,OAAO,EAAE;AACpD"}

package/dist/packs.d.ts

@@ -1,13 +1,13 @@
 import type { AbilityDef, BuffDef, ItemDef, UnitTypeDef, UpgradeDef } from './defs';
 import { type GameData } from './gameData';
-import type { GameModule } from './game';
+import type { Rules } from './game';
 import type { ModDef } from './mods';
 import type { RaceDef } from './races';
-import type { RulesInit } from './rules';
+import type { RuleSettingsInit } from './rules';
 /**
  * A pack of content as its file has it (`packs/<id>/pack.json`): plain data, checked against the pack's schema
  * (`@v12-engine/engine/schemas/pack.schema.json`) as it is read. Its definitions are added to the game's, or put in the place of those of the same id;
- * then its `data` is laid over the whole as a `data.json` is (`withData`), and its `rules` over the game's
+ * then its `data` is laid over the whole as a `data.json` is (`layData`), and its `settings` over the game's
  *
  * @beta
  */
@@ -16,17 +16,24 @@ export interface PackFile {
     id: string;
     /** `major.minor.patch` */
     version: string;
+    /** A human-readable name for the pack, shown where the id is not enough */
     name?: string;
     /** The game and the packs or mods it is made for, as a mod's (`ModDef.requires`) */
     requires?: string[];
+    /** Unit type definitions the pack adds to the game's or puts in the place of those of the same id */
     units?: UnitTypeDef[];
+    /** Ability definitions the pack adds or replaces */
     abilities?: AbilityDef[];
+    /** Buff definitions the pack adds or replaces */
     buffs?: BuffDef[];
+    /** Item definitions the pack adds or replaces */
     items?: ItemDef[];
+    /** Upgrade definitions the pack adds or replaces */
     upgrades?: UpgradeDef[];
+    /** Race definitions the pack adds or replaces */
     races?: RaceDef[];
-    /** The rules it changes, as data (`GameBuilder.rules`) */
-    rules?: RulesInit;
+    /** The rules it changes, as data (`GameBuilder.settings`) */
+    settings?: RuleSettingsInit;
     /** Values over the definitions, as a `data.json` has them (`GameData`): the editor's Data panel writes here for a pack */
     data?: GameData;
     /** What its units look like, as a `looks.json` has them: the client's to lay over the game's view */
@@ -38,6 +45,7 @@ export interface PackFile {
  * @beta
  */
 export interface PackMod extends ModDef {
+    /** The pack's file this mod was made from */
     readonly pack: PackFile;
     /** The hash of the pack's bytes as they were read: kept with the game's mods, so the game's hash has it */
     readonly hash: string;
@@ -68,7 +76,7 @@ export declare function checkPackSchema(json: unknown, schema: object): string |
 /**
  * Makes a mod of a pack's file (its text, or what was parsed of it): checked, then applying its definitions (each
  * list in the order of its ids, a definition the game has put in its place), its `data` over the whole and its
- * `rules`. Its hash, of the text as given, goes with the game's mods
+ * `settings`. Its hash, of the text as given, goes with the game's mods
  *
  * @beta
  */
@@ -78,7 +86,7 @@ export declare function packFromJson(json: string | unknown, where?: string): Pa
  *
  * @beta
  */
-export declare const packsOf: (game: Pick<GameModule, 'mods'>) => {
+export declare const packsOf: (game: Pick<Rules, 'mods'>) => {
     id: string;
     version: string;
 }[];

package/dist/packs.js

@@ -0,0 +1,222 @@
+import { DATA_KINDS, layData } from "./gameData.js";
+//#region src/packs.ts
+/**
+* Why a pack's file is not one, where it is first wrong
+*
+* @beta
+*/
+var PackError = class extends Error {};
+var ID = /^[a-z0-9][a-z0-9._-]*$/i;
+var VERSION = /^\d+(\.\d+){0,2}$/;
+var isRecord = (value) => typeof value === "object" && value !== null && !Array.isArray(value);
+/**
+* Checks a pack's file as it is read (the schema's rules a loader needs: the pack's schema has all of them):
+* its id and version, and that each list is of definitions with an id, once each. Throws `PackError` saying where
+*
+* @beta
+*/
+function checkPack(json, where = "the pack") {
+	const wrong = (why) => {
+		throw new PackError(`${where}: ${why}`);
+	};
+	if (!isRecord(json)) return wrong("is no object");
+	if (typeof json.id !== "string" || !ID.test(json.id)) wrong("its id is letters, digits, dots and dashes");
+	if (typeof json.version !== "string" || !VERSION.test(json.version)) wrong("its version is major.minor.patch");
+	if (json.requires !== void 0 && (!Array.isArray(json.requires) || json.requires.some((each) => typeof each !== "string"))) wrong("requires is a list of words");
+	for (const kind of DATA_KINDS) {
+		const list = json[kind];
+		if (list === void 0) continue;
+		if (!Array.isArray(list)) wrong(`${kind} is no list`);
+		const seen = /* @__PURE__ */ new Set();
+		for (const [at, def] of list.entries()) {
+			if (!isRecord(def) || typeof def.id !== "string" || !def.id) wrong(`${kind}[${at}] has no id`);
+			const id = def.id;
+			if (seen.has(id)) wrong(`${kind} has "${id}" twice`);
+			seen.add(id);
+		}
+	}
+	for (const part of [
+		"settings",
+		"data",
+		"looks"
+	]) if (json[part] !== void 0 && !isRecord(json[part])) wrong(`${part} is no object`);
+	if (json.rules !== void 0) wrong("\"rules\" is now \"settings\": the rules' knobs a pack changes go under \"settings\"");
+	const known = /* @__PURE__ */ new Set([
+		"$schema",
+		"id",
+		"version",
+		"name",
+		"requires",
+		...DATA_KINDS,
+		"settings",
+		"data",
+		"looks"
+	]);
+	const unknown = Object.keys(json).find((key) => !known.has(key));
+	if (unknown) wrong(`"${unknown}" is nothing a pack has`);
+	return json;
+}
+/** A word with its article: an object, a number */
+var an = (word) => `${/^[aeiou]/.test(word) ? "an" : "a"} ${word}`;
+/** The type of a value as a schema says it */
+var typeOf = (value) => value === null ? "null" : Array.isArray(value) ? "array" : Number.isInteger(value) ? "integer" : typeof value;
+/**
+* Checks a pack's file against the pack's schema (`@v12-engine/engine/schemas/pack.schema.json`, made of `PackFile`):
+* where it is first wrong, in words with its place (`units[2].stats.health: is a string, not a number`), or nothing
+* for one that is right. A small reader of the schema, as far as it uses JSON Schema: what a page that loads packs
+* fetches with them, so that a game without packs carries none of it
+*
+* @beta
+*/
+function checkPackSchema(json, schema) {
+	const root = schema;
+	const resolve = (part) => {
+		let at = part;
+		for (let hops = 0; at.$ref && hops < 32; hops++) at = root.definitions?.[decodeURIComponent(at.$ref.replace("#/definitions/", ""))] ?? {};
+		return at;
+	};
+	const check = (value, given, where) => {
+		const part = resolve(given);
+		const type = typeOf(value);
+		if (part.type !== void 0) {
+			const types = Array.isArray(part.type) ? part.type : [part.type];
+			if (!types.some((each) => each === type || each === "number" && type === "integer")) return `${where || "the pack"}: is ${an(type)}, not ${types.join(" or ")}`;
+		}
+		if ("const" in part && value !== part.const) return `${where || "the pack"}: is not ${JSON.stringify(part.const)}`;
+		if (part.enum && !part.enum.includes(value)) return `${where || "the pack"}: is none of ${part.enum.map((each) => JSON.stringify(each)).join(", ")}`;
+		if (part.not && check(value, part.not, where) === void 0) return `${where || "the pack"}: is what it may not be`;
+		if (part.anyOf) {
+			const wrongs = part.anyOf.map((each) => check(value, each, where));
+			if (wrongs.every((wrong) => wrong !== void 0)) return wrongs.reduce((deepest, wrong) => wrong.length > deepest.length ? wrong : deepest);
+		}
+		if (type === "object" && (part.properties || part.required || part.additionalProperties !== void 0 || part.propertyNames)) {
+			const object = value;
+			for (const field of part.required ?? []) if (!(field in object)) return `${where || "the pack"}: has no ${field}`;
+			for (const [field, each] of Object.entries(object)) {
+				const at = where ? `${where}.${field}` : field;
+				if (part.propertyNames) {
+					const name = check(field, part.propertyNames, at);
+					if (name) return name;
+				}
+				const own = part.properties?.[field];
+				if (own) {
+					const wrong = check(each, own, at);
+					if (wrong) return wrong;
+				} else if (part.additionalProperties === false) return `${at}: is nothing ${where || "a pack"} has`;
+				else if (typeof part.additionalProperties === "object") {
+					const wrong = check(each, part.additionalProperties, at);
+					if (wrong) return wrong;
+				}
+			}
+		}
+		if (type === "array") {
+			const list = value;
+			if (part.minItems !== void 0 && list.length < part.minItems) return `${where || "the pack"}: has fewer than ${part.minItems}`;
+			if (part.maxItems !== void 0 && list.length > part.maxItems) return `${where || "the pack"}: has more than ${part.maxItems}`;
+			if (part.items) for (const [at, each] of list.entries()) {
+				const item = Array.isArray(part.items) ? part.items[at] : part.items;
+				const wrong = item && check(each, item, `${where}[${at}]`);
+				if (wrong) return wrong;
+			}
+		}
+	};
+	return check(json, root, "");
+}
+/** FNV-1a, twice over with different starts, of a text: as the game's hash is */
+function hashOf(text) {
+	let a = 2166136261;
+	let b = 1523705862;
+	for (let i = 0; i < text.length; i++) {
+		const c = text.charCodeAt(i);
+		a = Math.imul(a ^ c, 16777619);
+		b = Math.imul(b ^ c, 1540483477);
+	}
+	return (a >>> 0).toString(16).padStart(8, "0") + (b >>> 0).toString(16).padStart(8, "0");
+}
+var byId = (defs) => [...defs].sort((a, b) => a.id < b.id ? -1 : a.id > b.id ? 1 : 0);
+/** The builder's collection of a kind of the game's data */
+var collectionOf = (game, kind) => game[kind];
+/**
+* Makes a mod of a pack's file (its text, or what was parsed of it): checked, then applying its definitions (each
+* list in the order of its ids, a definition the game has put in its place), its `data` over the whole and its
+* `settings`. Its hash, of the text as given, goes with the game's mods
+*
+* @beta
+*/
+function packFromJson(json, where) {
+	const text = typeof json === "string" ? json : JSON.stringify(json);
+	let parsed;
+	try {
+		parsed = typeof json === "string" ? JSON.parse(json) : json;
+	} catch (error) {
+		throw new PackError(`${where ?? "the pack"}: is not JSON (${error instanceof Error ? error.message : String(error)})`);
+	}
+	const pack = checkPack(parsed, where);
+	return {
+		id: pack.id,
+		version: pack.version,
+		...pack.name !== void 0 && { name: pack.name },
+		...pack.requires !== void 0 && { requires: pack.requires },
+		pack,
+		hash: hashOf(text),
+		apply(game) {
+			for (const kind of DATA_KINDS) {
+				const defs = pack[kind];
+				if (!defs) continue;
+				const collection = collectionOf(game, kind);
+				for (const def of byId(defs)) {
+					const own = structuredClone(def);
+					if (collection.has(def.id)) collection.override(def.id, () => own);
+					else collection.add(own);
+				}
+			}
+			if (pack.data) layPackData(game, pack.data);
+			if (pack.settings) game.settings(pack.settings);
+		}
+	};
+}
+/** A `data.json`'s values laid over the game as the builder has it: each definition it changes put in its place, those it takes out gone */
+function layPackData(game, data) {
+	const before = game.current;
+	const after = layData(before, data);
+	for (const kind of DATA_KINDS) {
+		const collection = collectionOf(game, kind);
+		const was = new Map((before[kind] ?? []).map((def) => [def.id, def]));
+		const now = after[kind] ?? [];
+		for (const def of now) {
+			if (!was.has(def.id)) collection.add(def);
+			else if (was.get(def.id) !== def) collection.override(def.id, () => def);
+			was.delete(def.id);
+		}
+		for (const id of was.keys()) collection.remove(id);
+	}
+	if (after.ai !== before.ai) game.set("ai", after.ai);
+	const rules = data.rules;
+	if (rules?.supply || rules?.heroes) game.settings({
+		...rules.supply && { supply: rules.supply },
+		...rules.heroes && { heroes: rules.heroes }
+	});
+	if (after.upkeep !== before.upkeep) game.set("upkeep", after.upkeep);
+	if (after.resources !== before.resources) {
+		const was = new Set((before.resources ?? []).map((resource) => resource.id));
+		for (const resource of after.resources ?? []) {
+			if (was.has(resource.id)) game.resources.override(resource.id, () => resource);
+			else game.resources.add(resource);
+			was.delete(resource.id);
+		}
+		for (const id of was) game.resources.remove(id);
+	}
+}
+/**
+* Whether a game was made with packs, and which: those of the mods its composition kept a hash of, by id and version
+*
+* @beta
+*/
+var packsOf = (game) => (game.mods ?? []).filter((mod) => mod.hash !== void 0).map(({ id, version }) => ({
+	id,
+	version
+}));
+//#endregion
+export { PackError, checkPack, checkPackSchema, packFromJson, packsOf };
+
+//# sourceMappingURL=packs.js.map

package/dist/packs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"packs.js","names":[],"sources":["../src/packs.ts"],"sourcesContent":["import type { AbilityDef, BuffDef, ItemDef, UnitTypeDef, UpgradeDef } from './defs'\nimport { DATA_KINDS, type DataKind, type GameData, layData } from './gameData'\nimport type { Rules } from './game'\nimport type { GameBuilder, ModDef } from './mods'\nimport type { RaceDef } from './races'\nimport type { RuleSettingsInit } from './rules'\n\n/*\n * A pack of content as JSON (campaign plan RC6): definitions, data over them and rules, in a file a game names and\n * fetches before its world is made (`packs/<id>/pack.json`), made into a mod (`packFromJson`) that `composeGame`\n * applies as any other. The same bytes in the same order give the same game: each list is added in the order of its\n * ids, packs in the order they are named, and what a save and a lobby check (the game's hash) has each pack's own.\n */\n\n/**\n * A pack of content as its file has it (`packs/<id>/pack.json`): plain data, checked against the pack's schema\n * (`@v12-engine/engine/schemas/pack.schema.json`) as it is read. Its definitions are added to the game's, or put in the place of those of the same id;\n * then its `data` is laid over the whole as a `data.json` is (`layData`), and its `settings` over the game's\n *\n * @beta\n */\nexport interface PackFile {\n\t/** Letters, digits, dots and dashes: what the game composed of it is called by (`melee+<id>`) */\n\tid: string\n\t/** `major.minor.patch` */\n\tversion: string\n\t/** A human-readable name for the pack, shown where the id is not enough */\n\tname?: string\n\t/** The game and the packs or mods it is made for, as a mod's (`ModDef.requires`) */\n\trequires?: string[]\n\t/** Unit type definitions the pack adds to the game's or puts in the place of those of the same id */\n\tunits?: UnitTypeDef[]\n\t/** Ability definitions the pack adds or replaces */\n\tabilities?: AbilityDef[]\n\t/** Buff definitions the pack adds or replaces */\n\tbuffs?: BuffDef[]\n\t/** Item definitions the pack adds or replaces */\n\titems?: ItemDef[]\n\t/** Upgrade definitions the pack adds or replaces */\n\tupgrades?: UpgradeDef[]\n\t/** Race definitions the pack adds or replaces */\n\traces?: RaceDef[]\n\t/** The rules it changes, as data (`GameBuilder.settings`) */\n\tsettings?: RuleSettingsInit\n\t/** Values over the definitions, as a `data.json` has them (`GameData`): the editor's Data panel writes here for a pack */\n\tdata?: GameData\n\t/** What its units look like, as a `looks.json` has them: the client's to lay over the game's view */\n\tlooks?: Record<string, unknown>\n}\n\n/**\n * A mod made of a pack (`packFromJson`): the mod, and the pack's file it was made of\n *\n * @beta\n */\nexport interface PackMod extends ModDef {\n\t/** The pack's file this mod was made from */\n\treadonly pack: PackFile\n\t/** The hash of the pack's bytes as they were read: kept with the game's mods, so the game's hash has it */\n\treadonly hash: string\n}\n\n/**\n * Why a pack's file is not one, where it is first wrong\n *\n * @beta\n */\nexport class PackError extends Error {}\n\nconst ID = /^[a-z0-9][a-z0-9._-]*$/i\nconst VERSION = /^\\d+(\\.\\d+){0,2}$/\n\nconst isRecord = (value: unknown): value is Record<string, unknown> => typeof value === 'object' && value !== null && !Array.isArray(value)\n\n/**\n * Checks a pack's file as it is read (the schema's rules a loader needs: the pack's schema has all of them):\n * its id and version, and that each list is of definitions with an id, once each. Throws `PackError` saying where\n *\n * @beta\n */\nexport function checkPack(json: unknown, where = 'the pack'): PackFile {\n\tconst wrong = (why: string): never => {\n\t\tthrow new PackError(`${where}: ${why}`)\n\t}\n\tif (!isRecord(json)) return wrong('is no object')\n\tif (typeof json.id !== 'string' || !ID.test(json.id)) wrong('its id is letters, digits, dots and dashes')\n\tif (typeof json.version !== 'string' || !VERSION.test(json.version)) wrong('its version is major.minor.patch')\n\tif (json.requires !== undefined && (!Array.isArray(json.requires) || json.requires.some((each) => typeof each !== 'string')))\n\t\twrong('requires is a list of words')\n\tfor (const kind of DATA_KINDS) {\n\t\tconst list = json[kind]\n\t\tif (list === undefined) continue\n\t\tif (!Array.isArray(list)) wrong(`${kind} is no list`)\n\t\tconst seen = new Set<string>()\n\t\tfor (const [at, def] of (list as unknown[]).entries()) {\n\t\t\tif (!isRecord(def) || typeof def.id !== 'string' || !def.id) wrong(`${kind}[${at}] has no id`)\n\t\t\tconst id = (def as { id: string }).id\n\t\t\tif (seen.has(id)) wrong(`${kind} has \"${id}\" twice`)\n\t\t\tseen.add(id)\n\t\t}\n\t}\n\tfor (const part of ['settings', 'data', 'looks'] as const) if (json[part] !== undefined && !isRecord(json[part])) wrong(`${part} is no object`)\n\t// the rules' knobs are `settings`, as `PackFile` and the schema say: a pack that names them `rules` is told, not let pass\n\t// with them ignored\n\tif (json.rules !== undefined) wrong('\"rules\" is now \"settings\": the rules\\' knobs a pack changes go under \"settings\"')\n\tconst known = new Set(['$schema', 'id', 'version', 'name', 'requires', ...DATA_KINDS, 'settings', 'data', 'looks'])\n\tconst unknown = Object.keys(json).find((key) => !known.has(key))\n\tif (unknown) wrong(`\"${unknown}\" is nothing a pack has`)\n\treturn json as unknown as PackFile\n}\n\n/** A part of a JSON Schema, as far as the pack's schema uses one (`@v12-engine/engine/schemas/pack.schema.json`) */\ninterface SchemaPart {\n\t$ref?: string\n\ttype?: string | string[]\n\tconst?: unknown\n\tenum?: unknown[]\n\tanyOf?: SchemaPart[]\n\tnot?: SchemaPart\n\tproperties?: Record<string, SchemaPart>\n\trequired?: string[]\n\tadditionalProperties?: boolean | SchemaPart\n\tpropertyNames?: SchemaPart\n\titems?: SchemaPart | SchemaPart[]\n\tminItems?: number\n\tmaxItems?: number\n\tdefinitions?: Record<string, SchemaPart>\n}\n\n/** A word with its article: an object, a number */\nconst an = (word: string) => `${/^[aeiou]/.test(word) ? 'an' : 'a'} ${word}`\n\n/** The type of a value as a schema says it */\nconst typeOf = (value: unknown): string =>\n\tvalue === null ? 'null' : Array.isArray(value) ? 'array' : Number.isInteger(value) ? 'integer' : typeof value\n\n/**\n * Checks a pack's file against the pack's schema (`@v12-engine/engine/schemas/pack.schema.json`, made of `PackFile`):\n * where it is first wrong, in words with its place (`units[2].stats.health: is a string, not a number`), or nothing\n * for one that is right. A small reader of the schema, as far as it uses JSON Schema: what a page that loads packs\n * fetches with them, so that a game without packs carries none of it\n *\n * @beta\n */\nexport function checkPackSchema(json: unknown, schema: object): string | undefined {\n\tconst root = schema as SchemaPart\n\tconst resolve = (part: SchemaPart): SchemaPart => {\n\t\tlet at = part\n\t\tfor (let hops = 0; at.$ref && hops < 32; hops++) at = root.definitions?.[decodeURIComponent(at.$ref.replace('#/definitions/', ''))] ?? {}\n\t\treturn at\n\t}\n\tconst check = (value: unknown, given: SchemaPart, where: string): string | undefined => {\n\t\tconst part = resolve(given)\n\t\tconst type = typeOf(value)\n\t\tif (part.type !== undefined) {\n\t\t\tconst types = Array.isArray(part.type) ? part.type : [part.type]\n\t\t\tif (!types.some((each) => each === type || (each === 'number' && type === 'integer')))\n\t\t\t\treturn `${where || 'the pack'}: is ${an(type)}, not ${types.join(' or ')}`\n\t\t}\n\t\tif ('const' in part && value !== part.const) return `${where || 'the pack'}: is not ${JSON.stringify(part.const)}`\n\t\tif (part.enum && !part.enum.includes(value))\n\t\t\treturn `${where || 'the pack'}: is none of ${part.enum.map((each) => JSON.stringify(each)).join(', ')}`\n\t\tif (part.not && check(value, part.not, where) === undefined) return `${where || 'the pack'}: is what it may not be`\n\t\tif (part.anyOf) {\n\t\t\tconst wrongs = part.anyOf.map((each) => check(value, each, where))\n\t\t\tif (wrongs.every((wrong) => wrong !== undefined)) {\n\t\t\t\t// the form that went furthest says why: the one wrong deepest in\n\t\t\t\treturn wrongs.reduce((deepest, wrong) => (wrong!.length > deepest!.length ? wrong : deepest))\n\t\t\t}\n\t\t}\n\t\tif (type === 'object' && (part.properties || part.required || part.additionalProperties !== undefined || part.propertyNames)) {\n\t\t\tconst object = value as Record<string, unknown>\n\t\t\tfor (const field of part.required ?? []) if (!(field in object)) return `${where || 'the pack'}: has no ${field}`\n\t\t\tfor (const [field, each] of Object.entries(object)) {\n\t\t\t\tconst at = where ? `${where}.${field}` : field\n\t\t\t\tif (part.propertyNames) {\n\t\t\t\t\tconst name = check(field, part.propertyNames, at)\n\t\t\t\t\tif (name) return name\n\t\t\t\t}\n\t\t\t\tconst own = part.properties?.[field]\n\t\t\t\tif (own) {\n\t\t\t\t\tconst wrong = check(each, own, at)\n\t\t\t\t\tif (wrong) return wrong\n\t\t\t\t} else if (part.additionalProperties === false) return `${at}: is nothing ${where || 'a pack'} has`\n\t\t\t\telse if (typeof part.additionalProperties === 'object') {\n\t\t\t\t\tconst wrong = check(each, part.additionalProperties, at)\n\t\t\t\t\tif (wrong) return wrong\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (type === 'array') {\n\t\t\tconst list = value as unknown[]\n\t\t\tif (part.minItems !== undefined && list.length < part.minItems) return `${where || 'the pack'}: has fewer than ${part.minItems}`\n\t\t\tif (part.maxItems !== undefined && list.length > part.maxItems) return `${where || 'the pack'}: has more than ${part.maxItems}`\n\t\t\tif (part.items)\n\t\t\t\tfor (const [at, each] of list.entries()) {\n\t\t\t\t\tconst item = Array.isArray(part.items) ? part.items[at] : part.items\n\t\t\t\t\tconst wrong = item && check(each, item, `${where}[${at}]`)\n\t\t\t\t\tif (wrong) return wrong\n\t\t\t\t}\n\t\t}\n\t\treturn undefined\n\t}\n\treturn check(json, root, '')\n}\n\n/** FNV-1a, twice over with different starts, of a text: as the game's hash is */\nfunction hashOf(text: string): string {\n\tlet a = 0x811c9dc5\n\tlet b = 0x01000193 ^ 0x5bd1e995\n\tfor (let i = 0; i < text.length; i++) {\n\t\tconst c = text.charCodeAt(i)\n\t\ta = Math.imul(a ^ c, 0x01000193)\n\t\tb = Math.imul(b ^ c, 0x5bd1e995)\n\t}\n\treturn (a >>> 0).toString(16).padStart(8, '0') + (b >>> 0).toString(16).padStart(8, '0')\n}\n\nconst byId = <T extends { id: string }>(defs: readonly T[]) => [...defs].sort((a, b) => (a.id < b.id ? -1 : a.id > b.id ? 1 : 0))\n\n/** The builder's collection of a kind of the game's data */\nconst collectionOf = (game: GameBuilder, kind: DataKind) => game[kind] as unknown as GameBuilder['units']\n\n/**\n * Makes a mod of a pack's file (its text, or what was parsed of it): checked, then applying its definitions (each\n * list in the order of its ids, a definition the game has put in its place), its `data` over the whole and its\n * `settings`. Its hash, of the text as given, goes with the game's mods\n *\n * @beta\n */\nexport function packFromJson(json: string | unknown, where?: string): PackMod {\n\tconst text = typeof json === 'string' ? json : JSON.stringify(json)\n\tlet parsed: unknown\n\ttry {\n\t\tparsed = typeof json === 'string' ? JSON.parse(json) : json\n\t} catch (error) {\n\t\tthrow new PackError(`${where ?? 'the pack'}: is not JSON (${error instanceof Error ? error.message : String(error)})`)\n\t}\n\tconst pack = checkPack(parsed, where)\n\treturn {\n\t\tid: pack.id,\n\t\tversion: pack.version,\n\t\t...(pack.name !== undefined && { name: pack.name }),\n\t\t...(pack.requires !== undefined && { requires: pack.requires }),\n\t\tpack,\n\t\thash: hashOf(text),\n\t\tapply(game) {\n\t\t\tfor (const kind of DATA_KINDS) {\n\t\t\t\tconst defs = pack[kind] as { id: string }[] | undefined\n\t\t\t\tif (!defs) continue\n\t\t\t\tconst collection = collectionOf(game, kind)\n\t\t\t\tfor (const def of byId(defs)) {\n\t\t\t\t\tconst own = structuredClone(def) as UnitTypeDef\n\t\t\t\t\tif (collection.has(def.id)) collection.override(def.id, () => own)\n\t\t\t\t\telse collection.add(own)\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (pack.data) layPackData(game, pack.data)\n\t\t\tif (pack.settings) game.settings(pack.settings)\n\t\t}\n\t}\n}\n\n/** A `data.json`'s values laid over the game as the builder has it: each definition it changes put in its place, those it takes out gone */\nfunction layPackData(game: GameBuilder, data: GameData): void {\n\tconst before = game.current as Rules\n\tconst after = layData(before, data)\n\tfor (const kind of DATA_KINDS) {\n\t\tconst collection = collectionOf(game, kind)\n\t\tconst was = new Map(((before[kind] ?? []) as { id: string }[]).map((def) => [def.id, def]))\n\t\tconst now = (after[kind] ?? []) as unknown as UnitTypeDef[]\n\t\tfor (const def of now) {\n\t\t\tif (!was.has(def.id)) collection.add(def)\n\t\t\telse if (was.get(def.id) !== (def as unknown)) collection.override(def.id, () => def)\n\t\t\twas.delete(def.id)\n\t\t}\n\t\tfor (const id of was.keys()) collection.remove(id)\n\t}\n\tif (after.ai !== before.ai) game.set('ai', after.ai)\n\t// the rules as data (`GameData.rules`), as a `data.json`'s are laid: supply and heroes over the settings, the upkeep\n\t// tiers and the resources whole in place of the game's\n\tconst rules = data.rules\n\tif (rules?.supply || rules?.heroes)\n\t\tgame.settings({ ...(rules.supply && { supply: rules.supply }), ...(rules.heroes && { heroes: rules.heroes }) } as RuleSettingsInit)\n\tif (after.upkeep !== before.upkeep) game.set('upkeep', after.upkeep)\n\tif (after.resources !== before.resources) {\n\t\tconst was = new Set((before.resources ?? []).map((resource) => resource.id))\n\t\tfor (const resource of after.resources ?? []) {\n\t\t\tif (was.has(resource.id)) game.resources.override(resource.id, () => resource)\n\t\t\telse game.resources.add(resource)\n\t\t\twas.delete(resource.id)\n\t\t}\n\t\tfor (const id of was) game.resources.remove(id)\n\t}\n}\n\n/**\n * Whether a game was made with packs, and which: those of the mods its composition kept a hash of, by id and version\n *\n * @beta\n */\nexport const packsOf = (game: Pick<Rules, 'mods'>): { id: string; version: string }[] =>\n\t(game.mods ?? []).filter((mod) => (mod as { hash?: string }).hash !== undefined).map(({ id, version }) => ({ id, version }))\n"],"mappings":";;;;;;;AAmEA,IAAa,YAAb,cAA+B,MAAM,CAAC;AAEtC,IAAM,KAAK;AACX,IAAM,UAAU;AAEhB,IAAM,YAAY,UAAqD,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;;;;;;;AAQ1I,SAAgB,UAAU,MAAe,QAAQ,YAAsB;CACtE,MAAM,SAAS,QAAuB;EACrC,MAAM,IAAI,UAAU,GAAG,MAAM,IAAI,KAAK;CACvC;CACA,IAAI,CAAC,SAAS,IAAI,GAAG,OAAO,MAAM,cAAc;CAChD,IAAI,OAAO,KAAK,OAAO,YAAY,CAAC,GAAG,KAAK,KAAK,EAAE,GAAG,MAAM,4CAA4C;CACxG,IAAI,OAAO,KAAK,YAAY,YAAY,CAAC,QAAQ,KAAK,KAAK,OAAO,GAAG,MAAM,kCAAkC;CAC7G,IAAI,KAAK,aAAa,KAAA,MAAc,CAAC,MAAM,QAAQ,KAAK,QAAQ,KAAK,KAAK,SAAS,MAAM,SAAS,OAAO,SAAS,QAAQ,IACzH,MAAM,6BAA6B;CACpC,KAAK,MAAM,QAAQ,YAAY;EAC9B,MAAM,OAAO,KAAK;EAClB,IAAI,SAAS,KAAA,GAAW;EACxB,IAAI,CAAC,MAAM,QAAQ,IAAI,GAAG,MAAM,GAAG,KAAK,YAAY;EACpD,MAAM,uBAAO,IAAI,IAAY;EAC7B,KAAK,MAAM,CAAC,IAAI,QAAS,KAAmB,QAAQ,GAAG;GACtD,IAAI,CAAC,SAAS,GAAG,KAAK,OAAO,IAAI,OAAO,YAAY,CAAC,IAAI,IAAI,MAAM,GAAG,KAAK,GAAG,GAAG,YAAY;GAC7F,MAAM,KAAM,IAAuB;GACnC,IAAI,KAAK,IAAI,EAAE,GAAG,MAAM,GAAG,KAAK,QAAQ,GAAG,QAAQ;GACnD,KAAK,IAAI,EAAE;EACZ;CACD;CACA,KAAK,MAAM,QAAQ;EAAC;EAAY;EAAQ;CAAO,GAAY,IAAI,KAAK,UAAU,KAAA,KAAa,CAAC,SAAS,KAAK,KAAK,GAAG,MAAM,GAAG,KAAK,cAAc;CAG9I,IAAI,KAAK,UAAU,KAAA,GAAW,MAAM,sFAAiF;CACrH,MAAM,wBAAQ,IAAI,IAAI;EAAC;EAAW;EAAM;EAAW;EAAQ;EAAY,GAAG;EAAY;EAAY;EAAQ;CAAO,CAAC;CAClH,MAAM,UAAU,OAAO,KAAK,IAAI,CAAC,CAAC,MAAM,QAAQ,CAAC,MAAM,IAAI,GAAG,CAAC;CAC/D,IAAI,SAAS,MAAM,IAAI,QAAQ,wBAAwB;CACvD,OAAO;AACR;;AAqBA,IAAM,MAAM,SAAiB,GAAG,WAAW,KAAK,IAAI,IAAI,OAAO,IAAI,GAAG;;AAGtE,IAAM,UAAU,UACf,UAAU,OAAO,SAAS,MAAM,QAAQ,KAAK,IAAI,UAAU,OAAO,UAAU,KAAK,IAAI,YAAY,OAAO;;;;;;;;;AAUzG,SAAgB,gBAAgB,MAAe,QAAoC;CAClF,MAAM,OAAO;CACb,MAAM,WAAW,SAAiC;EACjD,IAAI,KAAK;EACT,KAAK,IAAI,OAAO,GAAG,GAAG,QAAQ,OAAO,IAAI,QAAQ,KAAK,KAAK,cAAc,mBAAmB,GAAG,KAAK,QAAQ,kBAAkB,EAAE,CAAC,MAAM,CAAC;EACxI,OAAO;CACR;CACA,MAAM,SAAS,OAAgB,OAAmB,UAAsC;EACvF,MAAM,OAAO,QAAQ,KAAK;EAC1B,MAAM,OAAO,OAAO,KAAK;EACzB,IAAI,KAAK,SAAS,KAAA,GAAW;GAC5B,MAAM,QAAQ,MAAM,QAAQ,KAAK,IAAI,IAAI,KAAK,OAAO,CAAC,KAAK,IAAI;GAC/D,IAAI,CAAC,MAAM,MAAM,SAAS,SAAS,QAAS,SAAS,YAAY,SAAS,SAAU,GACnF,OAAO,GAAG,SAAS,WAAW,OAAO,GAAG,IAAI,EAAE,QAAQ,MAAM,KAAK,MAAM;EACzE;EACA,IAAI,WAAW,QAAQ,UAAU,KAAK,OAAO,OAAO,GAAG,SAAS,WAAW,WAAW,KAAK,UAAU,KAAK,KAAK;EAC/G,IAAI,KAAK,QAAQ,CAAC,KAAK,KAAK,SAAS,KAAK,GACzC,OAAO,GAAG,SAAS,WAAW,eAAe,KAAK,KAAK,KAAK,SAAS,KAAK,UAAU,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI;EACrG,IAAI,KAAK,OAAO,MAAM,OAAO,KAAK,KAAK,KAAK,MAAM,KAAA,GAAW,OAAO,GAAG,SAAS,WAAW;EAC3F,IAAI,KAAK,OAAO;GACf,MAAM,SAAS,KAAK,MAAM,KAAK,SAAS,MAAM,OAAO,MAAM,KAAK,CAAC;GACjE,IAAI,OAAO,OAAO,UAAU,UAAU,KAAA,CAAS,GAE9C,OAAO,OAAO,QAAQ,SAAS,UAAW,MAAO,SAAS,QAAS,SAAS,QAAQ,OAAQ;EAE9F;EACA,IAAI,SAAS,aAAa,KAAK,cAAc,KAAK,YAAY,KAAK,yBAAyB,KAAA,KAAa,KAAK,gBAAgB;GAC7H,MAAM,SAAS;GACf,KAAK,MAAM,SAAS,KAAK,YAAY,CAAC,GAAG,IAAI,EAAE,SAAS,SAAS,OAAO,GAAG,SAAS,WAAW,WAAW;GAC1G,KAAK,MAAM,CAAC,OAAO,SAAS,OAAO,QAAQ,MAAM,GAAG;IACnD,MAAM,KAAK,QAAQ,GAAG,MAAM,GAAG,UAAU;IACzC,IAAI,KAAK,eAAe;KACvB,MAAM,OAAO,MAAM,OAAO,KAAK,eAAe,EAAE;KAChD,IAAI,MAAM,OAAO;IAClB;IACA,MAAM,MAAM,KAAK,aAAa;IAC9B,IAAI,KAAK;KACR,MAAM,QAAQ,MAAM,MAAM,KAAK,EAAE;KACjC,IAAI,OAAO,OAAO;IACnB,OAAO,IAAI,KAAK,yBAAyB,OAAO,OAAO,GAAG,GAAG,eAAe,SAAS,SAAS;SACzF,IAAI,OAAO,KAAK,yBAAyB,UAAU;KACvD,MAAM,QAAQ,MAAM,MAAM,KAAK,sBAAsB,EAAE;KACvD,IAAI,OAAO,OAAO;IACnB;GACD;EACD;EACA,IAAI,SAAS,SAAS;GACrB,MAAM,OAAO;GACb,IAAI,KAAK,aAAa,KAAA,KAAa,KAAK,SAAS,KAAK,UAAU,OAAO,GAAG,SAAS,WAAW,mBAAmB,KAAK;GACtH,IAAI,KAAK,aAAa,KAAA,KAAa,KAAK,SAAS,KAAK,UAAU,OAAO,GAAG,SAAS,WAAW,kBAAkB,KAAK;GACrH,IAAI,KAAK,OACR,KAAK,MAAM,CAAC,IAAI,SAAS,KAAK,QAAQ,GAAG;IACxC,MAAM,OAAO,MAAM,QAAQ,KAAK,KAAK,IAAI,KAAK,MAAM,MAAM,KAAK;IAC/D,MAAM,QAAQ,QAAQ,MAAM,MAAM,MAAM,GAAG,MAAM,GAAG,GAAG,EAAE;IACzD,IAAI,OAAO,OAAO;GACnB;EACF;CAED;CACA,OAAO,MAAM,MAAM,MAAM,EAAE;AAC5B;;AAGA,SAAS,OAAO,MAAsB;CACrC,IAAI,IAAI;CACR,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACrC,MAAM,IAAI,KAAK,WAAW,CAAC;EAC3B,IAAI,KAAK,KAAK,IAAI,GAAG,QAAU;EAC/B,IAAI,KAAK,KAAK,IAAI,GAAG,UAAU;CAChC;CACA,QAAQ,MAAM,EAAA,CAAG,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG,GAAG,KAAK,MAAM,EAAA,CAAG,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG,GAAG;AACxF;AAEA,IAAM,QAAkC,SAAuB,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,GAAG,MAAO,EAAE,KAAK,EAAE,KAAK,KAAK,EAAE,KAAK,EAAE,KAAK,IAAI,CAAE;;AAGhI,IAAM,gBAAgB,MAAmB,SAAmB,KAAK;;;;;;;;AASjE,SAAgB,aAAa,MAAwB,OAAyB;CAC7E,MAAM,OAAO,OAAO,SAAS,WAAW,OAAO,KAAK,UAAU,IAAI;CAClE,IAAI;CACJ,IAAI;EACH,SAAS,OAAO,SAAS,WAAW,KAAK,MAAM,IAAI,IAAI;CACxD,SAAS,OAAO;EACf,MAAM,IAAI,UAAU,GAAG,SAAS,WAAW,iBAAiB,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,EAAE,EAAE;CACtH;CACA,MAAM,OAAO,UAAU,QAAQ,KAAK;CACpC,OAAO;EACN,IAAI,KAAK;EACT,SAAS,KAAK;EACd,GAAI,KAAK,SAAS,KAAA,KAAa,EAAE,MAAM,KAAK,KAAK;EACjD,GAAI,KAAK,aAAa,KAAA,KAAa,EAAE,UAAU,KAAK,SAAS;EAC7D;EACA,MAAM,OAAO,IAAI;EACjB,MAAM,MAAM;GACX,KAAK,MAAM,QAAQ,YAAY;IAC9B,MAAM,OAAO,KAAK;IAClB,IAAI,CAAC,MAAM;IACX,MAAM,aAAa,aAAa,MAAM,IAAI;IAC1C,KAAK,MAAM,OAAO,KAAK,IAAI,GAAG;KAC7B,MAAM,MAAM,gBAAgB,GAAG;KAC/B,IAAI,WAAW,IAAI,IAAI,EAAE,GAAG,WAAW,SAAS,IAAI,UAAU,GAAG;UAC5D,WAAW,IAAI,GAAG;IACxB;GACD;GACA,IAAI,KAAK,MAAM,YAAY,MAAM,KAAK,IAAI;GAC1C,IAAI,KAAK,UAAU,KAAK,SAAS,KAAK,QAAQ;EAC/C;CACD;AACD;;AAGA,SAAS,YAAY,MAAmB,MAAsB;CAC7D,MAAM,SAAS,KAAK;CACpB,MAAM,QAAQ,QAAQ,QAAQ,IAAI;CAClC,KAAK,MAAM,QAAQ,YAAY;EAC9B,MAAM,aAAa,aAAa,MAAM,IAAI;EAC1C,MAAM,MAAM,IAAI,KAAM,OAAO,SAAS,CAAC,EAAA,CAAwB,KAAK,QAAQ,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;EAC1F,MAAM,MAAO,MAAM,SAAS,CAAC;EAC7B,KAAK,MAAM,OAAO,KAAK;GACtB,IAAI,CAAC,IAAI,IAAI,IAAI,EAAE,GAAG,WAAW,IAAI,GAAG;QACnC,IAAI,IAAI,IAAI,IAAI,EAAE,MAAO,KAAiB,WAAW,SAAS,IAAI,UAAU,GAAG;GACpF,IAAI,OAAO,IAAI,EAAE;EAClB;EACA,KAAK,MAAM,MAAM,IAAI,KAAK,GAAG,WAAW,OAAO,EAAE;CAClD;CACA,IAAI,MAAM,OAAO,OAAO,IAAI,KAAK,IAAI,MAAM,MAAM,EAAE;CAGnD,MAAM,QAAQ,KAAK;CACnB,IAAI,OAAO,UAAU,OAAO,QAC3B,KAAK,SAAS;EAAE,GAAI,MAAM,UAAU,EAAE,QAAQ,MAAM,OAAO;EAAI,GAAI,MAAM,UAAU,EAAE,QAAQ,MAAM,OAAO;CAAG,CAAqB;CACnI,IAAI,MAAM,WAAW,OAAO,QAAQ,KAAK,IAAI,UAAU,MAAM,MAAM;CACnE,IAAI,MAAM,cAAc,OAAO,WAAW;EACzC,MAAM,MAAM,IAAI,KAAK,OAAO,aAAa,CAAC,EAAA,CAAG,KAAK,aAAa,SAAS,EAAE,CAAC;EAC3E,KAAK,MAAM,YAAY,MAAM,aAAa,CAAC,GAAG;GAC7C,IAAI,IAAI,IAAI,SAAS,EAAE,GAAG,KAAK,UAAU,SAAS,SAAS,UAAU,QAAQ;QACxE,KAAK,UAAU,IAAI,QAAQ;GAChC,IAAI,OAAO,SAAS,EAAE;EACvB;EACA,KAAK,MAAM,MAAM,KAAK,KAAK,UAAU,OAAO,EAAE;CAC/C;AACD;;;;;;AAOA,IAAa,WAAW,UACtB,KAAK,QAAQ,CAAC,EAAA,CAAG,QAAQ,QAAS,IAA0B,SAAS,KAAA,CAAS,CAAC,CAAC,KAAK,EAAE,IAAI,eAAe;CAAE;CAAI;AAAQ,EAAE"}

package/dist/paths.d.ts

@@ -29,7 +29,9 @@ export declare class Path {
     width: number);
     /** How long it is, from its first point to its last */
     get length(): number;
+    /** A copy of the path's first point */
     get start(): Vec2;
+    /** A copy of the path's last point */
     get end(): Vec2;
     /**
      * Where on the path something is that has gone `distance` along it from its start, facing the way it goes. Before

package/dist/paths.js

@@ -0,0 +1,109 @@
+import { atan2, hypot } from "./exactMath.js";
+import { clamp } from "./math.js";
+//#region src/paths.ts
+/**
+* A line on the map, through points in order, with a width: a road, a patrol route, the way a wave walks. What the
+* rules ask of one a game would otherwise write each time: how long it is, where along it something is, how far a
+* point is from it, whether a point is on it
+*
+* @beta
+*/
+var Path = class {
+	points;
+	width;
+	/** How far along the path each of its points is */
+	along;
+	constructor(points, width) {
+		this.points = points;
+		this.width = width;
+		this.along = [0];
+		for (let i = 1; i < points.length; i++) this.along.push(this.along[i - 1] + hypot(points[i].x - points[i - 1].x, points[i].z - points[i - 1].z));
+	}
+	/** How long it is, from its first point to its last */
+	get length() {
+		return this.along[this.along.length - 1] ?? 0;
+	}
+	/** A copy of the path's first point */
+	get start() {
+		return { ...this.points[0] };
+	}
+	/** A copy of the path's last point */
+	get end() {
+		return { ...this.points[this.points.length - 1] };
+	}
+	/**
+	* Where on the path something is that has gone `distance` along it from its start, facing the way it goes. Before
+	* the start is the start, past the end the end
+	*/
+	at(distance) {
+		const { points, along } = this;
+		if (points.length === 1) return {
+			...points[0],
+			facing: 0
+		};
+		const d = clamp(distance, 0, this.length);
+		let i = 1;
+		while (i < points.length - 1 && along[i] < d) i++;
+		const a = points[i - 1];
+		const b = points[i];
+		const stretch = along[i] - along[i - 1];
+		const t = stretch > 0 ? (d - along[i - 1]) / stretch : 0;
+		return {
+			x: a.x + (b.x - a.x) * t,
+			z: a.z + (b.z - a.z) * t,
+			facing: atan2(b.x - a.x, b.z - a.z)
+		};
+	}
+	/** The nearest point of its middle line to a point, and how far along the path that is */
+	nearest(point) {
+		const { points, along } = this;
+		if (points.length === 1) return {
+			at: { ...points[0] },
+			distance: hypot(point.x - points[0].x, point.z - points[0].z),
+			along: 0
+		};
+		let best = {
+			at: { ...points[0] },
+			distance: Infinity,
+			along: 0
+		};
+		for (let i = 1; i < points.length; i++) {
+			const a = points[i - 1];
+			const b = points[i];
+			const dx = b.x - a.x;
+			const dz = b.z - a.z;
+			const lengthSq = dx * dx + dz * dz;
+			const t = lengthSq > 0 ? clamp(((point.x - a.x) * dx + (point.z - a.z) * dz) / lengthSq, 0, 1) : 0;
+			const at = {
+				x: a.x + dx * t,
+				z: a.z + dz * t
+			};
+			const distance = hypot(point.x - at.x, point.z - at.z);
+			if (distance < best.distance) best = {
+				at,
+				distance,
+				along: along[i - 1] + (along[i] - along[i - 1]) * t
+			};
+		}
+		return best;
+	}
+	/** How far a point is from the middle of the path */
+	distanceTo(point) {
+		return this.nearest(point).distance;
+	}
+	/** Whether a point is on the path: no more than half its width from its middle */
+	contains(point) {
+		return this.distanceTo(point) <= this.width / 2;
+	}
+	/** Whether the middle of a cell of the map is on the path: what it paints, and keeps clear */
+	containsCell(cx, cz) {
+		return this.contains({
+			x: cx + .5,
+			z: cz + .5
+		});
+	}
+};
+//#endregion
+export { Path };
+
+//# sourceMappingURL=paths.js.map

package/dist/paths.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"paths.js","names":[],"sources":["../src/paths.ts"],"sourcesContent":["import { clamp, type Vec2 } from './math'\nimport { atan2, hypot } from './exactMath'\n\n/**\n * A spot, and the way it faces: where a wave comes in, where a hero stands, where a camera looks from\n *\n * @beta\n */\nexport interface Spot extends Vec2 {\n\t/** Radians, the way entities face: 0 is along +z */\n\tfacing: number\n}\n\n/**\n * A line on the map, through points in order, with a width: a road, a patrol route, the way a wave walks. What the\n * rules ask of one a game would otherwise write each time: how long it is, where along it something is, how far a\n * point is from it, whether a point is on it\n *\n * @beta\n */\nexport class Path {\n\t/** How far along the path each of its points is */\n\tprivate readonly along: number[]\n\n\tconstructor(\n\t\t/** Its points, in order. Not to be changed: the path works out its length from them once */\n\t\treadonly points: readonly Vec2[],\n\t\t/** How wide it is: a point is on it when it is no more than half of this from its middle */\n\t\treadonly width: number\n\t) {\n\t\tthis.along = [0]\n\t\tfor (let i = 1; i < points.length; i++) this.along.push(this.along[i - 1] + hypot(points[i].x - points[i - 1].x, points[i].z - points[i - 1].z))\n\t}\n\n\t/** How long it is, from its first point to its last */\n\tget length(): number {\n\t\treturn this.along[this.along.length - 1] ?? 0\n\t}\n\n\t/** A copy of the path's first point */\n\tget start(): Vec2 {\n\t\treturn { ...this.points[0] }\n\t}\n\n\t/** A copy of the path's last point */\n\tget end(): Vec2 {\n\t\treturn { ...this.points[this.points.length - 1] }\n\t}\n\n\t/**\n\t * Where on the path something is that has gone `distance` along it from its start, facing the way it goes. Before\n\t * the start is the start, past the end the end\n\t */\n\tat(distance: number): Spot {\n\t\tconst { points, along } = this\n\t\tif (points.length === 1) return { ...points[0], facing: 0 }\n\t\tconst d = clamp(distance, 0, this.length)\n\t\tlet i = 1\n\t\twhile (i < points.length - 1 && along[i] < d) i++\n\t\tconst a = points[i - 1]\n\t\tconst b = points[i]\n\t\tconst stretch = along[i] - along[i - 1]\n\t\tconst t = stretch > 0 ? (d - along[i - 1]) / stretch : 0\n\t\treturn { x: a.x + (b.x - a.x) * t, z: a.z + (b.z - a.z) * t, facing: atan2(b.x - a.x, b.z - a.z) }\n\t}\n\n\t/** The nearest point of its middle line to a point, and how far along the path that is */\n\tnearest(point: Vec2): { at: Vec2; distance: number; along: number } {\n\t\tconst { points, along } = this\n\t\tif (points.length === 1) return { at: { ...points[0] }, distance: hypot(point.x - points[0].x, point.z - points[0].z), along: 0 }\n\t\tlet best = { at: { ...points[0] }, distance: Infinity, along: 0 }\n\t\tfor (let i = 1; i < points.length; i++) {\n\t\t\tconst a = points[i - 1]\n\t\t\tconst b = points[i]\n\t\t\tconst dx = b.x - a.x\n\t\t\tconst dz = b.z - a.z\n\t\t\tconst lengthSq = dx * dx + dz * dz\n\t\t\tconst t = lengthSq > 0 ? clamp(((point.x - a.x) * dx + (point.z - a.z) * dz) / lengthSq, 0, 1) : 0\n\t\t\tconst at = { x: a.x + dx * t, z: a.z + dz * t }\n\t\t\tconst distance = hypot(point.x - at.x, point.z - at.z)\n\t\t\tif (distance < best.distance) best = { at, distance, along: along[i - 1] + (along[i] - along[i - 1]) * t }\n\t\t}\n\t\treturn best\n\t}\n\n\t/** How far a point is from the middle of the path */\n\tdistanceTo(point: Vec2): number {\n\t\treturn this.nearest(point).distance\n\t}\n\n\t/** Whether a point is on the path: no more than half its width from its middle */\n\tcontains(point: Vec2): boolean {\n\t\treturn this.distanceTo(point) <= this.width / 2\n\t}\n\n\t/** Whether the middle of a cell of the map is on the path: what it paints, and keeps clear */\n\tcontainsCell(cx: number, cz: number): boolean {\n\t\treturn this.contains({ x: cx + 0.5, z: cz + 0.5 })\n\t}\n}\n"],"mappings":";;;;;;;;;;AAoBA,IAAa,OAAb,MAAkB;CAMP;CAEA;;CANV;CAEA,YAEC,QAEA,OACC;EAHQ,KAAA,SAAA;EAEA,KAAA,QAAA;EAET,KAAK,QAAQ,CAAC,CAAC;EACf,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,KAAK,MAAM,KAAK,KAAK,MAAM,IAAI,KAAK,MAAM,OAAO,EAAE,CAAC,IAAI,OAAO,IAAI,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,OAAO,IAAI,EAAE,CAAC,CAAC,CAAC;CAChJ;;CAGA,IAAI,SAAiB;EACpB,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS,MAAM;CAC7C;;CAGA,IAAI,QAAc;EACjB,OAAO,EAAE,GAAG,KAAK,OAAO,GAAG;CAC5B;;CAGA,IAAI,MAAY;EACf,OAAO,EAAE,GAAG,KAAK,OAAO,KAAK,OAAO,SAAS,GAAG;CACjD;;;;;CAMA,GAAG,UAAwB;EAC1B,MAAM,EAAE,QAAQ,UAAU;EAC1B,IAAI,OAAO,WAAW,GAAG,OAAO;GAAE,GAAG,OAAO;GAAI,QAAQ;EAAE;EAC1D,MAAM,IAAI,MAAM,UAAU,GAAG,KAAK,MAAM;EACxC,IAAI,IAAI;EACR,OAAO,IAAI,OAAO,SAAS,KAAK,MAAM,KAAK,GAAG;EAC9C,MAAM,IAAI,OAAO,IAAI;EACrB,MAAM,IAAI,OAAO;EACjB,MAAM,UAAU,MAAM,KAAK,MAAM,IAAI;EACrC,MAAM,IAAI,UAAU,KAAK,IAAI,MAAM,IAAI,MAAM,UAAU;EACvD,OAAO;GAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK;GAAG,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK;GAAG,QAAQ,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;EAAE;CAClG;;CAGA,QAAQ,OAA4D;EACnE,MAAM,EAAE,QAAQ,UAAU;EAC1B,IAAI,OAAO,WAAW,GAAG,OAAO;GAAE,IAAI,EAAE,GAAG,OAAO,GAAG;GAAG,UAAU,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC,GAAG,MAAM,IAAI,OAAO,EAAE,CAAC,CAAC;GAAG,OAAO;EAAE;EAChI,IAAI,OAAO;GAAE,IAAI,EAAE,GAAG,OAAO,GAAG;GAAG,UAAU;GAAU,OAAO;EAAE;EAChE,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;GACvC,MAAM,IAAI,OAAO,IAAI;GACrB,MAAM,IAAI,OAAO;GACjB,MAAM,KAAK,EAAE,IAAI,EAAE;GACnB,MAAM,KAAK,EAAE,IAAI,EAAE;GACnB,MAAM,WAAW,KAAK,KAAK,KAAK;GAChC,MAAM,IAAI,WAAW,IAAI,QAAQ,MAAM,IAAI,EAAE,KAAK,MAAM,MAAM,IAAI,EAAE,KAAK,MAAM,UAAU,GAAG,CAAC,IAAI;GACjG,MAAM,KAAK;IAAE,GAAG,EAAE,IAAI,KAAK;IAAG,GAAG,EAAE,IAAI,KAAK;GAAE;GAC9C,MAAM,WAAW,MAAM,MAAM,IAAI,GAAG,GAAG,MAAM,IAAI,GAAG,CAAC;GACrD,IAAI,WAAW,KAAK,UAAU,OAAO;IAAE;IAAI;IAAU,OAAO,MAAM,IAAI,MAAM,MAAM,KAAK,MAAM,IAAI,MAAM;GAAE;EAC1G;EACA,OAAO;CACR;;CAGA,WAAW,OAAqB;EAC/B,OAAO,KAAK,QAAQ,KAAK,CAAC,CAAC;CAC5B;;CAGA,SAAS,OAAsB;EAC9B,OAAO,KAAK,WAAW,KAAK,KAAK,KAAK,QAAQ;CAC/C;;CAGA,aAAa,IAAY,IAAqB;EAC7C,OAAO,KAAK,SAAS;GAAE,GAAG,KAAK;GAAK,GAAG,KAAK;EAAI,CAAC;CAClD;AACD"}

package/dist/plain.js

@@ -0,0 +1,57 @@
+//#region src/plain.ts
+/**
+* A copy of a value that is plain data all the way down: numbers, text, lists and plain objects, which is what a
+* file and a wire can carry. Throws when something in it is not (a `Map`, a class, a function), saying where:
+* `what` is whose data it is ("Save", "Map"), `where` the path so far, `advice` what to do about it
+*
+* @beta
+*/
+function plain(value, where, what, advice = "") {
+	if (value === null || value === void 0 || typeof value === "number" || typeof value === "string" || typeof value === "boolean") return value;
+	if (Array.isArray(value)) return value.map((item, i) => plain(item, `${where}[${i}]`, what, advice));
+	if (typeof value === "object") {
+		const prototype = Object.getPrototypeOf(value);
+		if (prototype !== Object.prototype && prototype !== null) throw new Error(`${what}: ${where} is a ${prototype?.constructor?.name ?? "thing"}, not plain data${advice && `: ${advice}`}`);
+		const copy = {};
+		for (const [key, item] of Object.entries(value)) if (item !== void 0) copy[key] = plain(item, `${where}.${key}`, what, advice);
+		return copy;
+	}
+	throw new Error(`${what}: ${where} is a ${typeof value}, not plain data`);
+}
+/**
+* The plain data of a value, and the paths of what was left out of it for not being plain (`settings.economy.workersPer`):
+* a plain object's fields each kept or left out, a list as a whole. For what keeps the data of something that may hold
+* code beside it (a computer player's options)
+*/
+function plainParts(value, where = "") {
+	const prototype = typeof value === "object" && value !== null && !Array.isArray(value) ? Object.getPrototypeOf(value) : void 0;
+	if (prototype === Object.prototype || prototype === null) {
+		const kept = {};
+		const dropped = [];
+		for (const [key, item] of Object.entries(value)) {
+			if (item === void 0) continue;
+			const part = plainParts(item, where ? `${where}.${key}` : key);
+			if (part.kept !== void 0) kept[key] = part.kept;
+			dropped.push(...part.dropped);
+		}
+		return {
+			kept,
+			dropped
+		};
+	}
+	try {
+		return {
+			kept: plain(value, where, "Plain parts"),
+			dropped: []
+		};
+	} catch {
+		return {
+			kept: void 0,
+			dropped: [where]
+		};
+	}
+}
+//#endregion
+export { plain, plainParts };
+
+//# sourceMappingURL=plain.js.map

package/dist/plain.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"plain.js","names":[],"sources":["../src/plain.ts"],"sourcesContent":["/**\n * A copy of a value that is plain data all the way down: numbers, text, lists and plain objects, which is what a\n * file and a wire can carry. Throws when something in it is not (a `Map`, a class, a function), saying where:\n * `what` is whose data it is (\"Save\", \"Map\"), `where` the path so far, `advice` what to do about it\n *\n * @beta\n */\nexport function plain(value: unknown, where: string, what: string, advice = ''): unknown {\n\tif (value === null || value === undefined || typeof value === 'number' || typeof value === 'string' || typeof value === 'boolean') return value\n\tif (Array.isArray(value)) return value.map((item, i) => plain(item, `${where}[${i}]`, what, advice))\n\tif (typeof value === 'object') {\n\t\tconst prototype = Object.getPrototypeOf(value)\n\t\tif (prototype !== Object.prototype && prototype !== null) {\n\t\t\tthrow new Error(`${what}: ${where} is a ${prototype?.constructor?.name ?? 'thing'}, not plain data${advice && `: ${advice}`}`)\n\t\t}\n\t\tconst copy: Record<string, unknown> = {}\n\t\tfor (const [key, item] of Object.entries(value)) if (item !== undefined) copy[key] = plain(item, `${where}.${key}`, what, advice)\n\t\treturn copy\n\t}\n\tthrow new Error(`${what}: ${where} is a ${typeof value}, not plain data`)\n}\n\n/**\n * The plain data of a value, and the paths of what was left out of it for not being plain (`settings.economy.workersPer`):\n * a plain object's fields each kept or left out, a list as a whole. For what keeps the data of something that may hold\n * code beside it (a computer player's options)\n */\nexport function plainParts(value: unknown, where = ''): { kept: unknown; dropped: string[] } {\n\tconst prototype = typeof value === 'object' && value !== null && !Array.isArray(value) ? Object.getPrototypeOf(value) : undefined\n\tif (prototype === Object.prototype || prototype === null) {\n\t\tconst kept: Record<string, unknown> = {}\n\t\tconst dropped: string[] = []\n\t\tfor (const [key, item] of Object.entries(value as object)) {\n\t\t\tif (item === undefined) continue\n\t\t\tconst part = plainParts(item, where ? `${where}.${key}` : key)\n\t\t\tif (part.kept !== undefined) kept[key] = part.kept\n\t\t\tdropped.push(...part.dropped)\n\t\t}\n\t\treturn { kept, dropped }\n\t}\n\ttry {\n\t\treturn { kept: plain(value, where, 'Plain parts'), dropped: [] }\n\t} catch {\n\t\treturn { kept: undefined, dropped: [where] }\n\t}\n}\n"],"mappings":";;;;;;;;AAOA,SAAgB,MAAM,OAAgB,OAAe,MAAc,SAAS,IAAa;CACxF,IAAI,UAAU,QAAQ,UAAU,KAAA,KAAa,OAAO,UAAU,YAAY,OAAO,UAAU,YAAY,OAAO,UAAU,WAAW,OAAO;CAC1I,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO,MAAM,KAAK,MAAM,MAAM,MAAM,MAAM,GAAG,MAAM,GAAG,EAAE,IAAI,MAAM,MAAM,CAAC;CACnG,IAAI,OAAO,UAAU,UAAU;EAC9B,MAAM,YAAY,OAAO,eAAe,KAAK;EAC7C,IAAI,cAAc,OAAO,aAAa,cAAc,MACnD,MAAM,IAAI,MAAM,GAAG,KAAK,IAAI,MAAM,QAAQ,WAAW,aAAa,QAAQ,QAAQ,kBAAkB,UAAU,KAAK,UAAU;EAE9H,MAAM,OAAgC,CAAC;EACvC,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,KAAK,GAAG,IAAI,SAAS,KAAA,GAAW,KAAK,OAAO,MAAM,MAAM,GAAG,MAAM,GAAG,OAAO,MAAM,MAAM;EAChI,OAAO;CACR;CACA,MAAM,IAAI,MAAM,GAAG,KAAK,IAAI,MAAM,QAAQ,OAAO,MAAM,iBAAiB;AACzE;;;;;;AAOA,SAAgB,WAAW,OAAgB,QAAQ,IAA0C;CAC5F,MAAM,YAAY,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK,IAAI,OAAO,eAAe,KAAK,IAAI,KAAA;CACxH,IAAI,cAAc,OAAO,aAAa,cAAc,MAAM;EACzD,MAAM,OAAgC,CAAC;EACvC,MAAM,UAAoB,CAAC;EAC3B,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,KAAe,GAAG;GAC1D,IAAI,SAAS,KAAA,GAAW;GACxB,MAAM,OAAO,WAAW,MAAM,QAAQ,GAAG,MAAM,GAAG,QAAQ,GAAG;GAC7D,IAAI,KAAK,SAAS,KAAA,GAAW,KAAK,OAAO,KAAK;GAC9C,QAAQ,KAAK,GAAG,KAAK,OAAO;EAC7B;EACA,OAAO;GAAE;GAAM;EAAQ;CACxB;CACA,IAAI;EACH,OAAO;GAAE,MAAM,MAAM,OAAO,OAAO,aAAa;GAAG,SAAS,CAAC;EAAE;CAChE,QAAQ;EACP,OAAO;GAAE,MAAM,KAAA;GAAW,SAAS,CAAC,KAAK;EAAE;CAC5C;AACD"}