@v12-engine/engine 0.1.0 → 0.4.0

package/dist/generate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"generate.js","names":[],"sources":["../src/generate.ts"],"sourcesContent":["/**\n * Maps made by a generator (world plan G1): a map from a seed and a few sliders, made of passes a game adds to,\n * replaces or leaves out, each a function of a context that holds the map, the seed's numbers, noise that repeats\n * across the map, the symmetry and what the passes before put down. Deterministic: the engine's `Rng`, nothing of\n * the clock. The engine's own passes shape the ground (`terrainPass`), paint it (`tilesPass`), seat the players\n * (`startsPass`), scatter things over it (`scatterPass`: trees now, rocks and houses the same way later), put\n * resources near the starts (`resourcesPass`) and lay roads (`roadsPass`); `generateMap` runs them and checks the map\n * (`checkMap`), trying the next seed where a start is cut off or blocked. A game declares its generator\n * (`Rules.generator`), for the editor and the page to find; `presetGenerator` is the engine's to take whole\n */\nimport { checkMap } from './mapCheck'\nimport { Rng } from './rng'\nimport { layeredNoise, type Noise2 } from './noise'\nimport {\n\tcreateMap,\n\ttype GameMap,\n\tMAP_CREEPS,\n\tMAP_NEUTRAL,\n\ttype MapCamp,\n\ttype MapDoodad,\n\ttype MapObject,\n\ttype MapPlayer,\n\ttype MapRegion,\n\tmapTerrain\n} from './map'\nimport type { MapProblem } from './mapFields'\nimport type { Vec2 } from './math'\nimport type { AreaShape } from './areas'\nimport type { PlayerId } from './entity'\nimport type { Registry } from './registry'\nimport { WATER_DEEP, WATER_NONE, WATER_SHALLOW } from './terrain'\nimport { atan, atan2, cos, hypot, sin } from './exactMath'\n\n/**\n * How a map is mirrored, so that it is fair: not at all, across x, across z, both ways, a half turn about the middle,\n * or quarter turns (a square map, its sides even). As the editor's symmetry says it\n *\n * @beta\n */\nexport type MapSymmetry = 'none' | 'x' | 'z' | 'both' | 'half' | 'quarter'\n\n/**\n * What a map is made with (`generateMap`): the seed, the size, the players, the symmetry, and the game's own\n * parameters (`MapGenerator.params`), each at its default where not said\n *\n * @beta\n */\nexport interface GeneratorOptions {\n\t/** The seed that makes the map: the same seed and options make the same map */\n\tseed: number\n\t/** The map's width in cells */\n\twidth: number\n\t/** The map's depth in cells */\n\tdepth: number\n\t/** How many players the map has starts for */\n\tplayers: number\n\t/** How the map is mirrored or turned so each player's side is alike: `none` when left out */\n\tsymmetry?: MapSymmetry\n\t/** The map's name: \"Generated <seed>\" when left out */\n\tname?: string\n\t/** The game's own parameters, by id, as the dialog's sliders and switches set them */\n\tparams?: Record<string, number | string | boolean>\n}\n\n/**\n * A parameter of a generator (`MapGenerator.params`): a slider, a switch or a choice in the editor's dialog and the\n * page's form, and a value in code (`GeneratorOptions.params`)\n *\n * @beta\n */\nexport interface GeneratorParamDef {\n\t/** The id the pass or parameter is kept by, in `GeneratorOptions.params` for a parameter */\n\tid: string\n\t/** The name shown in the editor's dialog and the page's form */\n\tname: string\n\t/** A line about it shown beside it in the form */\n\tdescription?: string\n\t/** A number on a slider (the default), a switch, or one of `choices` */\n\tkind?: 'number' | 'boolean' | 'choice'\n\t/** The value used when the options do not say: a number, a string for a `choice` or a boolean for a switch */\n\tdefault: number | string | boolean\n\t/** Of a `number`: the least the slider goes to */\n\tmin?: number\n\t/** Of a `number`: the most the slider goes to */\n\tmax?: number\n\t/** Of a `number`: the size of one step of the slider */\n\tstep?: number\n\t/** Of a `choice`: the values it can be, each with the label shown for it */\n\tchoices?: { value: string; label: string }[]\n}\n\n/**\n * What was put down by a pass, for the passes after to avoid or use (`GeneratorContext.placed`)\n *\n * @beta\n */\nexport interface GeneratorMark {\n\t/** The kind of thing marked, a name the passes agree on (`start`, `camp`), read by `GeneratorContext.free` */\n\tkind: string\n\t/** The mark's centre on the map's x axis, in cells */\n\tx: number\n\t/** The mark's centre on the map's z axis, in cells */\n\tz: number\n\t/** The radius the mark keeps clear, in cells */\n\tradius: number\n}\n\n/**\n * What a pass works with (`GeneratorPass.run`): the map as the passes before left it, the seed's numbers, noise that\n * repeats across the map, the symmetry, and what to put down with\n *\n * @beta\n */\nexport interface GeneratorContext {\n\t/** The map as the passes before left it; a pass changes it in place */\n\tmap: GameMap\n\t/** The seed's numbers: every draw of a pass is one of these, so the same seed makes the same map */\n\trng: Rng\n\t/** The options the map is made with: seed, size, players, symmetry and parameters */\n\toptions: GeneratorOptions\n\t/** The game's registry, which tells what unit types and doodads exist */\n\tregistry: Registry\n\t/** A parameter as it is: what the options say, or its default (`MapGenerator.params`), or `fallback` where neither says */\n\tparam<T extends number | string | boolean>(id: string, fallback: T): T\n\t/**\n\t * A place, and the places the symmetry mirrors or turns it to (the first is the place itself): what is put down at\n\t * one is put down at the others, so the map is fair\n\t */\n\tsymmetric(x: number, z: number): Vec2[]\n\t/** Whether a cell is the first of its mirrored set: what is done once a set is done at this one, and mirrored from it */\n\tcanonical(cx: number, cz: number): boolean\n\t/**\n\t * What `draw` makes, made once for a place and the places the symmetry mirrors it to: the first call of a set draws\n\t * (and spends the seed's numbers), the calls for its mirrors get the same. For a choice put down at every mirror\n\t * (a camp's creeps), so the map stays fair\n\t */\n\tonce<T>(x: number, z: number, draw: () => T): T\n\t/**\n\t * Noise that repeats across the map, by a name (the same name is the same noise), 0..1 at a point of the map in\n\t * cells; `cells` are the sizes of its features, coarsest first (`[32, 16, 8]` for hills). Mirrored as the map is\n\t */\n\tnoise(name: string, cells?: readonly number[]): (x: number, z: number) => number\n\t/** What the passes before put down, by kind */\n\tplaced: GeneratorMark[]\n\t/** Puts a mark down for the passes after: nothing on the map, only in `placed` */\n\tmark(kind: string, x: number, z: number, radius: number): void\n\t/** Whether nothing marked is within `radius` of a place (of `kinds` alone, when said) */\n\tfree(x: number, z: number, radius: number, kinds?: readonly string[]): boolean\n\t/** The level of the ground at a point: its cell's cliff level */\n\tlevelAt(x: number, z: number): number\n\t/** Whether a point is on the map and on ground something walks: no deep water, not off the map */\n\twalkable(x: number, z: number): boolean\n\t/** Scenery put down, with an id of its own: the model by its path in `models/`, as big as it says, turned as it says */\n\taddDoodad(doodad: Omit<MapDoodad, 'id' | 'scale' | 'yaw'> & { scale?: number | [number, number, number]; yaw?: number }): MapDoodad\n\t/** A unit or a building of a type put down, with an id of its own, for a player (`MAP_NEUTRAL`, `MAP_CREEPS`, or one of the map's) */\n\taddObject(type: string, owner: PlayerId, x: number, z: number, more?: Partial<Omit<MapObject, 'id' | 'type' | 'owner' | 'x' | 'z'>>): MapObject\n\t/** Creeps that guard a spot, with an id of their own */\n\taddCamp(x: number, z: number, units: string[], more?: Partial<Omit<MapCamp, 'id' | 'x' | 'z' | 'units'>>): MapCamp\n\t/** A region the rules watch by name, with an id of its own */\n\taddRegion(name: string, shape: AreaShape, more?: Partial<Omit<MapRegion, 'id' | 'name' | 'shape'>>): MapRegion\n}\n\n/**\n * A pass of a generator: one thing done to the map, in its turn (`MapGenerator.passes`)\n *\n * @beta\n */\nexport interface GeneratorPass {\n\t/** The id the pass is told apart by */\n\tid: string\n\t/** The name shown for the pass */\n\tname: string\n\t/** Does the pass's work on `ctx.map`, returning nothing */\n\trun(ctx: GeneratorContext): void\n}\n\n/**\n * A game's generator (`Rules.generator`): its parameters, as the dialog and the page show them, and its passes\n * in order. `generateMap` runs it\n *\n * @beta\n */\nexport interface MapGenerator {\n\t/** The parameters the generator takes, as the dialog and the page show them */\n\tparams: GeneratorParamDef[]\n\t/** The passes run in order, each working on the map the passes before made */\n\tpasses: GeneratorPass[]\n\t/**\n\t * How many seeds are tried where the map comes out with a problem that keeps it from being played (an error, a start\n\t * cut off from the others or blocked): 4 when left out\n\t */\n\ttries?: number\n}\n\n/**\n * How a map was made, kept with it (`GameMap.generated`): the same again from the same\n *\n * @beta\n */\nexport interface GeneratedWith {\n\t/** The seed the map came out of */\n\tseed: number\n\t/** The options the map was made with, kept so the same map can be made again */\n\toptions: GeneratorOptions\n}\n\n/**\n * The map a generator makes of options: its passes run in order on a map of the size and players asked, with the\n * game's tiles; then checked (`checkMap`). A map with a problem that keeps it from being played (a start cut off from\n * the others, or where nothing walks) is thrown away and the next seed tried, `tries` times; the last is given with\n * its problems. The map says how it was made (`GameMap.generated`)\n *\n * @beta\n */\nexport function generateMap(\n\tgenerator: MapGenerator,\n\toptions: GeneratorOptions,\n\tregistry: Registry\n): { map: GameMap; problems: MapProblem[]; seed: number } {\n\tconst tries = Math.max(1, generator.tries ?? 4)\n\tlet last: { map: GameMap; problems: MapProblem[]; seed: number } | undefined\n\tfor (let attempt = 0; attempt < tries; attempt++) {\n\t\tconst seed = options.seed + attempt\n\t\tconst map = createMap({\n\t\t\tname: options.name ?? `Generated ${seed}`,\n\t\t\twidth: options.width,\n\t\t\tdepth: options.depth,\n\t\t\tplayers: options.players,\n\t\t\tgame: registry.module?.id,\n\t\t\ttileset: registry.tileIds\n\t\t})\n\t\tconst ctx: GeneratorContext = createContext(map, { ...options, seed }, registry, generator)\n\t\tfor (const pass of generator.passes) pass.run(ctx)\n\t\tmap.generated = { seed, options: { ...options, seed } }\n\t\tconst problems = checkMap(map, registry)\n\t\tlast = { map, problems, seed }\n\t\tif (!problems.some(unplayable)) return last\n\t}\n\treturn last!\n}\n\n/** What keeps a map from being played, so that the next seed is tried: an error, or a start cut off from the others or blocked */\nconst unplayable = (problem: MapProblem) => problem.error || problem.rule === 'starts-apart' || problem.rule === 'start-blocked'\n\n// ---- the context\n\nconst SYMMETRIES: MapSymmetry[] = ['none', 'x', 'z', 'both', 'half', 'quarter']\n\n/**\n * The places a point is mirrored or turned to, the point first (as the editor's `mirrors`)\n *\n * @beta\n */\nexport function symmetricPlaces(symmetry: MapSymmetry, width: number, depth: number, x: number, z: number): Vec2[] {\n\tconst out: Vec2[] = [{ x, z }]\n\tconst add = (px: number, pz: number) => {\n\t\tif (!out.some((other) => Math.abs(other.x - px) < 1e-6 && Math.abs(other.z - pz) < 1e-6)) out.push({ x: px, z: pz })\n\t}\n\tswitch (symmetry) {\n\t\tcase 'x':\n\t\t\tadd(width - x, z)\n\t\t\tbreak\n\t\tcase 'z':\n\t\t\tadd(x, depth - z)\n\t\t\tbreak\n\t\tcase 'both':\n\t\t\tadd(width - x, z)\n\t\t\tadd(x, depth - z)\n\t\t\tadd(width - x, depth - z)\n\t\t\tbreak\n\t\tcase 'half':\n\t\t\tadd(width - x, depth - z)\n\t\t\tbreak\n\t\tcase 'quarter': {\n\t\t\tconst cx = width / 2\n\t\t\tconst cz = depth / 2\n\t\t\tfor (let k = 1; k < 4; k++) {\n\t\t\t\tlet px = x - cx\n\t\t\t\tlet pz = z - cz\n\t\t\t\tfor (let i = 0; i < k; i++) [px, pz] = [-pz, px]\n\t\t\t\tadd(cx + px, cz + pz)\n\t\t\t}\n\t\t\tbreak\n\t\t}\n\t}\n\treturn out\n}\n\n/** How many places a mirrored set has at most: four, for quarter turns and both ways */\nconst MIRRORS = 4\n\n/** The first of a point's mirrored set, by row then column: where a noise is read, so the noise is mirrored as the map is */\nfunction firstPlace(symmetry: MapSymmetry, width: number, depth: number, x: number, z: number, out: { x: number; z: number }): void {\n\tout.x = x\n\tout.z = z\n\tconst take = (px: number, pz: number) => takeFirst(out, px, pz)\n\tswitch (symmetry) {\n\t\tcase 'x':\n\t\t\ttake(width - x, z)\n\t\t\tbreak\n\t\tcase 'z':\n\t\t\ttake(x, depth - z)\n\t\t\tbreak\n\t\tcase 'both':\n\t\t\ttake(width - x, z)\n\t\t\ttake(x, depth - z)\n\t\t\ttake(width - x, depth - z)\n\t\t\tbreak\n\t\tcase 'half':\n\t\t\ttake(width - x, depth - z)\n\t\t\tbreak\n\t\tcase 'quarter': {\n\t\t\tconst cx = width / 2\n\t\t\tconst cz = depth / 2\n\t\t\tlet px = x - cx\n\t\t\tlet pz = z - cz\n\t\t\tfor (let k = 1; k < 4; k++) {\n\t\t\t\t;[px, pz] = [-pz, px]\n\t\t\t\ttake(cx + px, cz + pz)\n\t\t\t}\n\t\t\tbreak\n\t\t}\n\t}\n}\n\n/** The earlier of a place and another, by row then column, kept in `out` */\nfunction takeFirst(out: { x: number; z: number }, px: number, pz: number): void {\n\tif (pz < out.z - 1e-6 || (Math.abs(pz - out.z) < 1e-6 && px < out.x)) {\n\t\tout.x = px\n\t\tout.z = pz\n\t}\n}\n\n/** What the engine's passes use of a context beyond what a game's see: the mirror table */\ninterface GeneratorInternals {\n\t/** A cell's mirrored set, as cells, itself among them */\n\tmirrorsOf(c: number): number[]\n\t/** Sets a value in a cell and its mirrors */\n\tsetCell(array: Uint8Array, c: number, value: number): void\n}\n\nfunction createContext(map: GameMap, options: GeneratorOptions, registry: Registry, generator: MapGenerator): GeneratorContext & GeneratorInternals {\n\tconst { width, depth } = map\n\tconst symmetry = options.symmetry ?? 'none'\n\tif (!SYMMETRIES.includes(symmetry)) throw new Error(`generateMap: there is no symmetry \"${symmetry}\": ${SYMMETRIES.join(', ')}`)\n\tif (symmetry === 'quarter' && (width !== depth || width % 2)) throw new Error('generateMap: quarter turns need a square map with even sides')\n\tconst rng = new Rng(options.seed)\n\tconst defaults = Object.fromEntries(generator.params.map((param) => [param.id, param.default]))\n\tconst given = options.params ?? {}\n\tconst noises = new Map<string, Noise2>()\n\tconst placed: GeneratorMark[] = []\n\tlet nextId = 1\n\t// each cell's mirrored set, as cells (-1 past the end), and the first of it: where things are done once, and mirrored from\n\tconst mirrors = new Int32Array(width * depth * MIRRORS).fill(-1)\n\tconst canon = new Int32Array(width * depth)\n\tfor (let c = 0; c < canon.length; c++) {\n\t\tconst cx = c % width\n\t\tconst cz = (c - cx) / width\n\t\tlet first = c\n\t\tlet n = 0\n\t\tfor (const place of symmetricPlaces(symmetry, width, depth, cx + 0.5, cz + 0.5)) {\n\t\t\tconst mx = Math.floor(place.x)\n\t\t\tconst mz = Math.floor(place.z)\n\t\t\tif (mx < 0 || mz < 0 || mx >= width || mz >= depth) continue\n\t\t\tconst m = mz * width + mx\n\t\t\tmirrors[c * MIRRORS + n++] = m\n\t\t\tfirst = Math.min(first, m)\n\t\t}\n\t\tcanon[c] = first\n\t}\n\t// the marks in a grid of 8 cells, for what keeps off them to find the near ones alone\n\tconst GRID = 8\n\tconst cols = Math.ceil(width / GRID)\n\tconst rows = Math.ceil(depth / GRID)\n\tconst grid: number[][] = Array.from({ length: cols * rows }, () => [])\n\tlet widest = 0\n\tconst point = { x: 0, z: 0 }\n\tconst drawn = new Map<number, unknown>()\n\treturn {\n\t\tmap,\n\t\trng,\n\t\toptions,\n\t\tregistry,\n\t\tparam: <T extends number | string | boolean>(id: string, fallback: T): T => (given[id] ?? defaults[id] ?? fallback) as T,\n\t\tsymmetric: (x, z) => symmetricPlaces(symmetry, width, depth, x, z),\n\t\tcanonical: (cx, cz) => canon[cz * width + cx] === cz * width + cx,\n\t\tonce: <T>(x: number, z: number, draw: () => T): T => {\n\t\t\tconst cx = Math.min(Math.max(Math.floor(x), 0), width - 1)\n\t\t\tconst cz = Math.min(Math.max(Math.floor(z), 0), depth - 1)\n\t\t\tconst key = canon[cz * width + cx]\n\t\t\tif (drawn.has(key)) return drawn.get(key) as T\n\t\t\tconst value = draw()\n\t\t\tdrawn.set(key, value)\n\t\t\treturn value\n\t\t},\n\t\tmirrorsOf: (c) => {\n\t\t\tconst out: number[] = []\n\t\t\tfor (let i = 0; i < MIRRORS; i++) {\n\t\t\t\tconst m = mirrors[c * MIRRORS + i]\n\t\t\t\tif (m >= 0) out.push(m)\n\t\t\t}\n\t\t\treturn out\n\t\t},\n\t\tsetCell: (array, c, value) => {\n\t\t\tfor (let i = 0; i < MIRRORS; i++) {\n\t\t\t\tconst m = mirrors[c * MIRRORS + i]\n\t\t\t\tif (m >= 0) array[m] = value\n\t\t\t}\n\t\t},\n\t\tnoise(name, cells = [32, 16, 8]) {\n\t\t\tlet known = noises.get(name)\n\t\t\tif (!known) {\n\t\t\t\t// a seed of the name's own, so another name is another noise, and the same name the same\n\t\t\t\tlet salt = 0\n\t\t\t\tfor (const letter of name) salt = (salt * 31 + letter.charCodeAt(0)) >>> 0\n\t\t\t\tconst size = Math.max(width, depth)\n\t\t\t\tconst noise = layeredNoise(\n\t\t\t\t\toptions.seed + salt,\n\t\t\t\t\tcells.map((each) => Math.max(1, Math.round(size / each)))\n\t\t\t\t)\n\t\t\t\t// mirrored as the map is: read at the first of a point's mirrored set\n\t\t\t\tknown =\n\t\t\t\t\tsymmetry === 'none'\n\t\t\t\t\t\t? (x, z) => noise(x / size, z / size)\n\t\t\t\t\t\t: (x, z) => {\n\t\t\t\t\t\t\t\tfirstPlace(symmetry, width, depth, x, z, point)\n\t\t\t\t\t\t\t\treturn noise(point.x / size, point.z / size)\n\t\t\t\t\t\t\t}\n\t\t\t\tnoises.set(name, known)\n\t\t\t}\n\t\t\treturn known\n\t\t},\n\t\tplaced,\n\t\tmark: (kind, x, z, radius) => {\n\t\t\tplaced.push({ kind, x, z, radius })\n\t\t\twidest = Math.max(widest, radius)\n\t\t\tconst gx = Math.min(Math.max(Math.floor(x / GRID), 0), cols - 1)\n\t\t\tconst gz = Math.min(Math.max(Math.floor(z / GRID), 0), rows - 1)\n\t\t\tgrid[gz * cols + gx].push(placed.length - 1)\n\t\t},\n\t\tfree: (x, z, radius, kinds) => {\n\t\t\tconst reach = Math.ceil((radius + widest) / GRID)\n\t\t\tconst gx = Math.floor(x / GRID)\n\t\t\tconst gz = Math.floor(z / GRID)\n\t\t\tfor (let dz = -reach; dz <= reach; dz++)\n\t\t\t\tfor (let dx = -reach; dx <= reach; dx++) {\n\t\t\t\t\tconst gxx = gx + dx\n\t\t\t\t\tconst gzz = gz + dz\n\t\t\t\t\tif (gxx < 0 || gzz < 0 || gxx >= cols || gzz >= rows) continue\n\t\t\t\t\tfor (const i of grid[gzz * cols + gxx]) {\n\t\t\t\t\t\tconst each = placed[i]\n\t\t\t\t\t\tif (kinds && !kinds.includes(each.kind)) continue\n\t\t\t\t\t\tif (hypot(each.x - x, each.z - z) < radius + each.radius) return false\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\treturn true\n\t\t},\n\t\tlevelAt: (x, z) => {\n\t\t\tconst cx = Math.min(Math.max(Math.floor(x), 0), width - 1)\n\t\t\tconst cz = Math.min(Math.max(Math.floor(z), 0), depth - 1)\n\t\t\treturn map.levels[cz * width + cx]\n\t\t},\n\t\twalkable: (x, z) => {\n\t\t\tif (x < 0 || z < 0 || x >= width || z >= depth) return false\n\t\t\treturn map.water[Math.floor(z) * width + Math.floor(x)] !== WATER_DEEP\n\t\t},\n\t\taddDoodad(doodad) {\n\t\t\tconst { scale = 1, yaw = 0, ...rest } = doodad\n\t\t\tconst made: MapDoodad = { id: nextId++, yaw, scale: typeof scale === 'number' ? [scale, scale, scale] : scale, ...rest }\n\t\t\tmap.doodads.push(made)\n\t\t\treturn made\n\t\t},\n\t\taddObject(type, owner, x, z, more = {}) {\n\t\t\tconst made: MapObject = { id: nextId++, type, owner, x, z, facing: 0, scale: 1, ...more }\n\t\t\tmap.objects.push(made)\n\t\t\treturn made\n\t\t},\n\t\taddCamp(x, z, units, more = {}) {\n\t\t\tconst made: MapCamp = { id: nextId++, x, z, units, ...more }\n\t\t\tmap.camps.push(made)\n\t\t\treturn made\n\t\t},\n\t\taddRegion(name, shape, more = {}) {\n\t\t\tconst made: MapRegion = { id: nextId++, name, shape, ...more }\n\t\t\tmap.regions.push(made)\n\t\t\treturn made\n\t\t}\n\t}\n}\n\n// ---- the ground\n\n/**\n * What `terrainPass` takes: the parameters of the generator it reads where they are not given here\n *\n * @beta\n */\nexport interface TerrainPassOptions {\n\t/** How many cliff levels the ground rises through, 1 (flat) to 4: the parameter `levels`, or 2 */\n\tlevels?: number\n\t/** How much of the map is under water, 0..1: the parameter `water`, or 0.15 */\n\twater?: number\n\t/** How much the ground rolls within a level, 0..1: the parameter `roughness`, or 0.4 */\n\troughness?: number\n\t/** How many cells a hill is across, about: the parameter `hills`, or 24 */\n\thills?: number\n\t/** Whether ramps are cut so that every part of the ground can be walked to: yes when left out */\n\tramps?: boolean\n\t/** How wide a ramp is, in cells: 3 when left out */\n\trampWidth?: number\n\t/**\n\t * The lie of the land, where it is not the noise's alone: the ground's value at a point (high is high), made from the\n\t * point, the plateau noise there (0..1) and the map; the levels and the water are cut from the values as ever (the\n\t * lowest share water). A bay (`basinShape`: the corners high, a sea in the middle, an island in it), a valley, a\n\t * ridge: a shape of the game's own\n\t */\n\tshape?: (x: number, z: number, noise: number, map: GameMap) => number\n}\n\n/**\n * What `basinShape` takes\n *\n * @beta\n */\nexport interface BasinShapeOptions {\n\t/** How big the island in the middle is, 0..1 of the way to the corners: 0.14 when left out, 0 for no island */\n\tisland?: number\n\t/** How much the noise moves the shore and the island about, 0..1: 0.25 when left out */\n\troughness?: number\n\t/**\n\t * How high the island rises, in the shape's values (the corners are at 1, the middle of the sea at 0): 0.4 when\n\t * left out, which with `water` at 0.2 and three levels lands it on the lowest dry level, the beach's, so that fords\n\t * of shallow water reach it with no cliff between\n\t */\n\theight?: number\n}\n\n/**\n * The lie of a bay, for `terrainPass`'s `shape`: the corners high, the ground falling to a sea in the middle, an\n * island in it. With `water` at 0.25–0.35 the sea takes the middle and the shore runs round it; the starts in the\n * corners (`startsPass` with a spread of 0.4), the way between them along the shore\n *\n * @beta\n */\nexport function basinShape(options: BasinShapeOptions = {}): NonNullable<TerrainPassOptions['shape']> {\n\tconst island = Math.min(Math.max(options.island ?? 0.14, 0), 0.5)\n\tconst roughness = Math.min(Math.max(options.roughness ?? 0.25, 0), 1)\n\tconst height = Math.min(Math.max(options.height ?? 0.4, 0), 1)\n\treturn (x, z, noise, map) => {\n\t\t// how far from the middle, 0 there and 1 at a corner\n\t\tconst d = hypot((x / map.width - 0.5) * 2, (z / map.depth - 0.5) * 2) / Math.SQRT2\n\t\t// the island a plateau to its rim, not a peak: high until near its edge, then down into the sea\n\t\tconst r = island > 0 ? d / island : 1\n\t\tconst rise = r < 1 ? (1 - r * r * r * r) * height : 0\n\t\treturn d + rise + (noise - 0.5) * roughness\n\t}\n}\n\n/** Whether a cell is on the map */\nconst on = (map: GameMap, cx: number, cz: number) => cx >= 0 && cz >= 0 && cx < map.width && cz < map.depth\n\n/** The four cells next to one */\nconst NEIGHBOURS: readonly (readonly [number, number])[] = [\n\t[-1, 0],\n\t[1, 0],\n\t[0, -1],\n\t[0, 1]\n]\n\n/** How steep a cell is, in radians, from the heights at its corners: as `Terrain.slopeAt` has it, read straight off the terrain */\nfunction cellSlope(terrain: { heights: Float32Array; vertsX: number }, cx: number, cz: number): number {\n\tconst { heights, vertsX } = terrain\n\tconst v = cz * vertsX + cx\n\tconst dx = (heights[v + 1] + heights[v + vertsX + 1] - heights[v] - heights[v + vertsX]) / 2\n\tconst dz = (heights[v + vertsX] + heights[v + vertsX + 1] - heights[v] - heights[v + 1]) / 2\n\treturn atan(hypot(dx, dz))\n}\n\n/** The engine's passes reach the mirror table of the context they are given; a context of a game's own has none, and mirrors by `symmetric` */\nfunction internals(ctx: GeneratorContext): GeneratorInternals {\n\tconst own = ctx as Partial<GeneratorInternals>\n\tif (own.mirrorsOf && own.setCell) return own as GeneratorInternals\n\tconst { width } = ctx.map\n\tconst mirrorsOf = (c: number) => {\n\t\tconst cx = c % width\n\t\tconst cz = (c - cx) / width\n\t\treturn ctx.symmetric(cx + 0.5, cz + 0.5).flatMap((place) => {\n\t\t\tconst mx = Math.floor(place.x)\n\t\t\tconst mz = Math.floor(place.z)\n\t\t\treturn on(ctx.map, mx, mz) ? [mz * width + mx] : []\n\t\t})\n\t}\n\treturn { mirrorsOf, setCell: (array, c, value) => mirrorsOf(c).forEach((m) => (array[m] = value)) }\n}\n\n/**\n * The ground: a height field of noise, mirrored as the map is, quantised into cliff levels with the ground rolling\n * within each, water in the low ground, and ramps cut between the levels so that every part can be walked to\n *\n * @beta\n */\nexport function terrainPass(options: TerrainPassOptions = {}): GeneratorPass {\n\treturn {\n\t\tid: 'terrain',\n\t\tname: 'The ground',\n\t\trun(ctx) {\n\t\t\tconst { map } = ctx\n\t\t\tconst { width, depth } = map\n\t\t\tconst levels = Math.min(Math.max(Math.round(options.levels ?? ctx.param('levels', 2)), 1), 4)\n\t\t\tconst waterShare = Math.min(Math.max(options.water ?? ctx.param('water', 0.15), 0), 0.6)\n\t\t\tconst roughness = Math.min(Math.max(options.roughness ?? ctx.param('roughness', 0.4), 0), 1)\n\t\t\tconst hills = Math.max(4, options.hills ?? ctx.param('hills', 24))\n\t\t\tconst plateau = ctx.noise('plateau', [hills * 2, hills])\n\t\t\tconst roll = ctx.noise('roll', [hills / 2, hills / 4, hills / 8])\n\t\t\t// the levels: the plateau noise spread evenly, so each level has about its share of the map; the lowest share is water\n\t\t\tconst values = new Float32Array(width * depth)\n\t\t\tfor (let c = 0; c < values.length; c++) {\n\t\t\t\tconst x = (c % width) + 0.5\n\t\t\t\tconst z = Math.floor(c / width) + 0.5\n\t\t\t\tvalues[c] = options.shape ? options.shape(x, z, plateau(x, z), map) : plateau(x, z)\n\t\t\t}\n\t\t\t// where the levels and the water begin, from how the noise is spread: read off a sample of it, enough to be exact to a cell or so\n\t\t\tconst stride = Math.max(1, Math.floor(values.length / 16384))\n\t\t\tconst sorted = Float32Array.from({ length: Math.floor(values.length / stride) }, (_, i) => values[i * stride]).sort()\n\t\t\tconst quantile = (q: number) => sorted[Math.min(Math.max(Math.round(q * (sorted.length - 1)), 0), sorted.length - 1)]\n\t\t\tconst waterAt = quantile(waterShare)\n\t\t\tconst steps = Array.from({ length: levels - 1 }, (_, i) => quantile(waterShare + ((1 - waterShare) * (i + 1)) / levels))\n\t\t\tfor (let c = 0; c < values.length; c++) {\n\t\t\t\tlet level = 0\n\t\t\t\tfor (const step of steps) if (values[c] >= step) level++\n\t\t\t\tmap.levels[c] = level\n\t\t\t\tmap.water[c] = values[c] < waterAt ? WATER_DEEP : WATER_NONE\n\t\t\t}\n\t\t\t// no cells alone of their level: a cliff of one cell is a spike. Each cell takes the level most of its neighbours have, twice over\n\t\t\tconst { setCell } = internals(ctx)\n\t\t\tconst counts = new Int32Array(5)\n\t\t\tfor (let round = 0; round < 2; round++) {\n\t\t\t\tconst before = map.levels.slice()\n\t\t\t\tfor (let c = 0; c < before.length; c++) {\n\t\t\t\t\tconst cx = c % width\n\t\t\t\t\tconst cz = (c - cx) / width\n\t\t\t\t\tif (!ctx.canonical(cx, cz)) continue\n\t\t\t\t\tcounts.fill(0)\n\t\t\t\t\tfor (let dz = -1; dz <= 1; dz++)\n\t\t\t\t\t\tfor (let dx = -1; dx <= 1; dx++) if (on(map, cx + dx, cz + dz)) counts[before[(cz + dz) * width + cx + dx]]++\n\t\t\t\t\tlet best = before[c]\n\t\t\t\t\tlet most = counts[best]\n\t\t\t\t\tfor (let level = 0; level < counts.length; level++) if (counts[level] > most) [best, most] = [level, counts[level]]\n\t\t\t\t\tif (best !== before[c]) setCell(map.levels, c, best)\n\t\t\t\t}\n\t\t\t}\n\t\t\t// water lies in the low ground alone, shallow at its rim\n\t\t\tfor (let c = 0; c < values.length; c++) if (map.levels[c] > 0) map.water[c] = WATER_NONE\n\t\t\tconst deep = map.water.slice()\n\t\t\tfor (let c = 0; c < deep.length; c++) {\n\t\t\t\tif (deep[c] !== WATER_DEEP) continue\n\t\t\t\tconst cx = c % width\n\t\t\t\tconst cz = (c - cx) / width\n\t\t\t\tlet rim = false\n\t\t\t\tfor (const [dx, dz] of NEIGHBOURS) if (on(map, cx + dx, cz + dz) && deep[(cz + dz) * width + cx + dx] !== WATER_DEEP) rim = true\n\t\t\t\tif (rim) map.water[c] = WATER_SHALLOW\n\t\t\t}\n\t\t\t// the ground rolls within a level, lower under the water\n\t\t\tconst vx = width + 1\n\t\t\tfor (let iz = 0; iz <= depth; iz++)\n\t\t\t\tfor (let ix = 0; ix <= width; ix++) {\n\t\t\t\t\tconst v = iz * vx + ix\n\t\t\t\t\tmap.ground[v] = 1 + (roll(ix, iz) - 0.5) * roughness * 1.5\n\t\t\t\t}\n\t\t\tif (options.ramps !== false) cutRamps(ctx, Math.max(2, Math.round(options.rampWidth ?? 3)))\n\t\t}\n\t}\n}\n\n/**\n * Ramps between the levels, so that every part of the ground joins the rest: the parts of a level (a flood fill on the\n * level map, water left out) joined by a ramp each across the straightest stretch of cliff between two of them, the\n * nearest the middle of both first, until all are one; mirrored as the map is\n */\nfunction cutRamps(ctx: GeneratorContext, rampWidth: number): void {\n\tconst { map } = ctx\n\tconst { width, depth, levels, water, ramps } = map\n\tconst { setCell } = internals(ctx)\n\t// the parts: cells of one level, joined, with no water\n\tconst part = new Int32Array(width * depth).fill(-1)\n\tconst parts: { cells: number; x: number; z: number }[] = []\n\tconst queue = new Int32Array(width * depth)\n\tfor (let start = 0; start < part.length; start++) {\n\t\tif (part[start] >= 0 || water[start] === WATER_DEEP) continue\n\t\tconst id = parts.length\n\t\tconst sum = { cells: 0, x: 0, z: 0 }\n\t\tparts.push(sum)\n\t\tlet head = 0\n\t\tlet tail = 0\n\t\tqueue[tail++] = start\n\t\tpart[start] = id\n\t\twhile (head < tail) {\n\t\t\tconst c = queue[head++]\n\t\t\tconst cx = c % width\n\t\t\tconst cz = (c - cx) / width\n\t\t\tsum.cells++\n\t\t\tsum.x += cx + 0.5\n\t\t\tsum.z += cz + 0.5\n\t\t\tfor (const [dx, dz] of NEIGHBOURS) {\n\t\t\t\tconst nx = cx + dx\n\t\t\t\tconst nz = cz + dz\n\t\t\t\tif (!on(map, nx, nz)) continue\n\t\t\t\tconst n = nz * width + nx\n\t\t\t\tif (part[n] >= 0 || water[n] === WATER_DEEP || levels[n] !== levels[c]) continue\n\t\t\t\tpart[n] = id\n\t\t\t\tqueue[tail++] = n\n\t\t\t}\n\t\t}\n\t}\n\tfor (const each of parts) {\n\t\teach.x /= each.cells\n\t\teach.z /= each.cells\n\t}\n\tif (parts.length < 2) return\n\t// a ramp can go where a stretch of cliff is straight: `rampWidth` cells along the edge, two deep either side, all of\n\t// one level a side, none of it water. Each a candidate between the two parts, with how far from their middles it is\n\tconst half = Math.floor(rampWidth / 2)\n\tconst candidates: { a: number; b: number; cells: number[]; cost: number }[] = []\n\tconst straight = (cx: number, cz: number, dx: number, dz: number): number[] | undefined => {\n\t\t// the edge between (cx, cz) and (cx + dx, cz + dz): along it is (dz, dx)\n\t\tconst low = cz * width + cx\n\t\tconst high = (cz + dz) * width + cx + dx\n\t\tif (Math.abs(levels[low] - levels[high]) !== 1) return undefined\n\t\tconst cells: number[] = []\n\t\tfor (let along = -half; along < rampWidth - half; along++) {\n\t\t\tfor (let deep = -1; deep <= 2; deep++) {\n\t\t\t\tconst x = cx + dz * along + dx * deep\n\t\t\t\tconst z = cz + dx * along + dz * deep\n\t\t\t\tif (!on(map, x, z)) return undefined\n\t\t\t\tconst c = z * width + x\n\t\t\t\tif (water[c] !== WATER_NONE) return undefined\n\t\t\t\tif (levels[c] !== (deep <= 0 ? levels[low] : levels[high])) return undefined\n\t\t\t\tif (deep >= 0 && deep <= 1) cells.push(c)\n\t\t\t}\n\t\t}\n\t\treturn cells\n\t}\n\tfor (let cz = 0; cz < depth; cz++)\n\t\tfor (let cx = 0; cx < width; cx++) {\n\t\t\tif (!ctx.canonical(cx, cz)) continue\n\t\t\tfor (const [dx, dz] of [\n\t\t\t\t[1, 0],\n\t\t\t\t[0, 1]\n\t\t\t]) {\n\t\t\t\tif (!on(map, cx + dx, cz + dz)) continue\n\t\t\t\tconst cells = straight(cx, cz, dx, dz)\n\t\t\t\tif (!cells) continue\n\t\t\t\tconst a = part[cz * width + cx]\n\t\t\t\tconst b = part[(cz + dz) * width + cx + dx]\n\t\t\t\tif (a < 0 || b < 0 || a === b) continue\n\t\t\t\tconst mx = (parts[a].x + parts[b].x) / 2\n\t\t\t\tconst mz = (parts[a].z + parts[b].z) / 2\n\t\t\t\tcandidates.push({ a, b, cells, cost: hypot(cx + 0.5 - mx, cz + 0.5 - mz) })\n\t\t\t}\n\t\t}\n\tcandidates.sort((p, q) => p.cost - q.cost)\n\t// joined as a spanning tree: the nearest the middle first, never two between the same two parts\n\tconst root = parts.map((_, i) => i)\n\tconst find = (i: number): number => (root[i] === i ? i : (root[i] = find(root[i])))\n\tfor (const candidate of candidates) {\n\t\tconst a = find(candidate.a)\n\t\tconst b = find(candidate.b)\n\t\tif (a === b) continue\n\t\troot[a] = b\n\t\tfor (const c of candidate.cells) setCell(ramps, c, 1)\n\t}\n}\n\n// ---- the paint\n\n/**\n * What `tilesPass` takes: how a cell is painted, from what the ground is there\n *\n * @beta\n */\nexport interface TilesPassOptions {\n\t/**\n\t * The tile a cell is painted with, by id, or nothing for none (the ground's own colours): from its level, the slope\n\t * there (radians), how wet it is (a noise, 0..1) and whether it is by the water. The engine's own rule when left\n\t * out: `sand` by the water, `rock` on steep ground (the cliffs), `snow` on the top of four levels or more, `dirt`\n\t * where it is dry, each where the game has such a tile\n\t */\n\tby?: (\n\t\tcell: { x: number; z: number; level: number; slope: number; moisture: number; shore: boolean },\n\t\ttiles: readonly string[]\n\t) => string | undefined\n}\n\n/**\n * The paint: each cell a tile by what the ground is there, through the game's tiles by name\n *\n * @beta\n */\nexport function tilesPass(options: TilesPassOptions = {}): GeneratorPass {\n\treturn {\n\t\tid: 'tiles',\n\t\tname: 'The paint',\n\t\trun(ctx) {\n\t\t\tconst { map, registry } = ctx\n\t\t\tconst { width, depth } = map\n\t\t\tconst tiles = registry.tileIds\n\t\t\tif (!tiles.length) return\n\t\t\tconst terrain = mapTerrain(map)\n\t\t\tconst moisture = ctx.noise('moisture', [20, 10])\n\t\t\tlet top = 0\n\t\t\tfor (const level of map.levels) top = Math.max(top, level)\n\t\t\tconst by =\n\t\t\t\toptions.by ??\n\t\t\t\t((cell, ids) => {\n\t\t\t\t\tconst has = (id: string) => (ids.includes(id) ? id : undefined)\n\t\t\t\t\tif (cell.shore) return has('sand')\n\t\t\t\t\tif (cell.slope > 0.5) return has('rock')\n\t\t\t\t\tif (cell.level === top && top >= 3) return has('snow') ?? has('rock')\n\t\t\t\t\tif (cell.moisture < 0.35) return has('dirt')\n\t\t\t\t\treturn undefined\n\t\t\t\t})\n\t\t\tfor (let cz = 0; cz < depth; cz++)\n\t\t\t\tfor (let cx = 0; cx < width; cx++) {\n\t\t\t\t\tconst c = cz * width + cx\n\t\t\t\t\tif (map.water[c] === WATER_DEEP) continue\n\t\t\t\t\tlet shore = map.water[c] === WATER_SHALLOW\n\t\t\t\t\tif (!shore)\n\t\t\t\t\t\tfor (const [dx, dz] of NEIGHBOURS) if (on(map, cx + dx, cz + dz) && map.water[(cz + dz) * width + cx + dx] !== WATER_NONE) shore = true\n\t\t\t\t\tconst id = by(\n\t\t\t\t\t\t{ x: cx, z: cz, level: map.levels[c], slope: cellSlope(terrain, cx, cz), moisture: moisture(cx + 0.5, cz + 0.5), shore },\n\t\t\t\t\t\ttiles\n\t\t\t\t\t)\n\t\t\t\t\tmap.tiles[c] = id ? registry.tile(id) : 0\n\t\t\t\t}\n\t\t}\n\t}\n}\n\n// ---- the starts\n\n/**\n * What `startsPass` takes\n *\n * @beta\n */\nexport interface StartsPassOptions {\n\t/** How many cells around a start are flattened and dried: 6 when left out */\n\tclearing?: number\n\t/** How far from the map's middle the starts stand, 0..0.5 of its size: 0.36 when left out */\n\tspread?: number\n\t/** What a game puts at a start: its town hall and workers. Nothing when left out */\n\tfrom?: (player: MapPlayer, at: Vec2, ctx: GeneratorContext) => void\n}\n\n/**\n * The starts: as far apart as the symmetry allows (mirrored from one, or around the middle), each on flat, dry ground\n * (a clearing made for it), the player's `start` set, and what the game puts there\n *\n * @beta\n */\nexport function startsPass(options: StartsPassOptions = {}): GeneratorPass {\n\treturn {\n\t\tid: 'starts',\n\t\tname: 'The starts',\n\t\trun(ctx) {\n\t\t\tconst { map, rng } = ctx\n\t\t\tconst { width, depth } = map\n\t\t\tconst players = map.players.filter((player) => player.id !== MAP_NEUTRAL && player.id !== MAP_CREEPS)\n\t\t\tif (!players.length) return\n\t\t\tconst clearing = Math.max(2, options.clearing ?? 6)\n\t\t\tconst spread = Math.min(Math.max(options.spread ?? 0.36, 0.1), 0.48)\n\t\t\tconst symmetry = ctx.options.symmetry ?? 'none'\n\t\t\t// how many a mirrored set gives: that many starts from one place\n\t\t\tconst setSize = ctx.symmetric(width * 0.3, depth * 0.2).length\n\t\t\tconst seeds = Math.ceil(players.length / setSize)\n\t\t\tconst places: Vec2[] = []\n\t\t\tconst angle0 = symmetry === 'none' ? rng.next() * Math.PI * 2 : symmetry === 'x' ? Math.PI : symmetry === 'z' ? Math.PI / 2 : Math.PI * 1.25\n\t\t\t// a set can give fewer places than `setSize` (a start on a mirror axis is its own mirror): go on round the ring until each player has one\n\t\t\tfor (let i = 0; i < seeds + players.length && places.length < players.length; i++) {\n\t\t\t\tconst angle = angle0 + (i * Math.PI * 2) / Math.max(seeds * setSize, 1)\n\t\t\t\tconst x = width / 2 + cos(angle) * width * spread\n\t\t\t\tconst z = depth / 2 + sin(angle) * depth * spread\n\t\t\t\tfor (const place of ctx.symmetric(x, z)) if (places.length < players.length) places.push(place)\n\t\t\t}\n\t\t\tplayers.forEach((player, i) => {\n\t\t\t\tconst at = dryGround(ctx, places[i], clearing)\n\t\t\t\tclear(ctx, at, clearing)\n\t\t\t\tplayer.start = { x: at.x, z: at.z }\n\t\t\t\tctx.mark('start', at.x, at.z, clearing)\n\t\t\t\toptions.from?.(player, at, ctx)\n\t\t\t})\n\t\t}\n\t}\n}\n\n/**\n * The nearest place to one that is not in the water, at a cell's middle: for a pass of a game's own that puts something\n * down where the ground may be wet\n *\n * @beta\n */\nexport const nearestDryGround = (ctx: GeneratorContext, at: Vec2, reach: number): Vec2 => dryGround(ctx, at, reach)\n\n/**\n * The ground around a place made flat and dry: one level (the one there, or `level`), no water, no ramps, the ground at\n * one height eased into what is around; mirrored as the map is, unless `alone`. What a start's clearing and a mine's\n * are made with, for a pass of a game's own\n *\n * @beta\n */\nexport const clearGround = (ctx: GeneratorContext, at: Vec2, radius: number, alone = false, level?: number): void =>\n\tclear(ctx, at, radius, alone, level ?? ctx.levelAt(at.x, at.z))\n\n/** The nearest place to one that is not in the water, at a cell's middle */\nfunction dryGround(ctx: GeneratorContext, at: Vec2, reach: number): Vec2 {\n\tconst { map } = ctx\n\tconst { width, depth } = map\n\tconst cx = Math.min(Math.max(Math.floor(at.x), 1), width - 2)\n\tconst cz = Math.min(Math.max(Math.floor(at.z), 1), depth - 2)\n\tfor (let r = 0; r <= reach * 3; r++)\n\t\tfor (let dz = -r; dz <= r; dz++)\n\t\t\tfor (let dx = -r; dx <= r; dx++) {\n\t\t\t\tif (Math.max(Math.abs(dx), Math.abs(dz)) !== r) continue\n\t\t\t\tconst x = cx + dx\n\t\t\t\tconst z = cz + dz\n\t\t\t\tif (x < 1 || z < 1 || x >= width - 1 || z >= depth - 1) continue\n\t\t\t\tif (map.water[z * width + x] === WATER_NONE) return { x: x + 0.5, z: z + 0.5 }\n\t\t\t}\n\treturn { x: cx + 0.5, z: cz + 0.5 }\n}\n\n/** The ground around a place made flat and dry: one level, no water, no ramps, the ground at one height. Mirrored, unless `alone` */\nfunction clear(ctx: GeneratorContext, at: Vec2, radius: number, alone = false, level = ctx.levelAt(at.x, at.z)): void {\n\tconst { map } = ctx\n\tconst { width, depth } = map\n\tconst vx = width + 1\n\tlet height = 0\n\tlet count = 0\n\tfor (let iz = Math.max(Math.floor(at.z - radius), 0); iz <= Math.min(Math.ceil(at.z + radius), depth); iz++)\n\t\tfor (let ix = Math.max(Math.floor(at.x - radius), 0); ix <= Math.min(Math.ceil(at.x + radius), width); ix++) {\n\t\t\theight += map.ground[iz * vx + ix]\n\t\t\tcount++\n\t\t}\n\theight /= Math.max(count, 1)\n\tfor (const place of alone ? [at] : ctx.symmetric(at.x, at.z)) {\n\t\tfor (let cz = Math.max(Math.floor(place.z - radius), 0); cz < Math.min(Math.ceil(place.z + radius), depth); cz++)\n\t\t\tfor (let cx = Math.max(Math.floor(place.x - radius), 0); cx < Math.min(Math.ceil(place.x + radius), width); cx++) {\n\t\t\t\tif (hypot(cx + 0.5 - place.x, cz + 0.5 - place.z) > radius) continue\n\t\t\t\tconst c = cz * width + cx\n\t\t\t\tmap.levels[c] = level\n\t\t\t\tmap.water[c] = WATER_NONE\n\t\t\t\tmap.ramps[c] = 0\n\t\t\t}\n\t\tfor (let iz = Math.max(Math.floor(place.z - radius), 0); iz <= Math.min(Math.ceil(place.z + radius), depth); iz++)\n\t\t\tfor (let ix = Math.max(Math.floor(place.x - radius), 0); ix <= Math.min(Math.ceil(place.x + radius), width); ix++) {\n\t\t\t\tconst d = hypot(ix - place.x, iz - place.z)\n\t\t\t\tif (d > radius) continue\n\t\t\t\t// flat in the middle, eased into the ground around at the rim\n\t\t\t\tconst t = Math.min(Math.max((d - radius * 0.6) / (radius * 0.4), 0), 1)\n\t\t\t\tconst v = iz * vx + ix\n\t\t\t\tmap.ground[v] = height + (map.ground[v] - height) * t * t * (3 - 2 * t)\n\t\t\t}\n\t}\n}\n\n// ---- things scattered\n\n/**\n * What `scatterPass` takes: how much of what, where\n *\n * @beta\n */\nexport interface ScatterPassOptions {\n\t/** What the things are, for the passes after (`placed`): `trees`, `rocks` */\n\tkind: string\n\t/** Puts one down at a place: a doodad, a unit, a camp, a region */\n\twhat: (ctx: GeneratorContext, at: Vec2) => void\n\t/** How much of the map they cover, 0..1: the parameter `<kind>` where the generator has one, or 0.12 */\n\tdensity?: number\n\t/** How far apart they are at least, in cells: 1.5 when left out */\n\tspacing?: number\n\t/** How big each is, for what comes after to keep off: half the spacing when left out */\n\tradius?: number\n\t/** How far from a start they keep, in cells: 10 when left out */\n\tavoid?: number\n\t/** What else they keep off, by kind (`placed`), with how far: the starts always */\n\tavoidKinds?: Record<string, number>\n\t/** Where they may go: a cell's level, slope, water and the noise of the kind (0..1, patches). On any dry ground when left out */\n\twhere?: (cell: { x: number; z: number; level: number; slope: number; noise: number; shore: boolean }) => boolean\n\t/** In patches of a noise (how much the noise decides, 0 even, 1 all in patches): 0.6 when left out */\n\tpatches?: number\n}\n\n/**\n * Things scattered over the map: as many as the density says, in patches of a noise, at least `spacing` apart, off\n * the starts and what else they avoid, where they may go; each put down by `what`, mirrored as the map is. Trees now;\n * rocks, houses, ruins and the rest the same way, with another `what`\n *\n * @beta\n */\nexport function scatterPass(options: ScatterPassOptions): GeneratorPass {\n\treturn {\n\t\tid: `scatter:${options.kind}`,\n\t\tname: `Scattered: ${options.kind}`,\n\t\trun(ctx) {\n\t\t\tconst { map, rng } = ctx\n\t\t\tconst { width, depth } = map\n\t\t\tconst density = Math.min(Math.max(options.density ?? ctx.param(options.kind, 0.12), 0), 1)\n\t\t\tif (density <= 0) return\n\t\t\tconst spacing = Math.max(0.5, options.spacing ?? 1.5)\n\t\t\tconst radius = options.radius ?? spacing / 2\n\t\t\tconst avoid = options.avoid ?? 10\n\t\t\tconst patches = Math.min(Math.max(options.patches ?? 0.6, 0), 1)\n\t\t\tconst noise = ctx.noise(`scatter:${options.kind}`, [24, 12, 6])\n\t\t\t// the slopes, for a `where` that asks: the terrain made once, only then\n\t\t\tlet made: ReturnType<typeof mapTerrain> | undefined\n\t\t\tconst terrain = () => (made ??= mapTerrain(map))\n\t\t\t// what is put down, in a grid of the spacing, so that nothing comes too close\n\t\t\tconst cell = spacing\n\t\t\tconst cols = Math.ceil(width / cell)\n\t\t\tconst rows = Math.ceil(depth / cell)\n\t\t\tconst grid: Vec2[][] = Array.from({ length: cols * rows }, () => [])\n\t\t\tconst tooClose = (x: number, z: number) => {\n\t\t\t\tconst gx = Math.floor(x / cell)\n\t\t\t\tconst gz = Math.floor(z / cell)\n\t\t\t\tfor (let dz = -1; dz <= 1; dz++)\n\t\t\t\t\tfor (let dx = -1; dx <= 1; dx++) {\n\t\t\t\t\t\tconst gxx = gx + dx\n\t\t\t\t\t\tconst gzz = gz + dz\n\t\t\t\t\t\tif (gxx < 0 || gzz < 0 || gxx >= cols || gzz >= rows) continue\n\t\t\t\t\t\tfor (const other of grid[gzz * cols + gxx]) if (hypot(other.x - x, other.z - z) < spacing) return true\n\t\t\t\t\t}\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tconst put = (x: number, z: number) => {\n\t\t\t\tgrid[Math.floor(z / cell) * cols + Math.floor(x / cell)].push({ x, z })\n\t\t\t\tctx.mark(options.kind, x, z, radius)\n\t\t\t\toptions.what(ctx, { x, z })\n\t\t\t}\n\t\t\t// each cell tries once, the first of its mirrored set for all of them: a draw against the density, in patches\n\t\t\tfor (let cz = 0; cz < depth; cz++)\n\t\t\t\tfor (let cx = 0; cx < width; cx++) {\n\t\t\t\t\tif (!ctx.canonical(cx, cz)) continue\n\t\t\t\t\tconst c = cz * width + cx\n\t\t\t\t\tconst x = cx + rng.next()\n\t\t\t\t\tconst z = cz + rng.next()\n\t\t\t\t\tconst n = noise(x, z)\n\t\t\t\t\tconst chance = density * (1 - patches + patches * Math.min(Math.max((n - 0.35) / 0.3, 0), 1) * 2)\n\t\t\t\t\tif (rng.next() >= chance) continue\n\t\t\t\t\tif (map.water[c] !== WATER_NONE) continue\n\t\t\t\t\tif (options.where) {\n\t\t\t\t\t\tconst shore = NEIGHBOURS.some(([dx, dz]) => on(map, cx + dx, cz + dz) && map.water[(cz + dz) * width + cx + dx] !== WATER_NONE)\n\t\t\t\t\t\tif (!options.where({ x, z, level: map.levels[c], slope: cellSlope(terrain(), cx, cz), noise: n, shore })) continue\n\t\t\t\t\t}\n\t\t\t\t\tif (map.ramps[c]) continue\n\t\t\t\t\tif (!ctx.free(x, z, avoid, ['start'])) continue\n\t\t\t\t\tif (options.avoidKinds && Object.entries(options.avoidKinds).some(([kind, far]) => !ctx.free(x, z, far, [kind]))) continue\n\t\t\t\t\tconst places = ctx.symmetric(x, z).filter((place) => place.x >= 0 && place.z >= 0 && place.x < width && place.z < depth)\n\t\t\t\t\tif (places.some((place) => tooClose(place.x, place.z))) continue\n\t\t\t\t\tfor (const place of places) put(place.x, place.z)\n\t\t\t\t}\n\t\t}\n\t}\n}\n\n// ---- resources\n\n/**\n * What `resourcesPass` takes: where the game's mines go, and what the game puts there\n *\n * @beta\n */\nexport interface ResourcesPassOptions {\n\t/** How far from each start its own stands, in cells: 8 when left out; `false` for none at the starts (a game puts those down itself) */\n\tmain?: number | false\n\t/** How many more there are besides the starts', spread over the map and mirrored: 2 when left out */\n\textra?: number\n\t/** How far apart the extra ones keep from each other and from the starts, in cells: 20 when left out */\n\tspacing?: number\n\t/**\n\t * How many cells around each are made flat and dry for it, as a start's clearing is: 3 when left out, enough for a\n\t * mine of 4 by 4; 0 for none\n\t */\n\tclearing?: number\n\t/** Puts the resource down: the game's mine, a camp guarding it. Told the start it is for, where it is one's */\n\tfrom: (ctx: GeneratorContext, at: Vec2, start?: MapPlayer) => void\n}\n\n/**\n * Resources: one near each start (towards the map's middle, as far as `main` says), and more spread over the map,\n * mirrored as the map is, each put down by the game\n *\n * @beta\n */\nexport function resourcesPass(options: ResourcesPassOptions): GeneratorPass {\n\treturn {\n\t\tid: 'resources',\n\t\tname: 'The resources',\n\t\trun(ctx) {\n\t\t\tconst { map, rng } = ctx\n\t\t\tconst { width, depth } = map\n\t\t\tconst main = options.main ?? 8\n\t\t\tconst spacing = options.spacing ?? 20\n\t\t\tconst clearing = options.clearing ?? 3\n\t\t\tfor (const player of map.players) {\n\t\t\t\tif (!player.start || main === false) continue\n\t\t\t\tconst toward = atan2(depth / 2 - player.start.z, width / 2 - player.start.x) + (rng.next() - 0.5) * 0.8\n\t\t\t\tconst at = dryGround(ctx, { x: player.start.x + cos(toward) * main, z: player.start.z + sin(toward) * main }, 4)\n\t\t\t\t// on the start's level, its clearing reaching the start's: its workers walk to it\n\t\t\t\tif (clearing > 0) clear(ctx, at, clearing, true, ctx.levelAt(player.start.x, player.start.z))\n\t\t\t\tctx.mark('resource', at.x, at.z, 3)\n\t\t\t\toptions.from(ctx, at, player)\n\t\t\t}\n\t\t\tconst extra = Math.max(0, Math.round(options.extra ?? 2))\n\t\t\tlet placed = 0\n\t\t\tfor (let attempt = 0; attempt < extra * 40 && placed < extra; attempt++) {\n\t\t\t\tconst x = 4 + rng.next() * (width - 8)\n\t\t\t\tconst z = 4 + rng.next() * (depth - 8)\n\t\t\t\tif (!ctx.canonical(Math.floor(x), Math.floor(z))) continue\n\t\t\t\tconst places = ctx.symmetric(x, z)\n\t\t\t\tif (!places.every((place) => ctx.walkable(place.x, place.z) && ctx.free(place.x, place.z, spacing, ['start', 'resource']))) continue\n\t\t\t\tfor (const place of places) {\n\t\t\t\t\tconst at = dryGround(ctx, place, 4)\n\t\t\t\t\tif (clearing > 0) clear(ctx, at, clearing, true)\n\t\t\t\t\tctx.mark('resource', at.x, at.z, 3)\n\t\t\t\t\toptions.from(ctx, at)\n\t\t\t\t}\n\t\t\t\tplaced++\n\t\t\t}\n\t\t}\n\t}\n}\n\n// ---- roads\n\n/**\n * What `roadsPass` takes\n *\n * @beta\n */\nexport interface RoadsPassOptions {\n\t/** The tile the road is painted with, by id */\n\ttile: string\n\t/** How wide, in cells: 2 when left out */\n\twidth?: number\n\t/** Between what: every two starts when left out, or places of the map's own */\n\tbetween?: Vec2[]\n}\n\n/**\n * Roads between the starts (or places given), the way something on foot would go (over the level map, by ramps, around\n * water; the gentlest ground preferred), painted with a tile\n *\n * @beta\n */\nexport function roadsPass(options: RoadsPassOptions): GeneratorPass {\n\treturn {\n\t\tid: 'roads',\n\t\tname: 'The roads',\n\t\trun(ctx) {\n\t\t\tconst { map, registry } = ctx\n\t\t\tif (!registry.tileIds.includes(options.tile)) return\n\t\t\tconst tile = registry.tile(options.tile)\n\t\t\tconst wide = Math.max(1, Math.round(options.width ?? 2))\n\t\t\tconst places = options.between ?? map.players.flatMap((player) => (player.start ? [player.start] : []))\n\t\t\tconst terrain = mapTerrain(map)\n\t\t\tfor (let i = 0; i < places.length; i++)\n\t\t\t\tfor (let j = i + 1; j < places.length; j++) {\n\t\t\t\t\tconst path = findPath(map, terrain, places[i], places[j])\n\t\t\t\t\tfor (const c of path) {\n\t\t\t\t\t\tconst cx = c % map.width\n\t\t\t\t\t\tconst cz = (c - cx) / map.width\n\t\t\t\t\t\tfor (let dz = 0; dz < wide; dz++)\n\t\t\t\t\t\t\tfor (let dx = 0; dx < wide; dx++) {\n\t\t\t\t\t\t\t\tconst x = cx + dx - Math.floor(wide / 2)\n\t\t\t\t\t\t\t\tconst z = cz + dz - Math.floor(wide / 2)\n\t\t\t\t\t\t\t\tif (on(map, x, z) && map.water[z * map.width + x] === WATER_NONE) map.tiles[z * map.width + x] = tile\n\t\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t}\n\t}\n}\n\n/** The cells of the way from one place to another over the level map: A* with the gentlest ground preferred; nothing where there is none */\nfunction findPath(map: GameMap, terrain: ReturnType<typeof mapTerrain>, from: Vec2, to: Vec2): number[] {\n\tconst { width, depth, levels, ramps, water } = map\n\tconst start = Math.floor(from.z) * width + Math.floor(from.x)\n\tconst goal = Math.floor(to.z) * width + Math.floor(to.x)\n\tconst passable = (a: number, b: number) => levels[a] === levels[b] || ramps[a] > 0 || ramps[b] > 0\n\tconst cost = new Float32Array(width * depth).fill(Infinity)\n\tconst came = new Int32Array(width * depth).fill(-1)\n\tconst closed = new Uint8Array(width * depth)\n\t// a heap of what is to be looked at, the nearest estimate first\n\tconst heapCells: number[] = []\n\tconst heapCosts: number[] = []\n\tconst push = (estimate: number, c: number) => {\n\t\theapCells.push(c)\n\t\theapCosts.push(estimate)\n\t\tlet i = heapCells.length - 1\n\t\twhile (i > 0) {\n\t\t\tconst parent = (i - 1) >> 1\n\t\t\tif (heapCosts[parent] <= heapCosts[i]) break\n\t\t\t;[heapCosts[parent], heapCosts[i]] = [heapCosts[i], heapCosts[parent]]\n\t\t\t;[heapCells[parent], heapCells[i]] = [heapCells[i], heapCells[parent]]\n\t\t\ti = parent\n\t\t}\n\t}\n\tconst pop = (): number => {\n\t\tconst top = heapCells[0]\n\t\tconst lastCell = heapCells.pop()!\n\t\tconst lastCost = heapCosts.pop()!\n\t\tif (heapCells.length) {\n\t\t\theapCells[0] = lastCell\n\t\t\theapCosts[0] = lastCost\n\t\t\tlet i = 0\n\t\t\tfor (;;) {\n\t\t\t\tconst l = i * 2 + 1\n\t\t\t\tconst r = l + 1\n\t\t\t\tlet best = i\n\t\t\t\tif (l < heapCells.length && heapCosts[l] < heapCosts[best]) best = l\n\t\t\t\tif (r < heapCells.length && heapCosts[r] < heapCosts[best]) best = r\n\t\t\t\tif (best === i) break\n\t\t\t\t;[heapCosts[best], heapCosts[i]] = [heapCosts[i], heapCosts[best]]\n\t\t\t\t;[heapCells[best], heapCells[i]] = [heapCells[i], heapCells[best]]\n\t\t\t\ti = best\n\t\t\t}\n\t\t}\n\t\treturn top\n\t}\n\tconst h = (c: number) => hypot((c % width) - (goal % width), Math.floor(c / width) - Math.floor(goal / width))\n\tcost[start] = 0\n\tpush(h(start), start)\n\twhile (heapCells.length) {\n\t\tconst c = pop()\n\t\tif (closed[c]) continue\n\t\tclosed[c] = 1\n\t\tif (c === goal) break\n\t\tconst cx = c % width\n\t\tconst cz = (c - cx) / width\n\t\tfor (const [dx, dz] of NEIGHBOURS) {\n\t\t\tconst nx = cx + dx\n\t\t\tconst nz = cz + dz\n\t\t\tif (!on(map, nx, nz)) continue\n\t\t\tconst n = nz * width + nx\n\t\t\tif (closed[n] || water[n] === WATER_DEEP || !passable(c, n)) continue\n\t\t\tconst step = 1 + terrain.slopeAt(nx + 0.5, nz + 0.5) * 4 + (water[n] ? 2 : 0)\n\t\t\tconst next = cost[c] + step\n\t\t\tif (next >= cost[n]) continue\n\t\t\tcost[n] = next\n\t\t\tcame[n] = c\n\t\t\tpush(next + h(n), n)\n\t\t}\n\t}\n\tif (came[goal] < 0 && goal !== start) return []\n\tconst path: number[] = []\n\tfor (let c = goal; c >= 0; c = came[c]) {\n\t\tpath.push(c)\n\t\tif (c === start) break\n\t}\n\treturn path.reverse()\n}\n\n// ---- a preset\n\n/**\n * What the engine's preset takes from a game: what its scenery is\n *\n * @beta\n */\nexport interface PresetGeneratorOptions {\n\t/** The models of trees, by their paths in `models/`: one picked for each. No trees when left out */\n\ttrees?: string[]\n\t/** How big a tree is drawn, and how much that varies: 1, by a fifth, when left out */\n\ttreeScale?: { scale?: number; vary?: number }\n\t/** The models of rocks, the same way. None when left out */\n\trocks?: string[]\n\t/** What a game puts at a start (`startsPass`): its hall and workers */\n\tstart?: StartsPassOptions['from']\n}\n\n/**\n * A generator to take whole: hills and water, the paint, the starts, trees in patches and rocks about, with the\n * parameters `levels`, `water`, `roughness`, `hills`, `trees` and `rocks`; what the trees and rocks are is the game's\n * to say\n *\n * @beta\n */\nexport function presetGenerator(options: PresetGeneratorOptions = {}): MapGenerator {\n\tconst { trees = [], rocks = [], treeScale = {} } = options\n\tconst scale = treeScale.scale ?? 1\n\tconst vary = treeScale.vary ?? 0.2\n\treturn {\n\t\tparams: [\n\t\t\t{ id: 'levels', name: 'Cliff levels', description: 'How many levels the ground rises through', default: 2, min: 1, max: 4, step: 1 },\n\t\t\t{ id: 'water', name: 'Water', description: 'How much of the map is under water', default: 0.15, min: 0, max: 0.5, step: 0.05 },\n\t\t\t{ id: 'roughness', name: 'Roughness', description: 'How much the ground rolls', default: 0.4, min: 0, max: 1, step: 0.05 },\n\t\t\t{ id: 'hills', name: 'Hills', description: 'How many cells a hill is across', default: 24, min: 8, max: 64, step: 4 },\n\t\t\t{ id: 'trees', name: 'Trees', description: 'How much of the map is woods', default: trees.length ? 0.12 : 0, min: 0, max: 0.5, step: 0.02 },\n\t\t\t{ id: 'rocks', name: 'Rocks', description: 'How many rocks lie about', default: rocks.length ? 0.02 : 0, min: 0, max: 0.2, step: 0.01 }\n\t\t],\n\t\tpasses: [\n\t\t\tterrainPass(),\n\t\t\ttilesPass(),\n\t\t\tstartsPass({ from: options.start }),\n\t\t\t...(trees.length\n\t\t\t\t? [\n\t\t\t\t\t\tscatterPass({\n\t\t\t\t\t\t\tkind: 'trees',\n\t\t\t\t\t\t\tspacing: 1.6,\n\t\t\t\t\t\t\twhat: (ctx, at) => {\n\t\t\t\t\t\t\t\tconst size = scale * (1 + (ctx.rng.next() - 0.5) * 2 * vary)\n\t\t\t\t\t\t\t\tctx.addDoodad({\n\t\t\t\t\t\t\t\t\tmodel: trees[ctx.rng.int(0, trees.length - 1)],\n\t\t\t\t\t\t\t\t\tx: at.x,\n\t\t\t\t\t\t\t\t\tz: at.z,\n\t\t\t\t\t\t\t\t\tyaw: ctx.rng.next() * Math.PI * 2,\n\t\t\t\t\t\t\t\t\tscale: size,\n\t\t\t\t\t\t\t\t\tblocks: 'walk',\n\t\t\t\t\t\t\t\t\tradius: 0.5\n\t\t\t\t\t\t\t\t})\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t})\n\t\t\t\t\t]\n\t\t\t\t: []),\n\t\t\t...(rocks.length\n\t\t\t\t? [\n\t\t\t\t\t\tscatterPass({\n\t\t\t\t\t\t\tkind: 'rocks',\n\t\t\t\t\t\t\tspacing: 3,\n\t\t\t\t\t\t\tpatches: 0.3,\n\t\t\t\t\t\t\tavoidKinds: { trees: 1 },\n\t\t\t\t\t\t\twhat: (ctx, at) => {\n\t\t\t\t\t\t\t\tconst size = scale * (0.8 + ctx.rng.next() * 0.6)\n\t\t\t\t\t\t\t\tctx.addDoodad({\n\t\t\t\t\t\t\t\t\tmodel: rocks[ctx.rng.int(0, rocks.length - 1)],\n\t\t\t\t\t\t\t\t\tx: at.x,\n\t\t\t\t\t\t\t\t\tz: at.z,\n\t\t\t\t\t\t\t\t\tyaw: ctx.rng.next() * Math.PI * 2,\n\t\t\t\t\t\t\t\t\tscale: size,\n\t\t\t\t\t\t\t\t\tblocks: 'walk',\n\t\t\t\t\t\t\t\t\tradius: 0.6\n\t\t\t\t\t\t\t\t})\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t})\n\t\t\t\t\t]\n\t\t\t\t: [])\n\t\t]\n\t}\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAsNA,SAAgB,YACf,WACA,SACA,UACyD;CACzD,MAAM,QAAQ,KAAK,IAAI,GAAG,UAAU,SAAS,CAAC;CAC9C,IAAI;CACJ,KAAK,IAAI,UAAU,GAAG,UAAU,OAAO,WAAW;EACjD,MAAM,OAAO,QAAQ,OAAO;EAC5B,MAAM,MAAM,UAAU;GACrB,MAAM,QAAQ,QAAQ,aAAa;GACnC,OAAO,QAAQ;GACf,OAAO,QAAQ;GACf,SAAS,QAAQ;GACjB,MAAM,SAAS,QAAQ;GACvB,SAAS,SAAS;EACnB,CAAC;EACD,MAAM,MAAwB,cAAc,KAAK;GAAE,GAAG;GAAS;EAAK,GAAG,UAAU,SAAS;EAC1F,KAAK,MAAM,QAAQ,UAAU,QAAQ,KAAK,IAAI,GAAG;EACjD,IAAI,YAAY;GAAE;GAAM,SAAS;IAAE,GAAG;IAAS;GAAK;EAAE;EACtD,MAAM,WAAW,SAAS,KAAK,QAAQ;EACvC,OAAO;GAAE;GAAK;GAAU;EAAK;EAC7B,IAAI,CAAC,SAAS,KAAK,UAAU,GAAG,OAAO;CACxC;CACA,OAAO;AACR;;AAGA,IAAM,cAAc,YAAwB,QAAQ,SAAS,QAAQ,SAAS,kBAAkB,QAAQ,SAAS;AAIjH,IAAM,aAA4B;CAAC;CAAQ;CAAK;CAAK;CAAQ;CAAQ;AAAS;;;;;;AAO9E,SAAgB,gBAAgB,UAAuB,OAAe,OAAe,GAAW,GAAmB;CAClH,MAAM,MAAc,CAAC;EAAE;EAAG;CAAE,CAAC;CAC7B,MAAM,OAAO,IAAY,OAAe;EACvC,IAAI,CAAC,IAAI,MAAM,UAAU,KAAK,IAAI,MAAM,IAAI,EAAE,IAAI,QAAQ,KAAK,IAAI,MAAM,IAAI,EAAE,IAAI,IAAI,GAAG,IAAI,KAAK;GAAE,GAAG;GAAI,GAAG;EAAG,CAAC;CACpH;CACA,QAAQ,UAAR;EACC,KAAK;GACJ,IAAI,QAAQ,GAAG,CAAC;GAChB;EACD,KAAK;GACJ,IAAI,GAAG,QAAQ,CAAC;GAChB;EACD,KAAK;GACJ,IAAI,QAAQ,GAAG,CAAC;GAChB,IAAI,GAAG,QAAQ,CAAC;GAChB,IAAI,QAAQ,GAAG,QAAQ,CAAC;GACxB;EACD,KAAK;GACJ,IAAI,QAAQ,GAAG,QAAQ,CAAC;GACxB;EACD,KAAK,WAAW;GACf,MAAM,KAAK,QAAQ;GACnB,MAAM,KAAK,QAAQ;GACnB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;IAC3B,IAAI,KAAK,IAAI;IACb,IAAI,KAAK,IAAI;IACb,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,CAAC,IAAI,MAAM,CAAC,CAAC,IAAI,EAAE;IAC/C,IAAI,KAAK,IAAI,KAAK,EAAE;GACrB;GACA;EACD;CACD;CACA,OAAO;AACR;;AAGA,IAAM,UAAU;;AAGhB,SAAS,WAAW,UAAuB,OAAe,OAAe,GAAW,GAAW,KAAqC;CACnI,IAAI,IAAI;CACR,IAAI,IAAI;CACR,MAAM,QAAQ,IAAY,OAAe,UAAU,KAAK,IAAI,EAAE;CAC9D,QAAQ,UAAR;EACC,KAAK;GACJ,KAAK,QAAQ,GAAG,CAAC;GACjB;EACD,KAAK;GACJ,KAAK,GAAG,QAAQ,CAAC;GACjB;EACD,KAAK;GACJ,KAAK,QAAQ,GAAG,CAAC;GACjB,KAAK,GAAG,QAAQ,CAAC;GACjB,KAAK,QAAQ,GAAG,QAAQ,CAAC;GACzB;EACD,KAAK;GACJ,KAAK,QAAQ,GAAG,QAAQ,CAAC;GACzB;EACD,KAAK,WAAW;GACf,MAAM,KAAK,QAAQ;GACnB,MAAM,KAAK,QAAQ;GACnB,IAAI,KAAK,IAAI;GACb,IAAI,KAAK,IAAI;GACb,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;IAC1B,CAAC,IAAI,MAAM,CAAC,CAAC,IAAI,EAAE;IACpB,KAAK,KAAK,IAAI,KAAK,EAAE;GACtB;GACA;EACD;CACD;AACD;;AAGA,SAAS,UAAU,KAA+B,IAAY,IAAkB;CAC/E,IAAI,KAAK,IAAI,IAAI,QAAS,KAAK,IAAI,KAAK,IAAI,CAAC,IAAI,QAAQ,KAAK,IAAI,GAAI;EACrE,IAAI,IAAI;EACR,IAAI,IAAI;CACT;AACD;AAUA,SAAS,cAAc,KAAc,SAA2B,UAAoB,WAAgE;CACnJ,MAAM,EAAE,OAAO,UAAU;CACzB,MAAM,WAAW,QAAQ,YAAY;CACrC,IAAI,CAAC,WAAW,SAAS,QAAQ,GAAG,MAAM,IAAI,MAAM,sCAAsC,SAAS,KAAK,WAAW,KAAK,IAAI,GAAG;CAC/H,IAAI,aAAa,cAAc,UAAU,SAAS,QAAQ,IAAI,MAAM,IAAI,MAAM,8DAA8D;CAC5I,MAAM,MAAM,IAAI,IAAI,QAAQ,IAAI;CAChC,MAAM,WAAW,OAAO,YAAY,UAAU,OAAO,KAAK,UAAU,CAAC,MAAM,IAAI,MAAM,OAAO,CAAC,CAAC;CAC9F,MAAM,QAAQ,QAAQ,UAAU,CAAC;CACjC,MAAM,yBAAS,IAAI,IAAoB;CACvC,MAAM,SAA0B,CAAC;CACjC,IAAI,SAAS;CAEb,MAAM,UAAU,IAAI,WAAW,QAAQ,QAAQ,OAAO,CAAC,CAAC,KAAK,EAAE;CAC/D,MAAM,QAAQ,IAAI,WAAW,QAAQ,KAAK;CAC1C,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACtC,MAAM,KAAK,IAAI;EACf,MAAM,MAAM,IAAI,MAAM;EACtB,IAAI,QAAQ;EACZ,IAAI,IAAI;EACR,KAAK,MAAM,SAAS,gBAAgB,UAAU,OAAO,OAAO,KAAK,IAAK,KAAK,EAAG,GAAG;GAChF,MAAM,KAAK,KAAK,MAAM,MAAM,CAAC;GAC7B,MAAM,KAAK,KAAK,MAAM,MAAM,CAAC;GAC7B,IAAI,KAAK,KAAK,KAAK,KAAK,MAAM,SAAS,MAAM,OAAO;GACpD,MAAM,IAAI,KAAK,QAAQ;GACvB,QAAQ,IAAI,UAAU,OAAO;GAC7B,QAAQ,KAAK,IAAI,OAAO,CAAC;EAC1B;EACA,MAAM,KAAK;CACZ;CAEA,MAAM,OAAO;CACb,MAAM,OAAO,KAAK,KAAK,QAAQ,IAAI;CACnC,MAAM,OAAO,KAAK,KAAK,QAAQ,IAAI;CACnC,MAAM,OAAmB,MAAM,KAAK,EAAE,QAAQ,OAAO,KAAK,SAAS,CAAC,CAAC;CACrE,IAAI,SAAS;CACb,MAAM,QAAQ;EAAE,GAAG;EAAG,GAAG;CAAE;CAC3B,MAAM,wBAAQ,IAAI,IAAqB;CACvC,OAAO;EACN;EACA;EACA;EACA;EACA,QAA6C,IAAY,aAAoB,MAAM,OAAO,SAAS,OAAO;EAC1G,YAAY,GAAG,MAAM,gBAAgB,UAAU,OAAO,OAAO,GAAG,CAAC;EACjE,YAAY,IAAI,OAAO,MAAM,KAAK,QAAQ,QAAQ,KAAK,QAAQ;EAC/D,OAAU,GAAW,GAAW,SAAqB;GACpD,MAAM,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,MAAM,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;GACzD,MAAM,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,MAAM,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;GACzD,MAAM,MAAM,MAAM,KAAK,QAAQ;GAC/B,IAAI,MAAM,IAAI,GAAG,GAAG,OAAO,MAAM,IAAI,GAAG;GACxC,MAAM,QAAQ,KAAK;GACnB,MAAM,IAAI,KAAK,KAAK;GACpB,OAAO;EACR;EACA,YAAY,MAAM;GACjB,MAAM,MAAgB,CAAC;GACvB,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,KAAK;IACjC,MAAM,IAAI,QAAQ,IAAI,UAAU;IAChC,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC;GACvB;GACA,OAAO;EACR;EACA,UAAU,OAAO,GAAG,UAAU;GAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,KAAK;IACjC,MAAM,IAAI,QAAQ,IAAI,UAAU;IAChC,IAAI,KAAK,GAAG,MAAM,KAAK;GACxB;EACD;EACA,MAAM,MAAM,QAAQ;GAAC;GAAI;GAAI;EAAC,GAAG;GAChC,IAAI,QAAQ,OAAO,IAAI,IAAI;GAC3B,IAAI,CAAC,OAAO;IAEX,IAAI,OAAO;IACX,KAAK,MAAM,UAAU,MAAM,OAAQ,OAAO,KAAK,OAAO,WAAW,CAAC,MAAO;IACzE,MAAM,OAAO,KAAK,IAAI,OAAO,KAAK;IAClC,MAAM,QAAQ,aACb,QAAQ,OAAO,MACf,MAAM,KAAK,SAAS,KAAK,IAAI,GAAG,KAAK,MAAM,OAAO,IAAI,CAAC,CAAC,CACzD;IAEA,QACC,aAAa,UACT,GAAG,MAAM,MAAM,IAAI,MAAM,IAAI,IAAI,KACjC,GAAG,MAAM;KACV,WAAW,UAAU,OAAO,OAAO,GAAG,GAAG,KAAK;KAC9C,OAAO,MAAM,MAAM,IAAI,MAAM,MAAM,IAAI,IAAI;IAC5C;IACH,OAAO,IAAI,MAAM,KAAK;GACvB;GACA,OAAO;EACR;EACA;EACA,OAAO,MAAM,GAAG,GAAG,WAAW;GAC7B,OAAO,KAAK;IAAE;IAAM;IAAG;IAAG;GAAO,CAAC;GAClC,SAAS,KAAK,IAAI,QAAQ,MAAM;GAChC,MAAM,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,GAAG,OAAO,CAAC;GAC/D,MAAM,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,GAAG,OAAO,CAAC;GAC/D,KAAK,KAAK,OAAO,GAAG,CAAC,KAAK,OAAO,SAAS,CAAC;EAC5C;EACA,OAAO,GAAG,GAAG,QAAQ,UAAU;GAC9B,MAAM,QAAQ,KAAK,MAAM,SAAS,UAAU,IAAI;GAChD,MAAM,KAAK,KAAK,MAAM,IAAI,IAAI;GAC9B,MAAM,KAAK,KAAK,MAAM,IAAI,IAAI;GAC9B,KAAK,IAAI,KAAK,CAAC,OAAO,MAAM,OAAO,MAClC,KAAK,IAAI,KAAK,CAAC,OAAO,MAAM,OAAO,MAAM;IACxC,MAAM,MAAM,KAAK;IACjB,MAAM,MAAM,KAAK;IACjB,IAAI,MAAM,KAAK,MAAM,KAAK,OAAO,QAAQ,OAAO,MAAM;IACtD,KAAK,MAAM,KAAK,KAAK,MAAM,OAAO,MAAM;KACvC,MAAM,OAAO,OAAO;KACpB,IAAI,SAAS,CAAC,MAAM,SAAS,KAAK,IAAI,GAAG;KACzC,IAAI,MAAM,KAAK,IAAI,GAAG,KAAK,IAAI,CAAC,IAAI,SAAS,KAAK,QAAQ,OAAO;IAClE;GACD;GACD,OAAO;EACR;EACA,UAAU,GAAG,MAAM;GAClB,MAAM,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,MAAM,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;GACzD,MAAM,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,MAAM,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;GACzD,OAAO,IAAI,OAAO,KAAK,QAAQ;EAChC;EACA,WAAW,GAAG,MAAM;GACnB,IAAI,IAAI,KAAK,IAAI,KAAK,KAAK,SAAS,KAAK,OAAO,OAAO;GACvD,OAAO,IAAI,MAAM,KAAK,MAAM,CAAC,IAAI,QAAQ,KAAK,MAAM,CAAC,OAAA;EACtD;EACA,UAAU,QAAQ;GACjB,MAAM,EAAE,QAAQ,GAAG,MAAM,GAAG,GAAG,SAAS;GACxC,MAAM,OAAkB;IAAE,IAAI;IAAU;IAAK,OAAO,OAAO,UAAU,WAAW;KAAC;KAAO;KAAO;IAAK,IAAI;IAAO,GAAG;GAAK;GACvH,IAAI,QAAQ,KAAK,IAAI;GACrB,OAAO;EACR;EACA,UAAU,MAAM,OAAO,GAAG,GAAG,OAAO,CAAC,GAAG;GACvC,MAAM,OAAkB;IAAE,IAAI;IAAU;IAAM;IAAO;IAAG;IAAG,QAAQ;IAAG,OAAO;IAAG,GAAG;GAAK;GACxF,IAAI,QAAQ,KAAK,IAAI;GACrB,OAAO;EACR;EACA,QAAQ,GAAG,GAAG,OAAO,OAAO,CAAC,GAAG;GAC/B,MAAM,OAAgB;IAAE,IAAI;IAAU;IAAG;IAAG;IAAO,GAAG;GAAK;GAC3D,IAAI,MAAM,KAAK,IAAI;GACnB,OAAO;EACR;EACA,UAAU,MAAM,OAAO,OAAO,CAAC,GAAG;GACjC,MAAM,OAAkB;IAAE,IAAI;IAAU;IAAM;IAAO,GAAG;GAAK;GAC7D,IAAI,QAAQ,KAAK,IAAI;GACrB,OAAO;EACR;CACD;AACD;;;;;;;;AAwDA,SAAgB,WAAW,UAA6B,CAAC,GAA6C;CACrG,MAAM,SAAS,KAAK,IAAI,KAAK,IAAI,QAAQ,UAAU,KAAM,CAAC,GAAG,EAAG;CAChE,MAAM,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,aAAa,KAAM,CAAC,GAAG,CAAC;CACpE,MAAM,SAAS,KAAK,IAAI,KAAK,IAAI,QAAQ,UAAU,IAAK,CAAC,GAAG,CAAC;CAC7D,QAAQ,GAAG,GAAG,OAAO,QAAQ;EAE5B,MAAM,IAAI,OAAO,IAAI,IAAI,QAAQ,MAAO,IAAI,IAAI,IAAI,QAAQ,MAAO,CAAC,IAAI,KAAK;EAE7E,MAAM,IAAI,SAAS,IAAI,IAAI,SAAS;EAEpC,OAAO,KADM,IAAI,KAAK,IAAI,IAAI,IAAI,IAAI,KAAK,SAAS,MACjC,QAAQ,MAAO;CACnC;AACD;;AAGA,IAAM,MAAM,KAAc,IAAY,OAAe,MAAM,KAAK,MAAM,KAAK,KAAK,IAAI,SAAS,KAAK,IAAI;;AAGtG,IAAM,aAAqD;CAC1D,CAAC,IAAI,CAAC;CACN,CAAC,GAAG,CAAC;CACL,CAAC,GAAG,EAAE;CACN,CAAC,GAAG,CAAC;AACN;;AAGA,SAAS,UAAU,SAAoD,IAAY,IAAoB;CACtG,MAAM,EAAE,SAAS,WAAW;CAC5B,MAAM,IAAI,KAAK,SAAS;CACxB,MAAM,MAAM,QAAQ,IAAI,KAAK,QAAQ,IAAI,SAAS,KAAK,QAAQ,KAAK,QAAQ,IAAI,WAAW;CAC3F,MAAM,MAAM,QAAQ,IAAI,UAAU,QAAQ,IAAI,SAAS,KAAK,QAAQ,KAAK,QAAQ,IAAI,MAAM;CAC3F,OAAO,KAAK,MAAM,IAAI,EAAE,CAAC;AAC1B;;AAGA,SAAS,UAAU,KAA2C;CAC7D,MAAM,MAAM;CACZ,IAAI,IAAI,aAAa,IAAI,SAAS,OAAO;CACzC,MAAM,EAAE,UAAU,IAAI;CACtB,MAAM,aAAa,MAAc;EAChC,MAAM,KAAK,IAAI;EACf,MAAM,MAAM,IAAI,MAAM;EACtB,OAAO,IAAI,UAAU,KAAK,IAAK,KAAK,EAAG,CAAC,CAAC,SAAS,UAAU;GAC3D,MAAM,KAAK,KAAK,MAAM,MAAM,CAAC;GAC7B,MAAM,KAAK,KAAK,MAAM,MAAM,CAAC;GAC7B,OAAO,GAAG,IAAI,KAAK,IAAI,EAAE,IAAI,CAAC,KAAK,QAAQ,EAAE,IAAI,CAAC;EACnD,CAAC;CACF;CACA,OAAO;EAAE;EAAW,UAAU,OAAO,GAAG,UAAU,UAAU,CAAC,CAAC,CAAC,SAAS,MAAO,MAAM,KAAK,KAAM;CAAE;AACnG;;;;;;;AAQA,SAAgB,YAAY,UAA8B,CAAC,GAAkB;CAC5E,OAAO;EACN,IAAI;EACJ,MAAM;EACN,IAAI,KAAK;GACR,MAAM,EAAE,QAAQ;GAChB,MAAM,EAAE,OAAO,UAAU;GACzB,MAAM,SAAS,KAAK,IAAI,KAAK,IAAI,KAAK,MAAM,QAAQ,UAAU,IAAI,MAAM,UAAU,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;GAC5F,MAAM,aAAa,KAAK,IAAI,KAAK,IAAI,QAAQ,SAAS,IAAI,MAAM,SAAS,GAAI,GAAG,CAAC,GAAG,EAAG;GACvF,MAAM,YAAY,KAAK,IAAI,KAAK,IAAI,QAAQ,aAAa,IAAI,MAAM,aAAa,EAAG,GAAG,CAAC,GAAG,CAAC;GAC3F,MAAM,QAAQ,KAAK,IAAI,GAAG,QAAQ,SAAS,IAAI,MAAM,SAAS,EAAE,CAAC;GACjE,MAAM,UAAU,IAAI,MAAM,WAAW,CAAC,QAAQ,GAAG,KAAK,CAAC;GACvD,MAAM,OAAO,IAAI,MAAM,QAAQ;IAAC,QAAQ;IAAG,QAAQ;IAAG,QAAQ;GAAC,CAAC;GAEhE,MAAM,SAAS,IAAI,aAAa,QAAQ,KAAK;GAC7C,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;IACvC,MAAM,IAAK,IAAI,QAAS;IACxB,MAAM,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI;IAClC,OAAO,KAAK,QAAQ,QAAQ,QAAQ,MAAM,GAAG,GAAG,QAAQ,GAAG,CAAC,GAAG,GAAG,IAAI,QAAQ,GAAG,CAAC;GACnF;GAEA,MAAM,SAAS,KAAK,IAAI,GAAG,KAAK,MAAM,OAAO,SAAS,KAAK,CAAC;GAC5D,MAAM,SAAS,aAAa,KAAK,EAAE,QAAQ,KAAK,MAAM,OAAO,SAAS,MAAM,EAAE,IAAI,GAAG,MAAM,OAAO,IAAI,OAAO,CAAC,CAAC,KAAK;GACpH,MAAM,YAAY,MAAc,OAAO,KAAK,IAAI,KAAK,IAAI,KAAK,MAAM,KAAK,OAAO,SAAS,EAAE,GAAG,CAAC,GAAG,OAAO,SAAS,CAAC;GACnH,MAAM,UAAU,SAAS,UAAU;GACnC,MAAM,QAAQ,MAAM,KAAK,EAAE,QAAQ,SAAS,EAAE,IAAI,GAAG,MAAM,SAAS,cAAe,IAAI,eAAe,IAAI,KAAM,MAAM,CAAC;GACvH,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;IACvC,IAAI,QAAQ;IACZ,KAAK,MAAM,QAAQ,OAAO,IAAI,OAAO,MAAM,MAAM;IACjD,IAAI,OAAO,KAAK;IAChB,IAAI,MAAM,KAAK,OAAO,KAAK,UAAA,IAAA;GAC5B;GAEA,MAAM,EAAE,YAAY,UAAU,GAAG;GACjC,MAAM,yBAAS,IAAI,WAAW,CAAC;GAC/B,KAAK,IAAI,QAAQ,GAAG,QAAQ,GAAG,SAAS;IACvC,MAAM,SAAS,IAAI,OAAO,MAAM;IAChC,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;KACvC,MAAM,KAAK,IAAI;KACf,MAAM,MAAM,IAAI,MAAM;KACtB,IAAI,CAAC,IAAI,UAAU,IAAI,EAAE,GAAG;KAC5B,OAAO,KAAK,CAAC;KACb,KAAK,IAAI,KAAK,IAAI,MAAM,GAAG,MAC1B,KAAK,IAAI,KAAK,IAAI,MAAM,GAAG,MAAM,IAAI,GAAG,KAAK,KAAK,IAAI,KAAK,EAAE,GAAG,OAAO,QAAQ,KAAK,MAAM,QAAQ,KAAK,IAAI;KAC5G,IAAI,OAAO,OAAO;KAClB,IAAI,OAAO,OAAO;KAClB,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS,IAAI,OAAO,SAAS,MAAM,CAAC,MAAM,QAAQ,CAAC,OAAO,OAAO,MAAM;KAClH,IAAI,SAAS,OAAO,IAAI,QAAQ,IAAI,QAAQ,GAAG,IAAI;IACpD;GACD;GAEA,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,IAAI,IAAI,OAAO,KAAK,GAAG,IAAI,MAAM,KAAA;GACzE,MAAM,OAAO,IAAI,MAAM,MAAM;GAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;IACrC,IAAI,KAAK,OAAA,GAAmB;IAC5B,MAAM,KAAK,IAAI;IACf,MAAM,MAAM,IAAI,MAAM;IACtB,IAAI,MAAM;IACV,KAAK,MAAM,CAAC,IAAI,OAAO,YAAY,IAAI,GAAG,KAAK,KAAK,IAAI,KAAK,EAAE,KAAK,MAAM,KAAK,MAAM,QAAQ,KAAK,QAAA,GAAoB,MAAM;IAC5H,IAAI,KAAK,IAAI,MAAM,KAAA;GACpB;GAEA,MAAM,KAAK,QAAQ;GACnB,KAAK,IAAI,KAAK,GAAG,MAAM,OAAO,MAC7B,KAAK,IAAI,KAAK,GAAG,MAAM,OAAO,MAAM;IACnC,MAAM,IAAI,KAAK,KAAK;IACpB,IAAI,OAAO,KAAK,KAAK,KAAK,IAAI,EAAE,IAAI,MAAO,YAAY;GACxD;GACD,IAAI,QAAQ,UAAU,OAAO,SAAS,KAAK,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,aAAa,CAAC,CAAC,CAAC;EAC3F;CACD;AACD;;;;;;AAOA,SAAS,SAAS,KAAuB,WAAyB;CACjE,MAAM,EAAE,QAAQ;CAChB,MAAM,EAAE,OAAO,OAAO,QAAQ,OAAO,UAAU;CAC/C,MAAM,EAAE,YAAY,UAAU,GAAG;CAEjC,MAAM,OAAO,IAAI,WAAW,QAAQ,KAAK,CAAC,CAAC,KAAK,EAAE;CAClD,MAAM,QAAmD,CAAC;CAC1D,MAAM,QAAQ,IAAI,WAAW,QAAQ,KAAK;CAC1C,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SAAS;EACjD,IAAI,KAAK,UAAU,KAAK,MAAM,WAAA,GAAuB;EACrD,MAAM,KAAK,MAAM;EACjB,MAAM,MAAM;GAAE,OAAO;GAAG,GAAG;GAAG,GAAG;EAAE;EACnC,MAAM,KAAK,GAAG;EACd,IAAI,OAAO;EACX,IAAI,OAAO;EACX,MAAM,UAAU;EAChB,KAAK,SAAS;EACd,OAAO,OAAO,MAAM;GACnB,MAAM,IAAI,MAAM;GAChB,MAAM,KAAK,IAAI;GACf,MAAM,MAAM,IAAI,MAAM;GACtB,IAAI;GACJ,IAAI,KAAK,KAAK;GACd,IAAI,KAAK,KAAK;GACd,KAAK,MAAM,CAAC,IAAI,OAAO,YAAY;IAClC,MAAM,KAAK,KAAK;IAChB,MAAM,KAAK,KAAK;IAChB,IAAI,CAAC,GAAG,KAAK,IAAI,EAAE,GAAG;IACtB,MAAM,IAAI,KAAK,QAAQ;IACvB,IAAI,KAAK,MAAM,KAAK,MAAM,OAAA,KAAqB,OAAO,OAAO,OAAO,IAAI;IACxE,KAAK,KAAK;IACV,MAAM,UAAU;GACjB;EACD;CACD;CACA,KAAK,MAAM,QAAQ,OAAO;EACzB,KAAK,KAAK,KAAK;EACf,KAAK,KAAK,KAAK;CAChB;CACA,IAAI,MAAM,SAAS,GAAG;CAGtB,MAAM,OAAO,KAAK,MAAM,YAAY,CAAC;CACrC,MAAM,aAAwE,CAAC;CAC/E,MAAM,YAAY,IAAY,IAAY,IAAY,OAAqC;EAE1F,MAAM,MAAM,KAAK,QAAQ;EACzB,MAAM,QAAQ,KAAK,MAAM,QAAQ,KAAK;EACtC,IAAI,KAAK,IAAI,OAAO,OAAO,OAAO,KAAK,MAAM,GAAG,OAAO,KAAA;EACvD,MAAM,QAAkB,CAAC;EACzB,KAAK,IAAI,QAAQ,CAAC,MAAM,QAAQ,YAAY,MAAM,SACjD,KAAK,IAAI,OAAO,IAAI,QAAQ,GAAG,QAAQ;GACtC,MAAM,IAAI,KAAK,KAAK,QAAQ,KAAK;GACjC,MAAM,IAAI,KAAK,KAAK,QAAQ,KAAK;GACjC,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,GAAG,OAAO,KAAA;GAC3B,MAAM,IAAI,IAAI,QAAQ;GACtB,IAAI,MAAM,OAAA,GAAmB,OAAO,KAAA;GACpC,IAAI,OAAO,QAAQ,QAAQ,IAAI,OAAO,OAAO,OAAO,QAAQ,OAAO,KAAA;GACnE,IAAI,QAAQ,KAAK,QAAQ,GAAG,MAAM,KAAK,CAAC;EACzC;EAED,OAAO;CACR;CACA,KAAK,IAAI,KAAK,GAAG,KAAK,OAAO,MAC5B,KAAK,IAAI,KAAK,GAAG,KAAK,OAAO,MAAM;EAClC,IAAI,CAAC,IAAI,UAAU,IAAI,EAAE,GAAG;EAC5B,KAAK,MAAM,CAAC,IAAI,OAAO,CACtB,CAAC,GAAG,CAAC,GACL,CAAC,GAAG,CAAC,CACN,GAAG;GACF,IAAI,CAAC,GAAG,KAAK,KAAK,IAAI,KAAK,EAAE,GAAG;GAChC,MAAM,QAAQ,SAAS,IAAI,IAAI,IAAI,EAAE;GACrC,IAAI,CAAC,OAAO;GACZ,MAAM,IAAI,KAAK,KAAK,QAAQ;GAC5B,MAAM,IAAI,MAAM,KAAK,MAAM,QAAQ,KAAK;GACxC,IAAI,IAAI,KAAK,IAAI,KAAK,MAAM,GAAG;GAC/B,MAAM,MAAM,MAAM,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC,KAAK;GACvC,MAAM,MAAM,MAAM,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC,KAAK;GACvC,WAAW,KAAK;IAAE;IAAG;IAAG;IAAO,MAAM,MAAM,KAAK,KAAM,IAAI,KAAK,KAAM,EAAE;GAAE,CAAC;EAC3E;CACD;CACD,WAAW,MAAM,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI;CAEzC,MAAM,OAAO,MAAM,KAAK,GAAG,MAAM,CAAC;CAClC,MAAM,QAAQ,MAAuB,KAAK,OAAO,IAAI,IAAK,KAAK,KAAK,KAAK,KAAK,EAAE;CAChF,KAAK,MAAM,aAAa,YAAY;EACnC,MAAM,IAAI,KAAK,UAAU,CAAC;EAC1B,MAAM,IAAI,KAAK,UAAU,CAAC;EAC1B,IAAI,MAAM,GAAG;EACb,KAAK,KAAK;EACV,KAAK,MAAM,KAAK,UAAU,OAAO,QAAQ,OAAO,GAAG,CAAC;CACrD;AACD;;;;;;AA2BA,SAAgB,UAAU,UAA4B,CAAC,GAAkB;CACxE,OAAO;EACN,IAAI;EACJ,MAAM;EACN,IAAI,KAAK;GACR,MAAM,EAAE,KAAK,aAAa;GAC1B,MAAM,EAAE,OAAO,UAAU;GACzB,MAAM,QAAQ,SAAS;GACvB,IAAI,CAAC,MAAM,QAAQ;GACnB,MAAM,UAAU,WAAW,GAAG;GAC9B,MAAM,WAAW,IAAI,MAAM,YAAY,CAAC,IAAI,EAAE,CAAC;GAC/C,IAAI,MAAM;GACV,KAAK,MAAM,SAAS,IAAI,QAAQ,MAAM,KAAK,IAAI,KAAK,KAAK;GACzD,MAAM,KACL,QAAQ,QACN,MAAM,QAAQ;IACf,MAAM,OAAO,OAAgB,IAAI,SAAS,EAAE,IAAI,KAAK,KAAA;IACrD,IAAI,KAAK,OAAO,OAAO,IAAI,MAAM;IACjC,IAAI,KAAK,QAAQ,IAAK,OAAO,IAAI,MAAM;IACvC,IAAI,KAAK,UAAU,OAAO,OAAO,GAAG,OAAO,IAAI,MAAM,KAAK,IAAI,MAAM;IACpE,IAAI,KAAK,WAAW,KAAM,OAAO,IAAI,MAAM;GAE5C;GACD,KAAK,IAAI,KAAK,GAAG,KAAK,OAAO,MAC5B,KAAK,IAAI,KAAK,GAAG,KAAK,OAAO,MAAM;IAClC,MAAM,IAAI,KAAK,QAAQ;IACvB,IAAI,IAAI,MAAM,OAAA,GAAmB;IACjC,IAAI,QAAQ,IAAI,MAAM,OAAA;IACtB,IAAI,CAAC,OACC;UAAA,MAAM,CAAC,IAAI,OAAO,YAAY,IAAI,GAAG,KAAK,KAAK,IAAI,KAAK,EAAE,KAAK,IAAI,OAAO,KAAK,MAAM,QAAQ,KAAK,QAAA,GAAoB,QAAQ;IAAA;IACpI,MAAM,KAAK,GACV;KAAE,GAAG;KAAI,GAAG;KAAI,OAAO,IAAI,OAAO;KAAI,OAAO,UAAU,SAAS,IAAI,EAAE;KAAG,UAAU,SAAS,KAAK,IAAK,KAAK,EAAG;KAAG;IAAM,GACvH,KACD;IACA,IAAI,MAAM,KAAK,KAAK,SAAS,KAAK,EAAE,IAAI;GACzC;EACF;CACD;AACD;;;;;;;AAwBA,SAAgB,WAAW,UAA6B,CAAC,GAAkB;CAC1E,OAAO;EACN,IAAI;EACJ,MAAM;EACN,IAAI,KAAK;GACR,MAAM,EAAE,KAAK,QAAQ;GACrB,MAAM,EAAE,OAAO,UAAU;GACzB,MAAM,UAAU,IAAI,QAAQ,QAAQ,WAAW,OAAO,OAAA,KAAsB,OAAO,OAAA,EAAiB;GACpG,IAAI,CAAC,QAAQ,QAAQ;GACrB,MAAM,WAAW,KAAK,IAAI,GAAG,QAAQ,YAAY,CAAC;GAClD,MAAM,SAAS,KAAK,IAAI,KAAK,IAAI,QAAQ,UAAU,KAAM,EAAG,GAAG,GAAI;GACnE,MAAM,WAAW,IAAI,QAAQ,YAAY;GAEzC,MAAM,UAAU,IAAI,UAAU,QAAQ,IAAK,QAAQ,EAAG,CAAC,CAAC;GACxD,MAAM,QAAQ,KAAK,KAAK,QAAQ,SAAS,OAAO;GAChD,MAAM,SAAiB,CAAC;GACxB,MAAM,SAAS,aAAa,SAAS,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,aAAa,MAAM,KAAK,KAAK,aAAa,MAAM,KAAK,KAAK,IAAI,KAAK,KAAK;GAExI,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,UAAU,OAAO,SAAS,QAAQ,QAAQ,KAAK;IAClF,MAAM,QAAQ,SAAU,IAAI,KAAK,KAAK,IAAK,KAAK,IAAI,QAAQ,SAAS,CAAC;IACtE,MAAM,IAAI,QAAQ,IAAI,IAAI,KAAK,IAAI,QAAQ;IAC3C,MAAM,IAAI,QAAQ,IAAI,IAAI,KAAK,IAAI,QAAQ;IAC3C,KAAK,MAAM,SAAS,IAAI,UAAU,GAAG,CAAC,GAAG,IAAI,OAAO,SAAS,QAAQ,QAAQ,OAAO,KAAK,KAAK;GAC/F;GACA,QAAQ,SAAS,QAAQ,MAAM;IAC9B,MAAM,KAAK,UAAU,KAAK,OAAO,IAAI,QAAQ;IAC7C,MAAM,KAAK,IAAI,QAAQ;IACvB,OAAO,QAAQ;KAAE,GAAG,GAAG;KAAG,GAAG,GAAG;IAAE;IAClC,IAAI,KAAK,SAAS,GAAG,GAAG,GAAG,GAAG,QAAQ;IACtC,QAAQ,OAAO,QAAQ,IAAI,GAAG;GAC/B,CAAC;EACF;CACD;AACD;;;;;;;AAQA,IAAa,oBAAoB,KAAuB,IAAU,UAAwB,UAAU,KAAK,IAAI,KAAK;;;;;;;;AASlH,IAAa,eAAe,KAAuB,IAAU,QAAgB,QAAQ,OAAO,UAC3F,MAAM,KAAK,IAAI,QAAQ,OAAO,SAAS,IAAI,QAAQ,GAAG,GAAG,GAAG,CAAC,CAAC;;AAG/D,SAAS,UAAU,KAAuB,IAAU,OAAqB;CACxE,MAAM,EAAE,QAAQ;CAChB,MAAM,EAAE,OAAO,UAAU;CACzB,MAAM,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,MAAM,GAAG,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;CAC5D,MAAM,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,MAAM,GAAG,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;CAC5D,KAAK,IAAI,IAAI,GAAG,KAAK,QAAQ,GAAG,KAC/B,KAAK,IAAI,KAAK,CAAC,GAAG,MAAM,GAAG,MAC1B,KAAK,IAAI,KAAK,CAAC,GAAG,MAAM,GAAG,MAAM;EAChC,IAAI,KAAK,IAAI,KAAK,IAAI,EAAE,GAAG,KAAK,IAAI,EAAE,CAAC,MAAM,GAAG;EAChD,MAAM,IAAI,KAAK;EACf,MAAM,IAAI,KAAK;EACf,IAAI,IAAI,KAAK,IAAI,KAAK,KAAK,QAAQ,KAAK,KAAK,QAAQ,GAAG;EACxD,IAAI,IAAI,MAAM,IAAI,QAAQ,OAAA,GAAmB,OAAO;GAAE,GAAG,IAAI;GAAK,GAAG,IAAI;EAAI;CAC9E;CACF,OAAO;EAAE,GAAG,KAAK;EAAK,GAAG,KAAK;CAAI;AACnC;;AAGA,SAAS,MAAM,KAAuB,IAAU,QAAgB,QAAQ,OAAO,QAAQ,IAAI,QAAQ,GAAG,GAAG,GAAG,CAAC,GAAS;CACrH,MAAM,EAAE,QAAQ;CAChB,MAAM,EAAE,OAAO,UAAU;CACzB,MAAM,KAAK,QAAQ;CACnB,IAAI,SAAS;CACb,IAAI,QAAQ;CACZ,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,MAAM,GAAG,IAAI,MAAM,GAAG,CAAC,GAAG,MAAM,KAAK,IAAI,KAAK,KAAK,GAAG,IAAI,MAAM,GAAG,KAAK,GAAG,MACtG,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,MAAM,GAAG,IAAI,MAAM,GAAG,CAAC,GAAG,MAAM,KAAK,IAAI,KAAK,KAAK,GAAG,IAAI,MAAM,GAAG,KAAK,GAAG,MAAM;EAC5G,UAAU,IAAI,OAAO,KAAK,KAAK;EAC/B;CACD;CACD,UAAU,KAAK,IAAI,OAAO,CAAC;CAC3B,KAAK,MAAM,SAAS,QAAQ,CAAC,EAAE,IAAI,IAAI,UAAU,GAAG,GAAG,GAAG,CAAC,GAAG;EAC7D,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,MAAM,MAAM,IAAI,MAAM,GAAG,CAAC,GAAG,KAAK,KAAK,IAAI,KAAK,KAAK,MAAM,IAAI,MAAM,GAAG,KAAK,GAAG,MAC3G,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,MAAM,MAAM,IAAI,MAAM,GAAG,CAAC,GAAG,KAAK,KAAK,IAAI,KAAK,KAAK,MAAM,IAAI,MAAM,GAAG,KAAK,GAAG,MAAM;GACjH,IAAI,MAAM,KAAK,KAAM,MAAM,GAAG,KAAK,KAAM,MAAM,CAAC,IAAI,QAAQ;GAC5D,MAAM,IAAI,KAAK,QAAQ;GACvB,IAAI,OAAO,KAAK;GAChB,IAAI,MAAM,KAAA;GACV,IAAI,MAAM,KAAK;EAChB;EACD,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,MAAM,MAAM,IAAI,MAAM,GAAG,CAAC,GAAG,MAAM,KAAK,IAAI,KAAK,KAAK,MAAM,IAAI,MAAM,GAAG,KAAK,GAAG,MAC5G,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,MAAM,MAAM,IAAI,MAAM,GAAG,CAAC,GAAG,MAAM,KAAK,IAAI,KAAK,KAAK,MAAM,IAAI,MAAM,GAAG,KAAK,GAAG,MAAM;GAClH,MAAM,IAAI,MAAM,KAAK,MAAM,GAAG,KAAK,MAAM,CAAC;GAC1C,IAAI,IAAI,QAAQ;GAEhB,MAAM,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,SAAS,OAAQ,SAAS,KAAM,CAAC,GAAG,CAAC;GACtE,MAAM,IAAI,KAAK,KAAK;GACpB,IAAI,OAAO,KAAK,UAAU,IAAI,OAAO,KAAK,UAAU,IAAI,KAAK,IAAI,IAAI;EACtE;CACF;AACD;;;;;;;;AAqCA,SAAgB,YAAY,SAA4C;CACvE,OAAO;EACN,IAAI,WAAW,QAAQ;EACvB,MAAM,cAAc,QAAQ;EAC5B,IAAI,KAAK;GACR,MAAM,EAAE,KAAK,QAAQ;GACrB,MAAM,EAAE,OAAO,UAAU;GACzB,MAAM,UAAU,KAAK,IAAI,KAAK,IAAI,QAAQ,WAAW,IAAI,MAAM,QAAQ,MAAM,GAAI,GAAG,CAAC,GAAG,CAAC;GACzF,IAAI,WAAW,GAAG;GAClB,MAAM,UAAU,KAAK,IAAI,IAAK,QAAQ,WAAW,GAAG;GACpD,MAAM,SAAS,QAAQ,UAAU,UAAU;GAC3C,MAAM,QAAQ,QAAQ,SAAS;GAC/B,MAAM,UAAU,KAAK,IAAI,KAAK,IAAI,QAAQ,WAAW,IAAK,CAAC,GAAG,CAAC;GAC/D,MAAM,QAAQ,IAAI,MAAM,WAAW,QAAQ,QAAQ;IAAC;IAAI;IAAI;GAAC,CAAC;GAE9D,IAAI;GACJ,MAAM,gBAAiB,SAAS,WAAW,GAAG;GAE9C,MAAM,OAAO;GACb,MAAM,OAAO,KAAK,KAAK,QAAQ,IAAI;GACnC,MAAM,OAAO,KAAK,KAAK,QAAQ,IAAI;GACnC,MAAM,OAAiB,MAAM,KAAK,EAAE,QAAQ,OAAO,KAAK,SAAS,CAAC,CAAC;GACnE,MAAM,YAAY,GAAW,MAAc;IAC1C,MAAM,KAAK,KAAK,MAAM,IAAI,IAAI;IAC9B,MAAM,KAAK,KAAK,MAAM,IAAI,IAAI;IAC9B,KAAK,IAAI,KAAK,IAAI,MAAM,GAAG,MAC1B,KAAK,IAAI,KAAK,IAAI,MAAM,GAAG,MAAM;KAChC,MAAM,MAAM,KAAK;KACjB,MAAM,MAAM,KAAK;KACjB,IAAI,MAAM,KAAK,MAAM,KAAK,OAAO,QAAQ,OAAO,MAAM;KACtD,KAAK,MAAM,SAAS,KAAK,MAAM,OAAO,MAAM,IAAI,MAAM,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,IAAI,SAAS,OAAO;IACnG;IACD,OAAO;GACR;GACA,MAAM,OAAO,GAAW,MAAc;IACrC,KAAK,KAAK,MAAM,IAAI,IAAI,IAAI,OAAO,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,KAAK;KAAE;KAAG;IAAE,CAAC;IACtE,IAAI,KAAK,QAAQ,MAAM,GAAG,GAAG,MAAM;IACnC,QAAQ,KAAK,KAAK;KAAE;KAAG;IAAE,CAAC;GAC3B;GAEA,KAAK,IAAI,KAAK,GAAG,KAAK,OAAO,MAC5B,KAAK,IAAI,KAAK,GAAG,KAAK,OAAO,MAAM;IAClC,IAAI,CAAC,IAAI,UAAU,IAAI,EAAE,GAAG;IAC5B,MAAM,IAAI,KAAK,QAAQ;IACvB,MAAM,IAAI,KAAK,IAAI,KAAK;IACxB,MAAM,IAAI,KAAK,IAAI,KAAK;IACxB,MAAM,IAAI,MAAM,GAAG,CAAC;IACpB,MAAM,SAAS,WAAW,IAAI,UAAU,UAAU,KAAK,IAAI,KAAK,KAAK,IAAI,OAAQ,IAAK,CAAC,GAAG,CAAC,IAAI;IAC/F,IAAI,IAAI,KAAK,KAAK,QAAQ;IAC1B,IAAI,IAAI,MAAM,OAAA,GAAmB;IACjC,IAAI,QAAQ,OAAO;KAClB,MAAM,QAAQ,WAAW,MAAM,CAAC,IAAI,QAAQ,GAAG,KAAK,KAAK,IAAI,KAAK,EAAE,KAAK,IAAI,OAAO,KAAK,MAAM,QAAQ,KAAK,QAAA,CAAkB;KAC9H,IAAI,CAAC,QAAQ,MAAM;MAAE;MAAG;MAAG,OAAO,IAAI,OAAO;MAAI,OAAO,UAAU,QAAQ,GAAG,IAAI,EAAE;MAAG,OAAO;MAAG;KAAM,CAAC,GAAG;IAC3G;IACA,IAAI,IAAI,MAAM,IAAI;IAClB,IAAI,CAAC,IAAI,KAAK,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG;IACvC,IAAI,QAAQ,cAAc,OAAO,QAAQ,QAAQ,UAAU,CAAC,CAAC,MAAM,CAAC,MAAM,SAAS,CAAC,IAAI,KAAK,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG;IAClH,MAAM,SAAS,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC,QAAQ,UAAU,MAAM,KAAK,KAAK,MAAM,KAAK,KAAK,MAAM,IAAI,SAAS,MAAM,IAAI,KAAK;IACvH,IAAI,OAAO,MAAM,UAAU,SAAS,MAAM,GAAG,MAAM,CAAC,CAAC,GAAG;IACxD,KAAK,MAAM,SAAS,QAAQ,IAAI,MAAM,GAAG,MAAM,CAAC;GACjD;EACF;CACD;AACD;;;;;;;AA+BA,SAAgB,cAAc,SAA8C;CAC3E,OAAO;EACN,IAAI;EACJ,MAAM;EACN,IAAI,KAAK;GACR,MAAM,EAAE,KAAK,QAAQ;GACrB,MAAM,EAAE,OAAO,UAAU;GACzB,MAAM,OAAO,QAAQ,QAAQ;GAC7B,MAAM,UAAU,QAAQ,WAAW;GACnC,MAAM,WAAW,QAAQ,YAAY;GACrC,KAAK,MAAM,UAAU,IAAI,SAAS;IACjC,IAAI,CAAC,OAAO,SAAS,SAAS,OAAO;IACrC,MAAM,SAAS,MAAM,QAAQ,IAAI,OAAO,MAAM,GAAG,QAAQ,IAAI,OAAO,MAAM,CAAC,KAAK,IAAI,KAAK,IAAI,MAAO;IACpG,MAAM,KAAK,UAAU,KAAK;KAAE,GAAG,OAAO,MAAM,IAAI,IAAI,MAAM,IAAI;KAAM,GAAG,OAAO,MAAM,IAAI,IAAI,MAAM,IAAI;IAAK,GAAG,CAAC;IAE/G,IAAI,WAAW,GAAG,MAAM,KAAK,IAAI,UAAU,MAAM,IAAI,QAAQ,OAAO,MAAM,GAAG,OAAO,MAAM,CAAC,CAAC;IAC5F,IAAI,KAAK,YAAY,GAAG,GAAG,GAAG,GAAG,CAAC;IAClC,QAAQ,KAAK,KAAK,IAAI,MAAM;GAC7B;GACA,MAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,SAAS,CAAC,CAAC;GACxD,IAAI,SAAS;GACb,KAAK,IAAI,UAAU,GAAG,UAAU,QAAQ,MAAM,SAAS,OAAO,WAAW;IACxE,MAAM,IAAI,IAAI,IAAI,KAAK,KAAK,QAAQ;IACpC,MAAM,IAAI,IAAI,IAAI,KAAK,KAAK,QAAQ;IACpC,IAAI,CAAC,IAAI,UAAU,KAAK,MAAM,CAAC,GAAG,KAAK,MAAM,CAAC,CAAC,GAAG;IAClD,MAAM,SAAS,IAAI,UAAU,GAAG,CAAC;IACjC,IAAI,CAAC,OAAO,OAAO,UAAU,IAAI,SAAS,MAAM,GAAG,MAAM,CAAC,KAAK,IAAI,KAAK,MAAM,GAAG,MAAM,GAAG,SAAS,CAAC,SAAS,UAAU,CAAC,CAAC,GAAG;IAC5H,KAAK,MAAM,SAAS,QAAQ;KAC3B,MAAM,KAAK,UAAU,KAAK,OAAO,CAAC;KAClC,IAAI,WAAW,GAAG,MAAM,KAAK,IAAI,UAAU,IAAI;KAC/C,IAAI,KAAK,YAAY,GAAG,GAAG,GAAG,GAAG,CAAC;KAClC,QAAQ,KAAK,KAAK,EAAE;IACrB;IACA;GACD;EACD;CACD;AACD;;;;;;;AAwBA,SAAgB,UAAU,SAA0C;CACnE,OAAO;EACN,IAAI;EACJ,MAAM;EACN,IAAI,KAAK;GACR,MAAM,EAAE,KAAK,aAAa;GAC1B,IAAI,CAAC,SAAS,QAAQ,SAAS,QAAQ,IAAI,GAAG;GAC9C,MAAM,OAAO,SAAS,KAAK,QAAQ,IAAI;GACvC,MAAM,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,SAAS,CAAC,CAAC;GACvD,MAAM,SAAS,QAAQ,WAAW,IAAI,QAAQ,SAAS,WAAY,OAAO,QAAQ,CAAC,OAAO,KAAK,IAAI,CAAC,CAAE;GACtG,MAAM,UAAU,WAAW,GAAG;GAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAClC,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;IAC3C,MAAM,OAAO,SAAS,KAAK,SAAS,OAAO,IAAI,OAAO,EAAE;IACxD,KAAK,MAAM,KAAK,MAAM;KACrB,MAAM,KAAK,IAAI,IAAI;KACnB,MAAM,MAAM,IAAI,MAAM,IAAI;KAC1B,KAAK,IAAI,KAAK,GAAG,KAAK,MAAM,MAC3B,KAAK,IAAI,KAAK,GAAG,KAAK,MAAM,MAAM;MACjC,MAAM,IAAI,KAAK,KAAK,KAAK,MAAM,OAAO,CAAC;MACvC,MAAM,IAAI,KAAK,KAAK,KAAK,MAAM,OAAO,CAAC;MACvC,IAAI,GAAG,KAAK,GAAG,CAAC,KAAK,IAAI,MAAM,IAAI,IAAI,QAAQ,OAAA,GAAmB,IAAI,MAAM,IAAI,IAAI,QAAQ,KAAK;KAClG;IACF;GACD;EACF;CACD;AACD;;AAGA,SAAS,SAAS,KAAc,SAAwC,MAAY,IAAoB;CACvG,MAAM,EAAE,OAAO,OAAO,QAAQ,OAAO,UAAU;CAC/C,MAAM,QAAQ,KAAK,MAAM,KAAK,CAAC,IAAI,QAAQ,KAAK,MAAM,KAAK,CAAC;CAC5D,MAAM,OAAO,KAAK,MAAM,GAAG,CAAC,IAAI,QAAQ,KAAK,MAAM,GAAG,CAAC;CACvD,MAAM,YAAY,GAAW,MAAc,OAAO,OAAO,OAAO,MAAM,MAAM,KAAK,KAAK,MAAM,KAAK;CACjG,MAAM,OAAO,IAAI,aAAa,QAAQ,KAAK,CAAC,CAAC,KAAK,QAAQ;CAC1D,MAAM,OAAO,IAAI,WAAW,QAAQ,KAAK,CAAC,CAAC,KAAK,EAAE;CAClD,MAAM,SAAS,IAAI,WAAW,QAAQ,KAAK;CAE3C,MAAM,YAAsB,CAAC;CAC7B,MAAM,YAAsB,CAAC;CAC7B,MAAM,QAAQ,UAAkB,MAAc;EAC7C,UAAU,KAAK,CAAC;EAChB,UAAU,KAAK,QAAQ;EACvB,IAAI,IAAI,UAAU,SAAS;EAC3B,OAAO,IAAI,GAAG;GACb,MAAM,SAAU,IAAI,KAAM;GAC1B,IAAI,UAAU,WAAW,UAAU,IAAI;GACtC,CAAC,UAAU,SAAS,UAAU,MAAM,CAAC,UAAU,IAAI,UAAU,OAAO;GACpE,CAAC,UAAU,SAAS,UAAU,MAAM,CAAC,UAAU,IAAI,UAAU,OAAO;GACrE,IAAI;EACL;CACD;CACA,MAAM,YAAoB;EACzB,MAAM,MAAM,UAAU;EACtB,MAAM,WAAW,UAAU,IAAI;EAC/B,MAAM,WAAW,UAAU,IAAI;EAC/B,IAAI,UAAU,QAAQ;GACrB,UAAU,KAAK;GACf,UAAU,KAAK;GACf,IAAI,IAAI;GACR,SAAS;IACR,MAAM,IAAI,IAAI,IAAI;IAClB,MAAM,IAAI,IAAI;IACd,IAAI,OAAO;IACX,IAAI,IAAI,UAAU,UAAU,UAAU,KAAK,UAAU,OAAO,OAAO;IACnE,IAAI,IAAI,UAAU,UAAU,UAAU,KAAK,UAAU,OAAO,OAAO;IACnE,IAAI,SAAS,GAAG;IACf,CAAC,UAAU,OAAO,UAAU,MAAM,CAAC,UAAU,IAAI,UAAU,KAAK;IAChE,CAAC,UAAU,OAAO,UAAU,MAAM,CAAC,UAAU,IAAI,UAAU,KAAK;IACjE,IAAI;GACL;EACD;EACA,OAAO;CACR;CACA,MAAM,KAAK,MAAc,MAAO,IAAI,QAAU,OAAO,OAAQ,KAAK,MAAM,IAAI,KAAK,IAAI,KAAK,MAAM,OAAO,KAAK,CAAC;CAC7G,KAAK,SAAS;CACd,KAAK,EAAE,KAAK,GAAG,KAAK;CACpB,OAAO,UAAU,QAAQ;EACxB,MAAM,IAAI,IAAI;EACd,IAAI,OAAO,IAAI;EACf,OAAO,KAAK;EACZ,IAAI,MAAM,MAAM;EAChB,MAAM,KAAK,IAAI;EACf,MAAM,MAAM,IAAI,MAAM;EACtB,KAAK,MAAM,CAAC,IAAI,OAAO,YAAY;GAClC,MAAM,KAAK,KAAK;GAChB,MAAM,KAAK,KAAK;GAChB,IAAI,CAAC,GAAG,KAAK,IAAI,EAAE,GAAG;GACtB,MAAM,IAAI,KAAK,QAAQ;GACvB,IAAI,OAAO,MAAM,MAAM,OAAA,KAAqB,CAAC,SAAS,GAAG,CAAC,GAAG;GAC7D,MAAM,OAAO,IAAI,QAAQ,QAAQ,KAAK,IAAK,KAAK,EAAG,IAAI,KAAK,MAAM,KAAK,IAAI;GAC3E,MAAM,OAAO,KAAK,KAAK;GACvB,IAAI,QAAQ,KAAK,IAAI;GACrB,KAAK,KAAK;GACV,KAAK,KAAK;GACV,KAAK,OAAO,EAAE,CAAC,GAAG,CAAC;EACpB;CACD;CACA,IAAI,KAAK,QAAQ,KAAK,SAAS,OAAO,OAAO,CAAC;CAC9C,MAAM,OAAiB,CAAC;CACxB,KAAK,IAAI,IAAI,MAAM,KAAK,GAAG,IAAI,KAAK,IAAI;EACvC,KAAK,KAAK,CAAC;EACX,IAAI,MAAM,OAAO;CAClB;CACA,OAAO,KAAK,QAAQ;AACrB;;;;;;;;AA2BA,SAAgB,gBAAgB,UAAkC,CAAC,GAAiB;CACnF,MAAM,EAAE,QAAQ,CAAC,GAAG,QAAQ,CAAC,GAAG,YAAY,CAAC,MAAM;CACnD,MAAM,QAAQ,UAAU,SAAS;CACjC,MAAM,OAAO,UAAU,QAAQ;CAC/B,OAAO;EACN,QAAQ;GACP;IAAE,IAAI;IAAU,MAAM;IAAgB,aAAa;IAA4C,SAAS;IAAG,KAAK;IAAG,KAAK;IAAG,MAAM;GAAE;GACnI;IAAE,IAAI;IAAS,MAAM;IAAS,aAAa;IAAsC,SAAS;IAAM,KAAK;IAAG,KAAK;IAAK,MAAM;GAAK;GAC7H;IAAE,IAAI;IAAa,MAAM;IAAa,aAAa;IAA6B,SAAS;IAAK,KAAK;IAAG,KAAK;IAAG,MAAM;GAAK;GACzH;IAAE,IAAI;IAAS,MAAM;IAAS,aAAa;IAAmC,SAAS;IAAI,KAAK;IAAG,KAAK;IAAI,MAAM;GAAE;GACpH;IAAE,IAAI;IAAS,MAAM;IAAS,aAAa;IAAgC,SAAS,MAAM,SAAS,MAAO;IAAG,KAAK;IAAG,KAAK;IAAK,MAAM;GAAK;GAC1I;IAAE,IAAI;IAAS,MAAM;IAAS,aAAa;IAA4B,SAAS,MAAM,SAAS,MAAO;IAAG,KAAK;IAAG,KAAK;IAAK,MAAM;GAAK;EACvI;EACA,QAAQ;GACP,YAAY;GACZ,UAAU;GACV,WAAW,EAAE,MAAM,QAAQ,MAAM,CAAC;GAClC,GAAI,MAAM,SACP,CACA,YAAY;IACX,MAAM;IACN,SAAS;IACT,OAAO,KAAK,OAAO;KAClB,MAAM,OAAO,SAAS,KAAK,IAAI,IAAI,KAAK,IAAI,MAAO,IAAI;KACvD,IAAI,UAAU;MACb,OAAO,MAAM,IAAI,IAAI,IAAI,GAAG,MAAM,SAAS,CAAC;MAC5C,GAAG,GAAG;MACN,GAAG,GAAG;MACN,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,KAAK;MAChC,OAAO;MACP,QAAQ;MACR,QAAQ;KACT,CAAC;IACF;GACD,CAAC,CACF,IACC,CAAC;GACJ,GAAI,MAAM,SACP,CACA,YAAY;IACX,MAAM;IACN,SAAS;IACT,SAAS;IACT,YAAY,EAAE,OAAO,EAAE;IACvB,OAAO,KAAK,OAAO;KAClB,MAAM,OAAO,SAAS,KAAM,IAAI,IAAI,KAAK,IAAI;KAC7C,IAAI,UAAU;MACb,OAAO,MAAM,IAAI,IAAI,IAAI,GAAG,MAAM,SAAS,CAAC;MAC5C,GAAG,GAAG;MACN,GAAG,GAAG;MACN,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,KAAK;MAChC,OAAO;MACP,QAAQ;MACR,QAAQ;KACT,CAAC;IACF;GACD,CAAC,CACF,IACC,CAAC;EACL;CACD;AACD"}

package/dist/generateWorker.d.ts

@@ -1,5 +1,6 @@
 import { type GeneratorOptions } from './generate';
-import { type GameModule } from './game';
+import { type Rules } from './game';
+import { type Game } from './createGame';
 import type { GameMap } from './map';
 import type { MapProblem } from './mapFields';
 import type { NavigationPort, NavigationWorkerLike } from './navigation/builds';
@@ -9,8 +10,11 @@ import type { NavigationPort, NavigationWorkerLike } from './navigation/builds';
  * @beta
  */
 export interface GeneratedMap {
+    /** The map the generator made */
     map: GameMap;
+    /** What is wrong with the map, as `MapProblem`s found when it was checked */
     problems: MapProblem[];
+    /** The seed the map came out of */
     seed: number;
 }
 /**
@@ -21,14 +25,14 @@ export interface GeneratedMap {
  */
 export type MapGenerating = (options: GeneratorOptions) => Promise<GeneratedMap>;
 /**
- * What a worker's file of a game's maps does: it makes, with the game's generator (`GameModule.generator`) and its
+ * What a worker's file of a game's maps does: it makes, with the game's generator (`Rules.generator`) and its
  * registry, the map of each set of options it is sent, and sends it back. A worker's file of two lines, the game's rules
  * imported and this called with them; `port` is where it hears, as for `serveNavigationBuilds`: the worker's own scope
  * when left out
  *
  * @beta
  */
-export declare function serveMapGenerator(rules: GameModule, port?: NavigationPort): void;
+export declare function serveMapGenerator(game: Game<unknown> | Rules, port?: NavigationPort): void;
 /**
  * Maps made in a worker whose file serves them (`serveMapGenerator`): the page makes the worker as its bundler wants it,
  * `mapGeneratorWorker(() => new Worker(new URL('./generate.worker.ts', import.meta.url), { type: 'module' }))`. Given

package/dist/generateWorker.js

@@ -0,0 +1,86 @@
+import { createRegistry } from "./game.js";
+import { generateMap } from "./generate.js";
+import { rulesOf } from "./createGame.js";
+//#region src/generateWorker.ts
+/**
+* What a worker's file of a game's maps does: it makes, with the game's generator (`Rules.generator`) and its
+* registry, the map of each set of options it is sent, and sends it back. A worker's file of two lines, the game's rules
+* imported and this called with them; `port` is where it hears, as for `serveNavigationBuilds`: the worker's own scope
+* when left out
+*
+* @beta
+*/
+function serveMapGenerator(game, port = globalThis) {
+	const rules = rulesOf(game);
+	let registry;
+	const asked = (message) => {
+		const { id, options } = message;
+		try {
+			if (!rules.generator) throw new Error(`${rules.name} has no generator of maps (Rules.generator)`);
+			registry ??= createRegistry(rules);
+			port.postMessage({
+				id,
+				made: generateMap(rules.generator, options, registry)
+			});
+		} catch (error) {
+			port.postMessage({
+				id,
+				error: error instanceof Error ? error.message : String(error)
+			});
+		}
+	};
+	if (port.on) port.on("message", asked);
+	else port.addEventListener?.("message", (event) => asked(event.data));
+}
+/**
+* Maps made in a worker whose file serves them (`serveMapGenerator`): the page makes the worker as its bundler wants it,
+* `mapGeneratorWorker(() => new Worker(new URL('./generate.worker.ts', import.meta.url), { type: 'module' }))`. Given
+* as a function, the worker is made at the first map asked for: a menu that is never opened fetches none of it
+*
+* @beta
+*/
+function mapGeneratorWorker(given) {
+	let next = 0;
+	const waiting = /* @__PURE__ */ new Map();
+	const answered = (answer) => {
+		const wait = waiting.get(answer.id);
+		if (!wait) return;
+		waiting.delete(answer.id);
+		if (answer.made) wait.done(answer.made);
+		else wait.failed(new Error(answer.error ?? "The map could not be made"));
+	};
+	const broke = (error) => {
+		const reason = /* @__PURE__ */ new Error(`The maps' worker stopped: ${error instanceof Error ? error.message : String(error?.message ?? error)}`);
+		for (const wait of waiting.values()) wait.failed(reason);
+		waiting.clear();
+	};
+	let made;
+	const worker = () => {
+		if (made) return made;
+		made = typeof given === "function" ? given() : given;
+		if (made.on) {
+			made.on("message", (value) => answered(value));
+			made.on("error", broke);
+		} else {
+			made.addEventListener?.("message", (event) => answered(event.data));
+			made.addEventListener?.("error", broke);
+		}
+		return made;
+	};
+	if (typeof given !== "function") worker();
+	return (options) => new Promise((done, failed) => {
+		const id = ++next;
+		waiting.set(id, {
+			done,
+			failed
+		});
+		worker().postMessage({
+			id,
+			options
+		});
+	});
+}
+//#endregion
+export { mapGeneratorWorker, serveMapGenerator };
+
+//# sourceMappingURL=generateWorker.js.map

package/dist/generateWorker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"generateWorker.js","names":[],"sources":["../src/generateWorker.ts"],"sourcesContent":["import { generateMap, type GeneratorOptions } from './generate'\nimport { createRegistry, type Rules } from './game'\nimport { type Game, rulesOf } from './createGame'\nimport type { GameMap } from './map'\nimport type { MapProblem } from './mapFields'\nimport type { NavigationPort, NavigationWorkerLike } from './navigation/builds'\nimport type { Registry } from './registry'\n\n/**\n * A map a generator made (`generateMap`): the map, what is wrong with it, and the seed it came out of\n *\n * @beta\n */\nexport interface GeneratedMap {\n\t/** The map the generator made */\n\tmap: GameMap\n\t/** What is wrong with the map, as `MapProblem`s found when it was checked */\n\tproblems: MapProblem[]\n\t/** The seed the map came out of */\n\tseed: number\n}\n\n/**\n * Makes a map of options somewhere else than this thread (`mapGeneratorWorker`): a menu's preview of a random map that\n * does not stop the page while it is made\n *\n * @beta\n */\nexport type MapGenerating = (options: GeneratorOptions) => Promise<GeneratedMap>\n\ninterface GenerateAnswer {\n\tid: number\n\tmade?: GeneratedMap\n\terror?: string\n}\n\n/**\n * What a worker's file of a game's maps does: it makes, with the game's generator (`Rules.generator`) and its\n * registry, the map of each set of options it is sent, and sends it back. A worker's file of two lines, the game's rules\n * imported and this called with them; `port` is where it hears, as for `serveNavigationBuilds`: the worker's own scope\n * when left out\n *\n * @beta\n */\nexport function serveMapGenerator(game: Game<unknown> | Rules, port: NavigationPort = globalThis as unknown as NavigationPort): void {\n\tconst rules = rulesOf(game)\n\tlet registry: Registry | undefined\n\tconst asked = (message: unknown) => {\n\t\tconst { id, options } = message as { id: number; options: GeneratorOptions }\n\t\ttry {\n\t\t\tif (!rules.generator) throw new Error(`${rules.name} has no generator of maps (Rules.generator)`)\n\t\t\tregistry ??= createRegistry(rules)\n\t\t\tport.postMessage({ id, made: generateMap(rules.generator, options, registry) } satisfies GenerateAnswer)\n\t\t} catch (error) {\n\t\t\tport.postMessage({ id, error: error instanceof Error ? error.message : String(error) } satisfies GenerateAnswer)\n\t\t}\n\t}\n\tif (port.on) port.on('message', asked)\n\telse port.addEventListener?.('message', (event) => asked(event.data))\n}\n\n/**\n * Maps made in a worker whose file serves them (`serveMapGenerator`): the page makes the worker as its bundler wants it,\n * `mapGeneratorWorker(() => new Worker(new URL('./generate.worker.ts', import.meta.url), { type: 'module' }))`. Given\n * as a function, the worker is made at the first map asked for: a menu that is never opened fetches none of it\n *\n * @beta\n */\nexport function mapGeneratorWorker(given: NavigationWorkerLike | (() => NavigationWorkerLike)): MapGenerating {\n\tlet next = 0\n\tconst waiting = new Map<number, { done: (made: GeneratedMap) => void; failed: (error: Error) => void }>()\n\tconst answered = (answer: GenerateAnswer) => {\n\t\tconst wait = waiting.get(answer.id)\n\t\tif (!wait) return\n\t\twaiting.delete(answer.id)\n\t\tif (answer.made) wait.done(answer.made)\n\t\telse wait.failed(new Error(answer.error ?? 'The map could not be made'))\n\t}\n\tconst broke = (error: unknown) => {\n\t\tconst reason = new Error(\n\t\t\t`The maps' worker stopped: ${error instanceof Error ? error.message : String((error as { message?: string })?.message ?? error)}`\n\t\t)\n\t\tfor (const wait of waiting.values()) wait.failed(reason)\n\t\twaiting.clear()\n\t}\n\tlet made: NavigationWorkerLike | undefined\n\tconst worker = () => {\n\t\tif (made) return made\n\t\tmade = typeof given === 'function' ? given() : given\n\t\tif (made.on) {\n\t\t\tmade.on('message', (value) => answered(value as GenerateAnswer))\n\t\t\tmade.on('error', broke)\n\t\t} else {\n\t\t\tmade.addEventListener?.('message', (event) => answered(event.data as GenerateAnswer))\n\t\t\tmade.addEventListener?.('error', broke)\n\t\t}\n\t\treturn made\n\t}\n\tif (typeof given !== 'function') worker()\n\treturn (options) =>\n\t\tnew Promise<GeneratedMap>((done, failed) => {\n\t\t\tconst id = ++next\n\t\t\twaiting.set(id, { done, failed })\n\t\t\tworker().postMessage({ id, options })\n\t\t})\n}\n"],"mappings":";;;;;;;;;;;;AA4CA,SAAgB,kBAAkB,MAA6B,OAAuB,YAA+C;CACpI,MAAM,QAAQ,QAAQ,IAAI;CAC1B,IAAI;CACJ,MAAM,SAAS,YAAqB;EACnC,MAAM,EAAE,IAAI,YAAY;EACxB,IAAI;GACH,IAAI,CAAC,MAAM,WAAW,MAAM,IAAI,MAAM,GAAG,MAAM,KAAK,4CAA4C;GAChG,aAAa,eAAe,KAAK;GACjC,KAAK,YAAY;IAAE;IAAI,MAAM,YAAY,MAAM,WAAW,SAAS,QAAQ;GAAE,CAA0B;EACxG,SAAS,OAAO;GACf,KAAK,YAAY;IAAE;IAAI,OAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;GAAE,CAA0B;EAChH;CACD;CACA,IAAI,KAAK,IAAI,KAAK,GAAG,WAAW,KAAK;MAChC,KAAK,mBAAmB,YAAY,UAAU,MAAM,MAAM,IAAI,CAAC;AACrE;;;;;;;;AASA,SAAgB,mBAAmB,OAA2E;CAC7G,IAAI,OAAO;CACX,MAAM,0BAAU,IAAI,IAAoF;CACxG,MAAM,YAAY,WAA2B;EAC5C,MAAM,OAAO,QAAQ,IAAI,OAAO,EAAE;EAClC,IAAI,CAAC,MAAM;EACX,QAAQ,OAAO,OAAO,EAAE;EACxB,IAAI,OAAO,MAAM,KAAK,KAAK,OAAO,IAAI;OACjC,KAAK,OAAO,IAAI,MAAM,OAAO,SAAS,2BAA2B,CAAC;CACxE;CACA,MAAM,SAAS,UAAmB;EACjC,MAAM,yBAAS,IAAI,MAClB,6BAA6B,iBAAiB,QAAQ,MAAM,UAAU,OAAQ,OAAgC,WAAW,KAAK,GAC/H;EACA,KAAK,MAAM,QAAQ,QAAQ,OAAO,GAAG,KAAK,OAAO,MAAM;EACvD,QAAQ,MAAM;CACf;CACA,IAAI;CACJ,MAAM,eAAe;EACpB,IAAI,MAAM,OAAO;EACjB,OAAO,OAAO,UAAU,aAAa,MAAM,IAAI;EAC/C,IAAI,KAAK,IAAI;GACZ,KAAK,GAAG,YAAY,UAAU,SAAS,KAAuB,CAAC;GAC/D,KAAK,GAAG,SAAS,KAAK;EACvB,OAAO;GACN,KAAK,mBAAmB,YAAY,UAAU,SAAS,MAAM,IAAsB,CAAC;GACpF,KAAK,mBAAmB,SAAS,KAAK;EACvC;EACA,OAAO;CACR;CACA,IAAI,OAAO,UAAU,YAAY,OAAO;CACxC,QAAQ,YACP,IAAI,SAAuB,MAAM,WAAW;EAC3C,MAAM,KAAK,EAAE;EACb,QAAQ,IAAI,IAAI;GAAE;GAAM;EAAO,CAAC;EAChC,OAAO,CAAC,CAAC,YAAY;GAAE;GAAI;EAAQ,CAAC;CACrC,CAAC;AACH"}

package/dist/grid.d.ts

@@ -20,7 +20,9 @@ export interface GridOptions {
  */
 export declare class BuildGrid {
     private readonly terrain;
+    /** The grid's width in cells, the map's width */
     readonly width: number;
+    /** The grid's depth in cells, the map's depth */
     readonly depth: number;
     /** Id of the structure occupying each cell, 0 when free */
     private readonly occupant;
@@ -38,16 +40,23 @@ export declare class BuildGrid {
         width: number;
         depth: number;
     }): void;
+    /** Whether the cell `(x, z)` is on the grid */
     inBounds(x: number, z: number): boolean;
+    /** The id of the structure standing on the cell, 0 when none does and -1 when the cell is off the grid */
     occupantAt(x: number, z: number): number;
+    /** Whether a structure may be put on the cell by the ground alone: on the grid, flat enough, dry, not at the edge or blocked */
     isBuildable(x: number, z: number): boolean;
+    /** Whether the cell is buildable and has no structure on it */
     isFree(x: number, z: number): boolean;
     /** Min cell of a footprint centered as close as possible to the given point */
     cellFor(x: number, z: number, w: number, d: number): {
         x: number;
         z: number;
     };
+    /** Whether a footprint of `w` by `d` cells with its first cell at `(cellX, cellZ)` is free and on ground level enough to build on */
     canPlace(cellX: number, cellZ: number, w: number, d: number): boolean;
+    /** Marks the footprint's cells as taken by the structure `id`; cells off the grid are skipped */
     occupy(cellX: number, cellZ: number, w: number, d: number, id: number): void;
+    /** Frees the footprint's cells that the structure `id` holds; cells held by another id are left */
     release(cellX: number, cellZ: number, w: number, d: number, id: number): void;
 }

package/dist/grid.js

@@ -0,0 +1,102 @@
+//#region src/grid.ts
+/**
+* Min cell of a footprint centered as close as possible to the given point
+*
+* @beta
+*/
+var footprintCell = (x, z, w, d) => ({
+	x: Math.round(x - w / 2),
+	z: Math.round(z - d / 2)
+});
+/**
+* Placement grid. One cell per world unit, tracking where structures stand and
+* where the ground is flat enough to build.
+*
+* @beta
+*/
+var BuildGrid = class {
+	terrain;
+	/** The grid's width in cells, the map's width */
+	width;
+	/** The grid's depth in cells, the map's depth */
+	depth;
+	/** Id of the structure occupying each cell, 0 when free */
+	occupant;
+	buildable;
+	/** The steepest a cell is built on */
+	maxBuildSlope;
+	constructor(terrain, options = {}) {
+		this.terrain = terrain;
+		this.maxBuildSlope = options.maxBuildSlope ?? .3;
+		this.width = terrain.width;
+		this.depth = terrain.depth;
+		this.occupant = new Int32Array(this.width * this.depth);
+		this.buildable = new Uint8Array(this.width * this.depth);
+		this.groundChanged({
+			x: 0,
+			z: 0,
+			width: this.width,
+			depth: this.depth
+		});
+	}
+	/**
+	* Works out again where can be built, in a rectangle of cells and the ring about it (a slope is of the vertices about a
+	* cell): after the ground was reshaped there (`World.reshapeGround`). What stands there stays where it is
+	*/
+	groundChanged(rect) {
+		const { terrain } = this;
+		const x0 = Math.max(rect.x - 1, 0);
+		const z0 = Math.max(rect.z - 1, 0);
+		const x1 = Math.min(rect.x + rect.width + 1, this.width);
+		const z1 = Math.min(rect.z + rect.depth + 1, this.depth);
+		for (let z = z0; z < z1; z++) for (let x = x0; x < x1; x++) {
+			const edge = x < 1 || z < 1 || x >= this.width - 1 || z >= this.depth - 1 || !terrain.inPlay(x, z) || terrain.blocked[z * this.width + x] > 0;
+			const wet = terrain.water[z * this.width + x] !== 0;
+			this.buildable[z * this.width + x] = !edge && !wet && terrain.slopeAt(x + .5, z + .5) <= this.maxBuildSlope ? 1 : 0;
+		}
+	}
+	/** Whether the cell `(x, z)` is on the grid */
+	inBounds(x, z) {
+		return x >= 0 && z >= 0 && x < this.width && z < this.depth;
+	}
+	/** The id of the structure standing on the cell, 0 when none does and -1 when the cell is off the grid */
+	occupantAt(x, z) {
+		return this.inBounds(x, z) ? this.occupant[z * this.width + x] : -1;
+	}
+	/** Whether a structure may be put on the cell by the ground alone: on the grid, flat enough, dry, not at the edge or blocked */
+	isBuildable(x, z) {
+		return this.inBounds(x, z) && this.buildable[z * this.width + x] === 1;
+	}
+	/** Whether the cell is buildable and has no structure on it */
+	isFree(x, z) {
+		return this.isBuildable(x, z) && this.occupant[z * this.width + x] === 0;
+	}
+	/** Min cell of a footprint centered as close as possible to the given point */
+	cellFor(x, z, w, d) {
+		return footprintCell(x, z, w, d);
+	}
+	/** Whether a footprint of `w` by `d` cells with its first cell at `(cellX, cellZ)` is free and on ground level enough to build on */
+	canPlace(cellX, cellZ, w, d) {
+		let min = Infinity;
+		let max = -Infinity;
+		for (let z = cellZ; z < cellZ + d; z++) for (let x = cellX; x < cellX + w; x++) if (!this.isFree(x, z)) return false;
+		for (let z = cellZ; z <= cellZ + d; z++) for (let x = cellX; x <= cellX + w; x++) {
+			const h = this.terrain.vertexHeight(x, z);
+			if (h < min) min = h;
+			if (h > max) max = h;
+		}
+		return max - min <= .2 * Math.max(w, d) + .4;
+	}
+	/** Marks the footprint's cells as taken by the structure `id`; cells off the grid are skipped */
+	occupy(cellX, cellZ, w, d, id) {
+		for (let z = cellZ; z < cellZ + d; z++) for (let x = cellX; x < cellX + w; x++) if (this.inBounds(x, z)) this.occupant[z * this.width + x] = id;
+	}
+	/** Frees the footprint's cells that the structure `id` holds; cells held by another id are left */
+	release(cellX, cellZ, w, d, id) {
+		for (let z = cellZ; z < cellZ + d; z++) for (let x = cellX; x < cellX + w; x++) if (this.inBounds(x, z) && this.occupant[z * this.width + x] === id) this.occupant[z * this.width + x] = 0;
+	}
+};
+//#endregion
+export { BuildGrid, footprintCell };
+
+//# sourceMappingURL=grid.js.map

package/dist/grid.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"grid.js","names":[],"sources":["../src/grid.ts"],"sourcesContent":["import type { Terrain } from './terrain'\n\n/**\n * Min cell of a footprint centered as close as possible to the given point\n *\n * @beta\n */\nexport const footprintCell = (x: number, z: number, w: number, d: number) => ({ x: Math.round(x - w / 2), z: Math.round(z - d / 2) })\n\nexport interface GridOptions {\n\t/** Steepest slope (radians) that can be built on */\n\tmaxBuildSlope?: number\n}\n\n/**\n * Placement grid. One cell per world unit, tracking where structures stand and\n * where the ground is flat enough to build.\n *\n * @beta\n */\nexport class BuildGrid {\n\t/** The grid's width in cells, the map's width */\n\treadonly width: number\n\t/** The grid's depth in cells, the map's depth */\n\treadonly depth: number\n\t/** Id of the structure occupying each cell, 0 when free */\n\tprivate readonly occupant: Int32Array\n\tprivate readonly buildable: Uint8Array\n\n\t/** The steepest a cell is built on */\n\tprivate readonly maxBuildSlope: number\n\n\tconstructor(\n\t\tprivate readonly terrain: Terrain,\n\t\toptions: GridOptions = {}\n\t) {\n\t\tthis.maxBuildSlope = options.maxBuildSlope ?? 0.3\n\t\tthis.width = terrain.width\n\t\tthis.depth = terrain.depth\n\t\tthis.occupant = new Int32Array(this.width * this.depth)\n\t\tthis.buildable = new Uint8Array(this.width * this.depth)\n\t\tthis.groundChanged({ x: 0, z: 0, width: this.width, depth: this.depth })\n\t}\n\n\t/**\n\t * Works out again where can be built, in a rectangle of cells and the ring about it (a slope is of the vertices about a\n\t * cell): after the ground was reshaped there (`World.reshapeGround`). What stands there stays where it is\n\t */\n\tgroundChanged(rect: { x: number; z: number; width: number; depth: number }): void {\n\t\tconst { terrain } = this\n\t\tconst x0 = Math.max(rect.x - 1, 0)\n\t\tconst z0 = Math.max(rect.z - 1, 0)\n\t\tconst x1 = Math.min(rect.x + rect.width + 1, this.width)\n\t\tconst z1 = Math.min(rect.z + rect.depth + 1, this.depth)\n\t\tfor (let z = z0; z < z1; z++) {\n\t\t\tfor (let x = x0; x < x1; x++) {\n\t\t\t\tconst edge = x < 1 || z < 1 || x >= this.width - 1 || z >= this.depth - 1 || !terrain.inPlay(x, z) || terrain.blocked[z * this.width + x] > 0\n\t\t\t\tconst wet = terrain.water[z * this.width + x] !== 0\n\t\t\t\tthis.buildable[z * this.width + x] = !edge && !wet && terrain.slopeAt(x + 0.5, z + 0.5) <= this.maxBuildSlope ? 1 : 0\n\t\t\t}\n\t\t}\n\t}\n\n\t/** Whether the cell `(x, z)` is on the grid */\n\tinBounds(x: number, z: number): boolean {\n\t\treturn x >= 0 && z >= 0 && x < this.width && z < this.depth\n\t}\n\n\t/** The id of the structure standing on the cell, 0 when none does and -1 when the cell is off the grid */\n\toccupantAt(x: number, z: number): number {\n\t\treturn this.inBounds(x, z) ? this.occupant[z * this.width + x] : -1\n\t}\n\n\t/** Whether a structure may be put on the cell by the ground alone: on the grid, flat enough, dry, not at the edge or blocked */\n\tisBuildable(x: number, z: number): boolean {\n\t\treturn this.inBounds(x, z) && this.buildable[z * this.width + x] === 1\n\t}\n\n\t/** Whether the cell is buildable and has no structure on it */\n\tisFree(x: number, z: number): boolean {\n\t\treturn this.isBuildable(x, z) && this.occupant[z * this.width + x] === 0\n\t}\n\n\t/** Min cell of a footprint centered as close as possible to the given point */\n\tcellFor(x: number, z: number, w: number, d: number): { x: number; z: number } {\n\t\treturn footprintCell(x, z, w, d)\n\t}\n\n\t/** Whether a footprint of `w` by `d` cells with its first cell at `(cellX, cellZ)` is free and on ground level enough to build on */\n\tcanPlace(cellX: number, cellZ: number, w: number, d: number): boolean {\n\t\tlet min = Infinity\n\t\tlet max = -Infinity\n\t\tfor (let z = cellZ; z < cellZ + d; z++) {\n\t\t\tfor (let x = cellX; x < cellX + w; x++) {\n\t\t\t\tif (!this.isFree(x, z)) return false\n\t\t\t}\n\t\t}\n\t\tfor (let z = cellZ; z <= cellZ + d; z++) {\n\t\t\tfor (let x = cellX; x <= cellX + w; x++) {\n\t\t\t\tconst h = this.terrain.vertexHeight(x, z)\n\t\t\t\tif (h < min) min = h\n\t\t\t\tif (h > max) max = h\n\t\t\t}\n\t\t}\n\t\treturn max - min <= 0.2 * Math.max(w, d) + 0.4\n\t}\n\n\t/** Marks the footprint's cells as taken by the structure `id`; cells off the grid are skipped */\n\toccupy(cellX: number, cellZ: number, w: number, d: number, id: number): void {\n\t\tfor (let z = cellZ; z < cellZ + d; z++) {\n\t\t\tfor (let x = cellX; x < cellX + w; x++) {\n\t\t\t\tif (this.inBounds(x, z)) this.occupant[z * this.width + x] = id\n\t\t\t}\n\t\t}\n\t}\n\n\t/** Frees the footprint's cells that the structure `id` holds; cells held by another id are left */\n\trelease(cellX: number, cellZ: number, w: number, d: number, id: number): void {\n\t\tfor (let z = cellZ; z < cellZ + d; z++) {\n\t\t\tfor (let x = cellX; x < cellX + w; x++) {\n\t\t\t\tif (this.inBounds(x, z) && this.occupant[z * this.width + x] === id) this.occupant[z * this.width + x] = 0\n\t\t\t}\n\t\t}\n\t}\n}\n"],"mappings":";;;;;;AAOA,IAAa,iBAAiB,GAAW,GAAW,GAAW,OAAe;CAAE,GAAG,KAAK,MAAM,IAAI,IAAI,CAAC;CAAG,GAAG,KAAK,MAAM,IAAI,IAAI,CAAC;AAAE;;;;;;;AAanI,IAAa,YAAb,MAAuB;CAaJ;;CAXlB;;CAEA;;CAEA;CACA;;CAGA;CAEA,YACC,SACA,UAAuB,CAAC,GACvB;EAFgB,KAAA,UAAA;EAGjB,KAAK,gBAAgB,QAAQ,iBAAiB;EAC9C,KAAK,QAAQ,QAAQ;EACrB,KAAK,QAAQ,QAAQ;EACrB,KAAK,WAAW,IAAI,WAAW,KAAK,QAAQ,KAAK,KAAK;EACtD,KAAK,YAAY,IAAI,WAAW,KAAK,QAAQ,KAAK,KAAK;EACvD,KAAK,cAAc;GAAE,GAAG;GAAG,GAAG;GAAG,OAAO,KAAK;GAAO,OAAO,KAAK;EAAM,CAAC;CACxE;;;;;CAMA,cAAc,MAAoE;EACjF,MAAM,EAAE,YAAY;EACpB,MAAM,KAAK,KAAK,IAAI,KAAK,IAAI,GAAG,CAAC;EACjC,MAAM,KAAK,KAAK,IAAI,KAAK,IAAI,GAAG,CAAC;EACjC,MAAM,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,QAAQ,GAAG,KAAK,KAAK;EACvD,MAAM,KAAK,KAAK,IAAI,KAAK,IAAI,KAAK,QAAQ,GAAG,KAAK,KAAK;EACvD,KAAK,IAAI,IAAI,IAAI,IAAI,IAAI,KACxB,KAAK,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK;GAC7B,MAAM,OAAO,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,QAAQ,KAAK,KAAK,KAAK,QAAQ,KAAK,CAAC,QAAQ,OAAO,GAAG,CAAC,KAAK,QAAQ,QAAQ,IAAI,KAAK,QAAQ,KAAK;GAC5I,MAAM,MAAM,QAAQ,MAAM,IAAI,KAAK,QAAQ,OAAO;GAClD,KAAK,UAAU,IAAI,KAAK,QAAQ,KAAK,CAAC,QAAQ,CAAC,OAAO,QAAQ,QAAQ,IAAI,IAAK,IAAI,EAAG,KAAK,KAAK,gBAAgB,IAAI;EACrH;CAEF;;CAGA,SAAS,GAAW,GAAoB;EACvC,OAAO,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,SAAS,IAAI,KAAK;CACvD;;CAGA,WAAW,GAAW,GAAmB;EACxC,OAAO,KAAK,SAAS,GAAG,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,QAAQ,KAAK;CAClE;;CAGA,YAAY,GAAW,GAAoB;EAC1C,OAAO,KAAK,SAAS,GAAG,CAAC,KAAK,KAAK,UAAU,IAAI,KAAK,QAAQ,OAAO;CACtE;;CAGA,OAAO,GAAW,GAAoB;EACrC,OAAO,KAAK,YAAY,GAAG,CAAC,KAAK,KAAK,SAAS,IAAI,KAAK,QAAQ,OAAO;CACxE;;CAGA,QAAQ,GAAW,GAAW,GAAW,GAAqC;EAC7E,OAAO,cAAc,GAAG,GAAG,GAAG,CAAC;CAChC;;CAGA,SAAS,OAAe,OAAe,GAAW,GAAoB;EACrE,IAAI,MAAM;EACV,IAAI,MAAM;EACV,KAAK,IAAI,IAAI,OAAO,IAAI,QAAQ,GAAG,KAClC,KAAK,IAAI,IAAI,OAAO,IAAI,QAAQ,GAAG,KAClC,IAAI,CAAC,KAAK,OAAO,GAAG,CAAC,GAAG,OAAO;EAGjC,KAAK,IAAI,IAAI,OAAO,KAAK,QAAQ,GAAG,KACnC,KAAK,IAAI,IAAI,OAAO,KAAK,QAAQ,GAAG,KAAK;GACxC,MAAM,IAAI,KAAK,QAAQ,aAAa,GAAG,CAAC;GACxC,IAAI,IAAI,KAAK,MAAM;GACnB,IAAI,IAAI,KAAK,MAAM;EACpB;EAED,OAAO,MAAM,OAAO,KAAM,KAAK,IAAI,GAAG,CAAC,IAAI;CAC5C;;CAGA,OAAO,OAAe,OAAe,GAAW,GAAW,IAAkB;EAC5E,KAAK,IAAI,IAAI,OAAO,IAAI,QAAQ,GAAG,KAClC,KAAK,IAAI,IAAI,OAAO,IAAI,QAAQ,GAAG,KAClC,IAAI,KAAK,SAAS,GAAG,CAAC,GAAG,KAAK,SAAS,IAAI,KAAK,QAAQ,KAAK;CAGhE;;CAGA,QAAQ,OAAe,OAAe,GAAW,GAAW,IAAkB;EAC7E,KAAK,IAAI,IAAI,OAAO,IAAI,QAAQ,GAAG,KAClC,KAAK,IAAI,IAAI,OAAO,IAAI,QAAQ,GAAG,KAClC,IAAI,KAAK,SAAS,GAAG,CAAC,KAAK,KAAK,SAAS,IAAI,KAAK,QAAQ,OAAO,IAAI,KAAK,SAAS,IAAI,KAAK,QAAQ,KAAK;CAG5G;AACD"}

package/dist/ground.d.ts

@@ -14,8 +14,11 @@ export type SavedGround = TerrainSave | GroundChanges;
 export interface GroundChanges {
     /** The map it started as, by its name (`GameMap.name`) and a hash of the ground it makes (`groundHash`) */
     map: string;
+    /** A hash of the ground the map makes, which tells the ground of a save or a welcome is the one it was taken from */
     hash: string;
+    /** The ground's width in cells */
     width: number;
+    /** The ground's depth in cells */
     depth: number;
     /** For each layer that changed: which cells (packed as 32-bit numbers), and what each holds now */
     changes: Partial<Record<GroundLayer, {
@@ -38,7 +41,11 @@ export interface GroundChanges {
     };
 }
 declare const LAYERS: readonly ['heights', 'levels', 'water', 'waterHeights', 'tiles', 'blocked'];
-/** @beta */
+/**
+ * A layer of the ground that can change: `heights`, `levels`, `water`, `waterHeights`, `tiles` or `blocked`
+ *
+ * @beta
+ */
 export type GroundLayer = (typeof LAYERS)[number];
 /**
  * Whether a save's ground is the changes of a map, not the whole of it
@@ -58,9 +65,11 @@ export declare function groundHash(terrain: Terrain): string;
  * @beta
  */
 export interface GroundBase {
+    /** The name of the map the ground started as (`GameMap.name`) */
     map: string;
     /** A hash of the ground (`groundHash`): worked out the first time it is asked for */
     readonly hash: string;
+    /** The ground itself, with the changes of play not yet laid on it */
     terrain: Terrain;
 }
 /**
@@ -73,16 +82,23 @@ export interface GroundBase {
 export interface TerrainPatch {
     /** The first cell, and how many across and down */
     x: number;
+    /** The patch's first cell on the z axis, in cells */
     z: number;
+    /** How many cells across the patch is */
     width: number;
+    /** How many cells down the patch is */
     depth: number;
     /** Per vertex, row by row: `(width + 1) * (depth + 1)` of them */
     heights: number[];
+    /** Heights of the water at the patch's vertices, in the order of `heights` */
     waterHeights: number[];
     /** Per cell, row by row: `width * depth` of them */
     levels: number[];
+    /** Per cell, the water there (0 for none) */
     water: number[];
+    /** Per cell, the tile there (an index into the game's tiles) */
     tiles: number[];
+    /** Per cell, whether the cell is blocked for walking (0 for no) */
     blocked: number[];
     /** The game's layers of cells (`Terrain.cells`), by id, per cell: those in either ground */
     cells?: Record<string, number[]>;