@v12-engine/engine 0.1.1 → 0.4.0

package/dist/systems/movement.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"movement.js","names":[],"sources":["../../src/systems/movement.ts"],"sourcesContent":["import { distanceToEdge, edgeDistance, type Entity } from '#engine/entity'\nimport { closestPointOnRect, dist, rotateTowards, type Vec2 } from '#engine/math'\nimport type { AgentState, Navigation } from '#engine/navigation/navigation'\nimport type { System } from '#engine/registry'\nimport type { World } from '#engine/world'\nimport { spotFor } from '#engine/engagement'\nimport { atan2, hypot } from '#engine/exactMath'\nimport { type MovementState, moving, fighting } from '../entity'\nimport { isPhasing } from '#engine/abilities/buffs'\n\n/**\n * How close to a point counts as having reached it\n *\n * @internal\n */\nexport const ARRIVE_RANGE = 0.2\n\n/** How fast a unit turns, in radians a second: its type's `turnRate`, else the game's (`RuleSettings.movement.turnRate`) */\nconst turnRateOf = (world: World, entity: Entity): number => entity.def.turnRate ?? world.settings.movement.turnRate\n\n/**\n * Options for a move order given by code: arrival range, group, facing to end on and whether it is a step aside\n *\n * @beta\n */\nexport interface MoveOptions {\n\t/** Arrive once this close to the goal. `ARRIVE_RANGE` when left out */\n\trange?: number\n\t/**\n\t * The id of the group ordered to move together (0 for none): a unit bumping into a group mate that already arrived\n\t * on the point it goes to stops rather than push it, and those of a formation (`MovementState.formation`) keep\n\t * their places\n\t */\n\tgroupId?: number\n\t/** Direction to turn to after arriving */\n\tfacing?: number\n\t/**\n\t * A step aside for another (`stepAside`), or any short move that is nobody's business: the unit goes round nobody,\n\t * and asks those in its way aside only once held up, and only a few deep (`MovementState.asideDepth`), so that one\n\t * step does not set off the next through a whole crowd\n\t */\n\taside?: boolean\n}\n\n/**\n * Point a unit should walk to in order to reach the target: next to its edge for structures, its spot around it for\n * one fighting it (see `engagement.ts`)\n */\nexport function approachPoint(world: World, entity: Entity, target: Entity): Vec2 {\n\t// what flies goes right over it\n\tif (entity.flying) return target.pos\n\tif (target.def.footprint) return closestPointOnRect(entity.pos, target.rect, entity.def.radius + 0.15)\n\treturn entity.get(fighting)?.engaged === target.id ? spotFor(world, entity, target) : target.pos\n}\n\n/**\n * How far along its route a unit is sent at a time (`Rules.paths: 'seen'`): as far as it sees, between 4 and 12.\n * The navigation finds its way over that stretch with every building in it; one that changes the way is in sight, so\n * its side sees it, and the route is planned again with it\n */\nconst stretchOf = (entity: Entity): number => Math.min(Math.max(entity.def.sight ?? 8, 4), 12)\n\n/** The team whose knowledge a ground unit's route is planned with, or none where routes know everything */\n/** The movement of a unit this system runs for: it picks those that have one, so a unit without is a fault, said as such */\nfunction movementOf(entity: Entity): MovementState {\n\tconst m = entity.get(moving)\n\tif (!m) throw new Error(`${entity.def.id} ${entity.id} is moved but has no movement`)\n\treturn m\n}\n\nfunction sideOf(world: World, entity: Entity): number | undefined {\n\tconst paths = world.sidePaths\n\tif (!paths || entity.flying || entity.def.naval) return undefined\n\tconst team = world.player(entity.owner).team\n\treturn paths.has(team) ? team : undefined\n}\n\n/** Plans a unit's route to its goal with what its side knows: none where its side knows no way, or the goal is in sight */\nfunction planRoute(world: World, entity: Entity, team: number): void {\n\tconst m = movementOf(entity)\n\t// (planned only for a team `sideOf` found paths for)\n\tconst paths = world.sidePaths\n\tif (!paths) return\n\tm.routeVersion = paths.version(team)\n\tm.routeAt = 1\n\t// a goal within sight is walked to as it is: all of the way there is in sight (a melee spot, a step aside)\n\tif (dist(entity.pos, m.navGoal) <= stretchOf(entity)) {\n\t\tm.route = undefined\n\t\treturn\n\t}\n\tconst route = paths.route(team, entity.pos, m.navGoal)\n\tm.route = route && route.length > 1 ? route.map(({ x, z }) => ({ x, z })) : undefined\n}\n\n/** How far a point is from a segment */\nfunction distToSegment(p: Vec2, a: Vec2, b: Vec2): number {\n\tconst dx = b.x - a.x\n\tconst dz = b.z - a.z\n\tconst length = dx * dx + dz * dz\n\tconst t = length > 0 ? Math.min(Math.max(((p.x - a.x) * dx + (p.z - a.z) * dz) / length, 0), 1) : 0\n\treturn hypot(p.x - (a.x + dx * t), p.z - (a.z + dz * t))\n}\n\n/** The point a stretch ahead of a unit along its route; its goal itself once that is within the stretch */\nfunction stretchPoint(entity: Entity): Vec2 {\n\tconst m = movementOf(entity)\n\tconst route = m.route\n\tif (!route) return m.navGoal\n\t// where along the route it is: the leg nearest it, from where it was on, and the corner that leg ends at next. A\n\t// unit pushed aside, or cutting a corner, is on the route where it is nearest it\n\tlet leg = Math.max((m.routeAt ?? 1) - 1, 0)\n\tlet nearest = Infinity\n\tfor (let i = leg; i < route.length - 1; i++) {\n\t\tconst d = distToSegment(entity.pos, route[i], route[i + 1])\n\t\tif (d < nearest - 1e-9) {\n\t\t\tnearest = d\n\t\t\tleg = i\n\t\t}\n\t}\n\tconst at = Math.min(leg + 1, route.length - 1)\n\tm.routeAt = at\n\tlet left = stretchOf(entity)\n\tlet from: Vec2 = entity.pos\n\tfor (let i = at; i < route.length; i++) {\n\t\tconst length = dist(from, route[i])\n\t\tif (length >= left) {\n\t\t\tconst t = left / length\n\t\t\treturn { x: from.x + (route[i].x - from.x) * t, z: from.z + (route[i].z - from.z) * t }\n\t\t}\n\t\tleft -= length\n\t\tfrom = route[i]\n\t}\n\treturn m.navGoal\n}\n\n/** Sends the navigation where the unit is to walk now: its goal, or a stretch along its route */\nfunction walk(world: World, entity: Entity): boolean {\n\tconst m = movementOf(entity)\n\tconst to = m.route ? stretchPoint(entity) : m.navGoal\n\tm.stretch = m.route ? { x: to.x, z: to.z } : undefined\n\treturn world.nav.setDestination(entity.id, to)\n}\n\n/** Sends a walking unit on as it was, after something held it (a builder waiting for room): its stretch, or its goal */\nexport function walkOn(world: World, entity: Entity): void {\n\tif (entity.get(moving)?.status === 'moving') walk(world, entity)\n}\n\nfunction beginMove(world: World, entity: Entity, navGoal: Vec2): void {\n\tconst m = movementOf(entity)\n\tm.bestDistance = Infinity\n\tm.finalFacing = null\n\tm.stalledTime = 0\n\tm.slowTime = 0\n\tm.detour = undefined\n\tdelete m.tries\n\tdelete m.triedAt\n\tm.navGoal.x = navGoal.x\n\tm.navGoal.z = navGoal.z\n\tm.navVersion = world.nav.version\n\tm.stuck = false\n\tif (m.anchored) {\n\t\tm.anchored = false\n\t\tworld.nav.setAnchored(entity.id, false)\n\t}\n\tconst team = sideOf(world, entity)\n\tif (team === undefined) m.route = undefined\n\telse planRoute(world, entity, team)\n\tm.status = walk(world, entity) ? 'moving' : 'failed'\n}\n\n/**\n * Sends a unit walking to a point, the way around what is in the way. How it goes is in `entity.movement.status`:\n * `moving` on the way, `arrived` once there, `failed` when there is no way there or it got stuck. Held up by others\n * it tries again a few times before it gives up (`MovementState.tries`). An order calls this once and then watches the\n * status; calling it again with the same goal starts the walk over\n *\n * @beta\n */\nexport function moveTo(world: World, entity: Entity, goal: Vec2, options: MoveOptions = {}): void {\n\tconst m = entity.get(moving)\n\tif (!m || entity.hidden) return\n\tm.goal.x = goal.x\n\tm.goal.z = goal.z\n\tm.goalEntity = 0\n\tm.range = options.range ?? ARRIVE_RANGE\n\tm.groupId = options.groupId ?? 0\n\tm.aside = options.aside || undefined\n\tdelete m.asideDepth\n\t// a move of its own: off its place in the formation it went to, for good (a step aside comes back to it)\n\tif (!options.aside) leavePlace(m)\n\tbeginMove(world, entity, goal)\n\tm.finalFacing = options.facing ?? null\n}\n\n/**\n * Walks towards an entity until within `range` of its edge. Safe to call every tick.\n *\n * @beta\n */\nexport function moveToEntity(world: World, entity: Entity, target: Entity, range: number): void {\n\tconst m = entity.get(moving)\n\tif (!m || entity.hidden) return\n\tif (m.status === 'moving' && m.goalEntity === target.id && m.range === range) return\n\tm.goalEntity = target.id\n\tm.range = range\n\tm.groupId = 0\n\tm.aside = undefined\n\tleavePlace(m)\n\tbeginMove(world, entity, approachPoint(world, entity, target))\n}\n\n/**\n * Whether the unit is on its way to this very point\n *\n * @internal\n */\nexport function isMovingTo(entity: Entity, goal: Vec2): boolean {\n\tconst m = entity.get(moving)\n\treturn !!m && m.status === 'moving' && m.goalEntity === 0 && m.goal.x === goal.x && m.goal.z === goal.z\n}\n\n/**\n * Stops a unit where it is. Its status is `idle` after\n *\n * @beta\n */\nexport function halt(world: World, entity: Entity): void {\n\tconst m = entity.get(moving)\n\tif (!m) return\n\tif (m.status === 'moving') world.nav.clearDestination(entity.id)\n\tm.status = 'idle'\n\tm.goalEntity = 0\n\tm.groupId = 0\n\tm.detour = undefined\n}\n\n/** A unit that walks off on a move of its own: it has no place to go back to (`MovementState.place`) */\nfunction leavePlace(m: MovementState): void {\n\tdelete m.place\n\tdelete m.backTries\n}\n\n/**\n * Marks a unit as one of a formation sent to its places (`orderCommand`, with the order's group): it keeps the place it\n * gets to (`MovementState.place`). Without a group, it is of none: given another order, it keeps no place\n *\n * @internal\n */\nexport function joinFormation(entity: Entity, groupId = 0): void {\n\tconst m = entity.get(moving)\n\tif (!m) return\n\tleavePlace(m)\n\tif (groupId) m.formation = groupId\n\telse delete m.formation\n}\n\n/**\n * Anchored units stand their ground instead of being pushed around by units walking past.\n *\n * @beta\n */\nexport function setAnchored(world: World, entity: Entity, anchored: boolean): void {\n\tconst m = entity.get(moving)\n\tif (!m || m.anchored === anchored) return\n\tif (anchored && m.status === 'moving') halt(world, entity)\n\tm.anchored = anchored\n\tworld.nav.setAnchored(entity.id, anchored)\n}\n\n/**\n * Ghosts walk through other units. Classic RTS games do this for workers hauling resources so mining never jams.\n *\n * @beta\n */\nexport function setGhost(world: World, entity: Entity, ghost: boolean): void {\n\tconst m = entity.get(moving)\n\tif (!m || m.ghost === ghost) return\n\tm.ghost = ghost\n\t// one that phases (`BuffDef.phasing`) on a navigation that cannot have it do so stays a ghost while it does\n\tworld.nav.setGhost(entity.id, ghost || (!world.nav.setPhasing && !!m.phased))\n}\n\n/**\n * Units that carry a buff that has them walk through others (`BuffDef.phasing`) phase on the navigation while they do\n * (`Navigation.setPhasing`: on a crowd of their own, nobody's neighbour), and are not gone round nor asked aside.\n * Walls, cliffs, buildings and trees are the navigation's ground, and stop them all the same\n */\nfunction seeToPhasing(world: World): void {\n\tfor (const entity of world.index.with(moving)) {\n\t\tconst m = entity.get(moving)\n\t\tif (!m) continue\n\t\tconst phasing = entity.buffs.length > 0 && entity.alive && !entity.hidden && isPhasing(world, entity)\n\t\tif (phasing === !!m.phased) continue\n\t\tif (phasing) m.phased = true\n\t\telse delete m.phased\n\t\tif (world.nav.setPhasing) world.nav.setPhasing(entity.id, phasing)\n\t\telse world.nav.setGhost(entity.id, phasing || m.ghost)\n\t}\n}\n\n/**\n * Turns a unit a little towards a point, as far as it turns in `dt` seconds (its type's `turnRate`, else the game's:\n * `RuleSettings.movement.turnRate`). For orders that aim at something\n *\n * @beta\n */\nexport function faceTowards(world: World, entity: Entity, point: Vec2, dt: number): void {\n\tconst m = entity.get(moving)\n\tif (m) m.finalFacing = null\n\tconst desired = atan2(point.x - entity.pos.x, point.z - entity.pos.z)\n\tentity.facing = rotateTowards(entity.facing, desired, turnRateOf(world, entity) * dt)\n}\n\nfunction arrive(world: World, entity: Entity): void {\n\tworld.nav.clearDestination(entity.id)\n\tconst m = movementOf(entity)\n\tm.status = 'arrived'\n\tm.stalledTime = 0\n\t// at its place in a formation: it goes back there once stepped aside, or pushed off it. Its place even where it\n\t// stopped short of it, another standing there: once that one is gone to its own, it goes there\n\tif (m.groupId && m.formation === m.groupId && !m.aside && !m.goalEntity) {\n\t\tm.place = { x: m.goal.x, z: m.goal.z }\n\t\t// there: it has its tries to go back again. Stopped short, a walk back (`backToPlace`) spent one\n\t\tif (dist(entity.pos, m.place) <= PLACE_OFF) delete m.backTries\n\t} else if (m.place && dist(entity.pos, m.place) <= PLACE_OFF) delete m.backTries\n}\n\n/** True when the unit is bumping into a member of its own group that already reached its spot. */\nfunction blockedByArrivedGroupMate(world: World, entity: Entity): boolean {\n\tconst m = movementOf(entity)\n\tif (!m.groupId) return false\n\tworld.spatial.query(entity.pos.x, entity.pos.z, entity.def.radius + 1, neighbours)\n\tfor (const other of neighbours) {\n\t\tconst om = other.get(moving)\n\t\tif (other === entity || !om || other.flying !== entity.flying) continue\n\t\tif (om.groupId !== m.groupId || om.status !== 'arrived') continue\n\t\tif (distanceToEdge(entity.pos, other) - entity.def.radius < 0.25) return true\n\t}\n\treturn false\n}\n\n/** Seconds a unit has to be held up before the ones in its way are asked to move */\nconst MAKE_WAY_AFTER = 0.2\n/** How many asked aside in turn, each by the one before held up on its step: the first by the mover, the next by it */\nconst ASIDE_DEPTH = 3\n/** Ticks between two requests by the same unit */\nconst MAKE_WAY_INTERVAL = 8\n/** Ticks between two looks ahead by the same unit, for units standing in its way */\nconst LOOK_AHEAD_INTERVAL = 4\n/** Room a unit keeps between itself and the units it goes round, past touching them */\nconst DETOUR_CLEARANCE = 0.3\n/**\n * How far past the point beside a knot a unit going round it is sent on, towards its corner, once it is nearly there\n * (`DETOUR_PAST_AT`): an agent slows down as it comes to where it was sent, and this way it is on its way again, at\n * speed, before that\n */\nconst DETOUR_PAST = 1.5\nconst DETOUR_PAST_AT = 1.2\n/** Under this part of its speed, a unit on its way counts as held up */\nconst SLOW_PART = 0.6\n/** How far round the point ahead a unit held up a while looks for those standing together in its way */\nconst HELD_REACH = 10\n/** Units standing in a knot past this many are not gone round: the way round them is for the path to find */\nconst KNOT_MOST = 24\n/**\n * As many as a unit held up a while takes in, as it looks again (`tryAgain`): then it goes round however many\n * stand together, however long the way round, where there is one\n */\nconst KNOT_HELD = 160\n/** The most a knot is grown to on this look: `KNOT_MOST`, or `KNOT_HELD` for a unit held up a while */\nlet knotMost = KNOT_MOST\n\n/**\n * Whether another unit stands in a mover's way: there, standing still, and on the same crowd, where each steers\n * round the other and neither walks through. What moves is steered round by the navigation; what is a ghost is walked\n * through; what flies or sails goes its own way. What the mover walks to, or stands where it is\n * going, is not in its way either: it stops by it, close enough (a follower by the one it follows, a unit sent where\n * another stands), rather than send it off\n *\n * @beta\n */\nexport function standsInWay(world: World, mover: Entity, other: Entity): boolean {\n\tconst om = other.get(moving)\n\tif (other === mover || !om || other.hidden || !other.alive) return false\n\tif (om.status === 'moving' || om.ghost || om.phased) return false\n\tconst m = mover.get(moving)\n\t// one that walks through others has nobody in its way\n\tif (m?.phased) return false\n\tif (m && (other.id === m.goalEntity || hypot(other.pos.x - m.navGoal.x, other.pos.z - m.navGoal.z) < m.range + mover.def.radius + other.def.radius))\n\t\treturn false\n\treturn world.nav.sameCrowd?.(mover.id, other.id) ?? true\n}\n\n/** How far a point is from a segment */\nfunction segmentDistance(px: number, pz: number, ax: number, az: number, bx: number, bz: number): number {\n\tconst dx = bx - ax\n\tconst dz = bz - az\n\tconst length = dx * dx + dz * dz\n\tconst t = length > 0 ? Math.min(Math.max(((px - ax) * dx + (pz - az) * dz) / length, 0), 1) : 0\n\treturn hypot(px - (ax + dx * t), pz - (az + dz * t))\n}\n\nconst probe: Vec2 = { x: 0, z: 0 }\n\n/** Whether the navigation has walkable ground at a point: its nearest such point is no further than a hair */\nfunction walkableAt(nav: Navigation, x: number, z: number): boolean {\n\tprobe.x = x\n\tprobe.z = z\n\tconst snapped = nav.closestPoint(probe, 1)\n\treturn !!snapped && hypot(snapped.x - x, snapped.z - z) <= 0.3\n}\n\n/**\n * Where an ally in a mover's way steps to: aside, off the mover's way, the shorter way out of it first. The way is the\n * leg the mover is on, to its corner, and the leg after (`agent.nx`): a step off the first onto the second, round a\n * building's corner, would be no step at all. Where a side is not to be stood on (a wall), the other; where neither,\n * nowhere\n */\nfunction asidePoint(world: World, mover: Entity, other: Entity, dx: number, dz: number, agent: AgentState): Vec2 | null {\n\tconst rx = other.pos.x - mover.pos.x\n\tconst rz = other.pos.z - mover.pos.z\n\tconst reach = mover.def.radius + other.def.radius\n\tconst clear = reach + 0.5\n\t// distance from the line the mover wants to walk\n\tconst offset = rx * dz - rz * dx\n\tconst first = Math.abs(offset) > 0.05 ? Math.sign(offset) : other.id % 2 ? 1 : -1\n\tconst nav = world.navFor(other)\n\tconst { pos } = mover\n\tlet taken: Vec2 | null = null\n\t// for one standing about with nothing to do; one waiting by a fight steps where it is told, to stay near it\n\tconst free = other.orders.length === 0\n\tfor (let pass = 0; pass < 2; pass++) {\n\t\tconst side = pass === 0 ? first : -first\n\t\t// as far as it takes to be off both legs, in steps, not past a few of them\n\t\tfor (let step = clear - Math.abs(offset); step <= clear * 3; step += 0.5) {\n\t\t\tconst x = other.pos.x + dz * side * step\n\t\t\tconst z = other.pos.z - dx * side * step\n\t\t\tif (segmentDistance(x, z, pos.x, pos.z, agent.cx, agent.cz) < clear - 0.05) continue\n\t\t\tif (segmentDistance(x, z, agent.cx, agent.cz, agent.nx, agent.nz) < clear - 0.05) continue\n\t\t\tif (!walkableAt(nav, x, z)) break\n\t\t\t// room there, rather than onto another standing about (a step onto one has it pushed, or asked on, in turn)\n\t\t\tif (free && !roomFor(world, other, mover, x, z)) {\n\t\t\t\ttaken ??= { x, z }\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\treturn { x, z }\n\t\t}\n\t}\n\treturn taken\n}\n\nconst roomNear: Entity[] = []\n\n/** Whether a unit stepping aside has room at a point: nobody else stands there, nor steps aside onto it */\nfunction roomFor(world: World, entity: Entity, mover: Entity, x: number, z: number): boolean {\n\tworld.spatial.query(x, z, entity.def.radius + 1, roomNear)\n\tfor (const other of roomNear) {\n\t\tif (other === entity || other === mover || other.hidden || other.flying !== entity.flying) continue\n\t\tconst om = other.get(moving)\n\t\tif (!om || om.ghost || om.phased) continue\n\t\tconst room = entity.def.radius + other.def.radius - 0.05\n\t\tif (om.status !== 'moving' && hypot(other.pos.x - x, other.pos.z - z) < room) return false\n\t\tif (om.aside && om.status === 'moving' && hypot(om.goal.x - x, om.goal.z - z) < room) return false\n\t}\n\treturn true\n}\n\n/**\n * Asks an ally standing in a unit's way to step aside, as the rules allow (`RuleSettings.movement.makesWay`, the `makeWay` hook).\n * `direction` is the way the unit is heading, a unit long; `agent` where its path goes, for the step to be off it.\n * True when it goes\n *\n * @beta\n */\nexport function stepAside(world: World, mover: Entity, other: Entity, direction: Vec2, agent: AgentState): boolean {\n\tconst om = other.get(moving)\n\tif (!om || !world.areAllies(mover.owner, other.owner) || !world.settings.movement.makesWay(world, mover, other)) return false\n\tconst m = mover.get(moving)\n\t// nor for one of its group: those of a formation pass places on (`passOn`), and swap or trade them (`swapPlaces`,\n\t// `tradeGoals`), rather than step aside for each other\n\tif (m?.groupId && (om.groupId === m.groupId || om.formation === m.groupId)) return false\n\tlet point = asidePoint(world, mover, other, direction.x, direction.z, agent)\n\tif (world.hooks.has('makeWay')) point = world.hooks.run('makeWay', { mover, other, direction, point }).point\n\tif (!point) return false\n\tmoveTo(world, other, point, { facing: om.finalFacing ?? other.facing, aside: true })\n\t// asked by one stepping aside itself: a step further down the line, which ends (`ASIDE_DEPTH`)\n\tif (m?.aside) om.asideDepth = (m.asideDepth ?? 1) + 1\n\treturn true\n}\n\nconst neighbours: Entity[] = []\nconst inWay: Entity[] = []\nconst knot: Entity[] = []\n/**\n * What each of `neighbours` is to the unit looking ahead, by its index: not asked yet, clear, standing in its way, or in\n * the knot. In a blob every member of the knot looks over every neighbour: `standsInWay` asked once each, and a mark\n * rather than `knot.includes`, keep that from being a good part of the tick\n */\nlet standing = new Uint8Array(256)\n/**\n * Where each of `neighbours` stands and how wide it is, by its index, read off it once as a knot is grown: the knot\n * goes over the neighbours again for each of its members, and numbers side by side are read faster than each unit's\n * place and type are got at again (nobody moves while the knot is grown)\n */\nlet nearX = new Float64Array(256)\nlet nearZ = new Float64Array(256)\nlet nearRadius = new Float64Array(256)\n/** The index in `neighbours` of each member of the knot, as it is grown from them */\nlet knotAt = new Int32Array(256)\n/** Those a member of the knot takes in, by their index in `neighbours`, in order */\nlet joined = new Int32Array(256)\n/**\n * The neighbours filed by cells a metre wide (`fileNear`): the cell of each, and the indices of those in each cell, in\n * order, from `cellStart[cell]` to `cellStart[cell + 1]`; the corner the cells start from, how many there are across\n * and down, and the widest neighbour\n */\nlet cellItems = new Int32Array(256)\nlet cellStart = new Int32Array(257)\nlet cellFill = new Int32Array(257)\nlet nearCell = new Int32Array(256)\nlet nearMinX = 0\nlet nearMinZ = 0\nlet nearCols = 0\nlet nearRows = 0\nlet nearWidest = 0\n\n/**\n * Files the `count` neighbours (`nearX`, `nearZ`, `nearRadius`) by cells a metre wide, for the knot to find those\n * against each member among a few of them. False, and nothing filed, where it would take more cells than it is worth\n * (a few neighbours far apart), or a place or a radius is no number\n */\nfunction fileNear(count: number): boolean {\n\tlet minX = Infinity\n\tlet minZ = Infinity\n\tlet maxX = -Infinity\n\tlet maxZ = -Infinity\n\tlet widest = 0\n\t// NaN, should a place or a radius be none\n\tlet sum = 0\n\tfor (let j = 0; j < count; j++) {\n\t\tconst x = nearX[j]\n\t\tconst z = nearZ[j]\n\t\tsum += x + z + nearRadius[j]\n\t\tif (x < minX) minX = x\n\t\tif (x > maxX) maxX = x\n\t\tif (z < minZ) minZ = z\n\t\tif (z > maxZ) maxZ = z\n\t\tif (nearRadius[j] > widest) widest = nearRadius[j]\n\t}\n\tconst cols = Math.floor(maxX - minX) + 1\n\tconst rows = Math.floor(maxZ - minZ) + 1\n\tconst cells = cols * rows\n\tif (Number.isNaN(sum) || !(cells <= count * 4)) return false\n\tif (cellStart.length < cells + 1) {\n\t\tcellStart = new Int32Array((cells + 1) * 2)\n\t\tcellFill = new Int32Array((cells + 1) * 2)\n\t}\n\tcellStart.fill(0, 0, cells + 1)\n\tfor (let j = 0; j < count; j++) {\n\t\tconst cell = Math.floor(nearZ[j] - minZ) * cols + Math.floor(nearX[j] - minX)\n\t\tnearCell[j] = cell\n\t\tcellStart[cell + 1]++\n\t}\n\tfor (let cell = 0; cell < cells; cell++) cellStart[cell + 1] += cellStart[cell]\n\tcellFill.set(cellStart.subarray(0, cells))\n\tfor (let j = 0; j < count; j++) cellItems[cellFill[nearCell[j]]++] = j\n\tnearMinX = minX\n\tnearMinZ = minZ\n\tnearCols = cols\n\tnearRows = rows\n\tnearWidest = widest\n\treturn true\n}\n\n/**\n * Grows the knot of the unit looking ahead (`lookAhead`) from those in its way (`knot`, `knotAt`): each member in turn\n * takes in the neighbours that stand against it, in their order, until the knot is too big to go round. Those against\n * a member are looked for in the cells round it (`fileNear`), as far as it reaches the widest neighbour: one further\n * off touches it not. Where the neighbours are not filed, among them all\n */\nfunction growKnot(world: World, entity: Entity, count: number): void {\n\tfor (let i = 0; i < count; i++) {\n\t\tconst other = neighbours[i]\n\t\tnearX[i] = other.pos.x\n\t\tnearZ[i] = other.pos.z\n\t\tnearRadius[i] = other.def.radius\n\t}\n\tconst filed = fileNear(count)\n\tfor (let i = 0; i < knot.length && knot.length < knotMost; i++) {\n\t\tconst member = knotAt[i]\n\t\tconst memberX = nearX[member]\n\t\tconst memberZ = nearZ[member]\n\t\tconst memberRadius = nearRadius[member]\n\t\tlet added = 0\n\t\tconst take = (j: number): void => {\n\t\t\tconst mark = standing[j]\n\t\t\tif (mark === KNOTTED || mark === CLEAR) return\n\t\t\tif (hypot(nearX[j] - memberX, nearZ[j] - memberZ) >= memberRadius + nearRadius[j] + 0.3) return\n\t\t\tif (!standsThere(world, entity, j)) return\n\t\t\tstanding[j] = KNOTTED\n\t\t\t// in the order of the neighbours, as one look over them all finds them\n\t\t\tlet place = added++\n\t\t\tfor (; place > 0 && joined[place - 1] > j; place--) joined[place] = joined[place - 1]\n\t\t\tjoined[place] = j\n\t\t}\n\t\tif (filed) {\n\t\t\t// as far as it touches the widest, and a hair for what rounding takes off a distance\n\t\t\tconst touch = memberRadius + nearWidest + 0.3 + 0.01\n\t\t\tconst fromCol = Math.max(Math.floor(memberX - touch - nearMinX), 0)\n\t\t\tconst toCol = Math.min(Math.floor(memberX + touch - nearMinX), nearCols - 1)\n\t\t\tconst fromRow = Math.max(Math.floor(memberZ - touch - nearMinZ), 0)\n\t\t\tconst toRow = Math.min(Math.floor(memberZ + touch - nearMinZ), nearRows - 1)\n\t\t\t// the cells of a row, along it, are one stretch of `cellItems`\n\t\t\tfor (let row = fromRow; row <= toRow; row++)\n\t\t\t\tfor (let k = cellStart[row * nearCols + fromCol], end = cellStart[row * nearCols + toCol + 1]; k < end; k++) take(cellItems[k])\n\t\t} else for (let j = 0; j < count; j++) take(j)\n\t\tfor (let k = 0; k < added; k++) {\n\t\t\tknotAt[knot.length] = joined[k]\n\t\t\tknot.push(neighbours[joined[k]])\n\t\t}\n\t}\n}\nconst UNASKED = 0\nconst CLEAR = 1\nconst STANDING = 2\nconst KNOTTED = 3\nconst direction: Vec2 = { x: 0, z: 0 }\nconst agent: AgentState = { x: 0, z: 0, vx: 0, vz: 0, cx: 0, cz: 0, nx: 0, nz: 0 }\n\n/**\n * Asks friendly units that are standing around in front of a unit to step aside.\n * Avoidance alone cannot get a unit out of a tight group of idle ones: they would have to move, and nothing tells them to.\n *\n * @beta\n */\nexport function makeWay(world: World, entity: Entity): void {\n\tconst m = movementOf(entity)\n\tif (!world.nav.readAgent(entity.id, agent)) return\n\tconst to = m.detour ?? m.navGoal\n\tlet dx = to.x - entity.pos.x\n\tlet dz = to.z - entity.pos.z\n\tconst length = hypot(dx, dz)\n\tif (length < 0.01) return\n\tdx /= length\n\tdz /= length\n\tdirection.x = dx\n\tdirection.z = dz\n\n\tworld.spatial.query(entity.pos.x, entity.pos.z, entity.def.radius + 1.5, neighbours)\n\t// those against it, picked out before any is asked: moving others changes the list the query hands out. Mostly\n\t// there are none, and nothing is made\n\tlet against: Entity[] | undefined\n\tfor (const other of neighbours) {\n\t\tconst rx = other.pos.x - entity.pos.x\n\t\tconst rz = other.pos.z - entity.pos.z\n\t\tconst reach = entity.def.radius + other.def.radius\n\t\tconst ahead = rx * dx + rz * dz\n\t\tif (ahead < -0.1 || ahead > reach + 1) continue\n\t\t// against it, not beside it\n\t\tconst offset = rx * dz - rz * dx\n\t\tif (Math.abs(offset) > reach) continue\n\t\tagainst ??= []\n\t\tagainst.push(other)\n\t}\n\tif (!against) return\n\tfor (const other of against) if (standsInWay(world, entity, other)) stepAside(world, entity, other, direction, agent)\n}\n\n/** Whether a unit walking a segment would touch any of the knot */\nfunction segmentClear(radius: number, ax: number, az: number, bx: number, bz: number): boolean {\n\tfor (const other of knot) {\n\t\tif (segmentDistance(other.pos.x, other.pos.z, ax, az, bx, bz) < radius + other.def.radius + 0.05) return false\n\t}\n\treturn true\n}\n\nconst wayFrom: Vec2 = { x: 0, z: 0 }\nconst wayTo: Vec2 = { x: 0, z: 0 }\n\n/**\n * Whether the way from a point to another is straight, as far as the navigation is concerned: its path is no longer\n * than the line, give or take. A way round a knot that bends round a building is no way round the knot\n */\nfunction straightWay(nav: Navigation, fromX: number, fromZ: number, toX: number, toZ: number): boolean {\n\tconst from = wayFrom\n\tconst to = wayTo\n\tfrom.x = fromX\n\tfrom.z = fromZ\n\tto.x = toX\n\tto.z = toZ\n\tconst path = nav.findPath(from, to)\n\tif (!path || path.length === 0) return false\n\tlet length = dist(from, path[0])\n\tfor (let i = 1; i < path.length; i++) length += dist(path[i - 1], path[i])\n\tlength += dist(path[path.length - 1], to)\n\treturn length <= dist(from, to) * 1.05 + 0.3\n}\n\nconst standingThere: Entity[] = []\n\n/**\n * Whether a unit could stand at a point: walkable there, and nobody standing on it, or stepping aside onto it. Null\n * when it could; otherwise the unit in the way there, or the mover itself for ground it cannot walk\n */\nfunction standable(world: World, nav: Navigation, entity: Entity, x: number, z: number): Entity | null {\n\tif (!walkableAt(nav, x, z)) return entity\n\tworld.spatial.query(x, z, entity.def.radius + 1, standingThere)\n\tfor (const other of standingThere) {\n\t\tif (other === entity || !other.get(moving) || other.hidden) continue\n\t\tconst room = entity.def.radius + other.def.radius + 0.05\n\t\t// on it, first: most are not, and whether one stands in the way is the more to ask\n\t\tif (hypot(other.pos.x - x, other.pos.z - z) < room && standsInWay(world, entity, other)) return other\n\t\t// on its way to stand there: a step aside for someone\n\t\tconst om = other.get(moving)!\n\t\tif (om.aside && om.status === 'moving' && hypot(om.goal.x - x, om.goal.z - z) < room) return other\n\t}\n\treturn null\n}\n\n/** Whether the neighbour at `i` stands in the way of the unit looking ahead: asked of `standsInWay` the first time only */\nfunction standsThere(world: World, entity: Entity, i: number): boolean {\n\tif (standing[i] === UNASKED) standing[i] = standsInWay(world, entity, neighbours[i]) ? STANDING : CLEAR\n\treturn standing[i] !== CLEAR\n}\n\n/**\n * Looks ahead of a unit on its way for units standing in it (within `RuleSettings.movement.lookAhead`): a way round the knot\n * they make is taken where it is not much longer (`RuleSettings.movement.goesAround`, the `detour` hook); otherwise those of\n * them that make way (`RuleSettings.movement.makesWay`) are asked to step aside before the unit reaches them. The way round is\n * beside the knot, on the side it sticks out less, at the knot's middle; the unit heads there, and on to its path\n * from there. The number of units sent to this per tick is spread by their ids (`LOOK_AHEAD_INTERVAL`)\n *\n * @beta\n */\nexport function lookAhead(world: World, entity: Entity, agent: AgentState): void {\n\tlookFurther(world, entity, agent, false)\n}\n\n/**\n * The look ahead (`lookAhead`); `held` for a unit held up a while (`tryAgain`): it looks a few cells ahead, whatever the\n * rules say, takes in the whole knot, however big, and goes round it however long the way round, where there is one\n */\nfunction lookFurther(world: World, entity: Entity, agent: AgentState, held: boolean): void {\n\tconst m = movementOf(entity)\n\tconst look = held ? Math.max(world.settings.movement.lookAhead(world, entity), 3) : world.settings.movement.lookAhead(world, entity)\n\tif (look <= 0) return\n\tknotMost = held ? KNOT_HELD : KNOT_MOST\n\tconst { pos } = entity\n\tconst radius = entity.def.radius\n\tlet dx = agent.cx - pos.x\n\tlet dz = agent.cz - pos.z\n\tconst toCorner = hypot(dx, dz)\n\tif (toCorner < radius) return\n\tdx /= toCorner\n\tdz /= toCorner\n\tconst reach = Math.min(toCorner, look)\n\n\tworld.spatial.query(pos.x + (dx * reach) / 2, pos.z + (dz * reach) / 2, reach / 2 + (held ? HELD_REACH : 3), neighbours)\n\tconst count = neighbours.length\n\tif (standing.length < count) {\n\t\tstanding = new Uint8Array(count * 2)\n\t\tnearX = new Float64Array(count * 2)\n\t\tnearZ = new Float64Array(count * 2)\n\t\tnearRadius = new Float64Array(count * 2)\n\t\tknotAt = new Int32Array(count * 2)\n\t\tjoined = new Int32Array(count * 2)\n\t\tnearCell = new Int32Array(count * 2)\n\t\tcellItems = new Int32Array(count * 2)\n\t}\n\tstanding.fill(UNASKED, 0, count)\n\tinWay.length = 0\n\tknot.length = 0\n\tfor (let i = 0; i < count; i++) {\n\t\tconst other = neighbours[i]\n\t\tconst rx = other.pos.x - pos.x\n\t\tconst rz = other.pos.z - pos.z\n\t\tconst touch = radius + other.def.radius\n\t\tconst ahead = rx * dx + rz * dz\n\t\t// ahead of it, not beside it or behind, and not past where it looks\n\t\tif (ahead < radius || ahead > reach + touch) continue\n\t\t// in its way, not merely brushed past: the navigation steers round that much\n\t\tconst offset = rx * dz - rz * dx\n\t\tif (Math.abs(offset) > touch - 0.05) continue\n\t\tif (!standsThere(world, entity, i)) continue\n\t\tstanding[i] = KNOTTED\n\t\tknotAt[inWay.length] = i\n\t\tinWay.push(other)\n\t}\n\tif (inWay.length === 0) return\n\n\t// the knot: those in the way, and those standing against them, against those...: the way round goes round it all\n\tfor (const other of inWay) knot.push(other)\n\tif (knot.length < knotMost) growKnot(world, entity, count)\n\n\tlet detour: Vec2 | null = null\n\tif (knot.length < knotMost) {\n\t\tconst nav = world.navFor(entity)\n\t\t// from the point beside the knot, on to the corner; or to the corner after it, where the knot stands at the corner\n\t\t// (against a building's corner): round the knot onto the next leg\n\t\tlet aimX = agent.cx\n\t\tlet aimZ = agent.cz\n\t\t// the knot grows by whoever stands where the way round it would go, and the way round is looked for again\n\t\tfor (let grown = 0; grown < 4 && !detour; grown++) {\n\t\t\tlet left = -Infinity\n\t\t\tlet right = Infinity\n\t\t\tlet along = 0\n\t\t\tfor (const other of knot) {\n\t\t\t\tconst rx = other.pos.x - pos.x\n\t\t\t\tconst rz = other.pos.z - pos.z\n\t\t\t\tconst offset = rx * dz - rz * dx\n\t\t\t\tleft = Math.max(left, offset + other.def.radius)\n\t\t\t\tright = Math.min(right, offset - other.def.radius)\n\t\t\t\talong += rx * dx + rz * dz\n\t\t\t}\n\t\t\talong = Math.max(along / knot.length, radius)\n\t\t\t// the side it sticks out less on first, then the other, each pushed further out while the way there touches it\n\t\t\tconst leftFirst = Math.abs(left) <= Math.abs(right)\n\t\t\tlet blocker: Entity | null = null\n\t\t\tfor (let pass = 0; pass < 2; pass++) {\n\t\t\t\tconst side = leftFirst === (pass === 0) ? left : right\n\t\t\t\tconst out = side > 0 ? 1 : -1\n\t\t\t\tfor (let push = 0; push < 3 && !detour; push++) {\n\t\t\t\t\tconst offset = side + out * (radius + DETOUR_CLEARANCE + push * 0.5)\n\t\t\t\t\tconst x = pos.x + dx * along + dz * offset\n\t\t\t\t\tconst z = pos.z + dz * along - dx * offset\n\t\t\t\t\tconst there = standable(world, nav, entity, x, z)\n\t\t\t\t\tif (there) {\n\t\t\t\t\t\tif (there !== entity && !knot.includes(there)) blocker ??= there\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif (!segmentClear(radius, pos.x, pos.z, x, z) || !straightWay(nav, pos.x, pos.z, x, z)) continue\n\t\t\t\t\tif (segmentClear(radius, x, z, agent.cx, agent.cz) && straightWay(nav, x, z, agent.cx, agent.cz)) {\n\t\t\t\t\t\taimX = agent.cx\n\t\t\t\t\t\taimZ = agent.cz\n\t\t\t\t\t} else if (\n\t\t\t\t\t\t(agent.nx !== agent.cx || agent.nz !== agent.cz) &&\n\t\t\t\t\t\tsegmentClear(radius, x, z, agent.nx, agent.nz) &&\n\t\t\t\t\t\tstraightWay(nav, x, z, agent.nx, agent.nz)\n\t\t\t\t\t) {\n\t\t\t\t\t\taimX = agent.nx\n\t\t\t\t\t\taimZ = agent.nz\n\t\t\t\t\t} else continue\n\t\t\t\t\tdetour = { x, z }\n\t\t\t\t}\n\t\t\t\tif (detour) break\n\t\t\t}\n\t\t\tif (!detour && blocker && knot.length < knotMost) knot.push(blocker)\n\t\t\telse if (!detour) break\n\t\t}\n\t\tif (detour) {\n\t\t\tconst straight = aimX === agent.cx && aimZ === agent.cz ? toCorner : toCorner + hypot(agent.nx - agent.cx, agent.nz - agent.cz)\n\t\t\tconst longer = hypot(detour.x - pos.x, detour.z - pos.z) + hypot(aimX - detour.x, aimZ - detour.z) - straight\n\t\t\tconst around = [...knot]\n\t\t\tif (!held && !world.settings.movement.goesAround(world, entity, around, longer, straight)) detour = null\n\t\t\tif (world.hooks.has('detour')) detour = world.hooks.run('detour', { entity, around, straight, longer, point: detour }).point\n\t\t\tif (detour) {\n\t\t\t\tm.detour = detour\n\t\t\t\tm.detourAim = { x: aimX, z: aimZ }\n\t\t\t\tm.detourPast = false\n\t\t\t\tworld.nav.setDestination(entity.id, detour)\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t}\n\t// no way round: those in the way that make way are asked to, before the unit reaches them\n\tdirection.x = dx\n\tdirection.z = dz\n\tfor (const other of [...inWay]) stepAside(world, entity, other, direction, agent)\n}\n\n/**\n * Over how many ticks the chasers look for new paths after the navigation changed: an eighth of them each tick\n *\n * @beta\n */\nexport const REPATH_SPREAD = 8\n\n/** Keeps chasers pointed at targets that moved, and lets go of the ones gone out of reach */\nfunction followTargets(world: World): void {\n\tconst { nav } = world\n\tfor (const entity of world.index.with(moving)) {\n\t\tconst m = entity.get(moving)\n\t\tif (!m || m.status !== 'moving' || !m.goalEntity) continue\n\t\tconst target = world.get(m.goalEntity)\n\t\tif (!target || target.hidden) {\n\t\t\tnav.clearDestination(entity.id)\n\t\t\tm.status = 'failed'\n\t\t\tcontinue\n\t\t}\n\t\tconst point = approachPoint(world, entity, target)\n\t\t// a change of the navigation has every chaser look again: a few each tick, by their ids, so that a building put\n\t\t// down does not have a thousand paths looked for in one tick. By the world's own count, so it stays the same\n\t\t// game everywhere\n\t\tconst stale = m.navVersion !== nav.version && (entity.id + world.tick) % REPATH_SPREAD === 0\n\t\tif (dist(point, m.navGoal) > 0.75 || stale) beginMove(world, entity, point)\n\t}\n}\n\n/** Where the navigation moved each unit to, read back into the world: and from there, how each is getting on */\nfunction readAgents(world: World, dt: number): void {\n\tfor (const entity of world.index.with(moving)) {\n\t\tconst m = entity.get(moving)\n\t\tif (!m || !entity.alive || entity.hidden) continue\n\t\tif (!world.nav.readAgent(entity.id, agent)) continue\n\t\tmoveAlong(world, entity, m, dt)\n\t}\n}\n\n/** A unit the navigation moved (`agent`, just read): where it is, which way it faces, and how it is getting on */\nfunction moveAlong(world: World, entity: Entity, m: MovementState, dt: number): void {\n\t// the navigation moved it: this is where the world learns where it went\n\tentity.moveTo(agent.x, agent.z)\n\tentity.velocity.x = agent.vx\n\tentity.velocity.z = agent.vz\n\tif (m.status !== 'moving') {\n\t\tif (m.place) backToPlace(world, entity, m, dt)\n\t\treturn lineUp(world, entity, m, dt)\n\t}\n\n\tif (agent.vx * agent.vx + agent.vz * agent.vz > 0.2) {\n\t\tconst desired = atan2(agent.vx, agent.vz)\n\t\tentity.facing = rotateTowards(entity.facing, desired, turnRateOf(world, entity) * dt)\n\t}\n\tconst distance = distanceLeft(world, entity, m)\n\tif (distance === undefined) return\n\tif (distance <= m.range) return arrive(world, entity)\n\tsteerAround(world, entity, m)\n\tfollowRoute(world, entity, m)\n\twatchProgress(world, entity, m, distance, dt)\n}\n\n/** How far off its place in a formation a unit that stands there goes back to it */\nconst PLACE_OFF = 0.35\n/** Seconds it stands off its place before it goes back: the one it stepped aside for gone by */\nconst PLACE_WAIT = 0.75\n/** How many times it goes back to its place without getting there before it lets it go: jostling for ever is no good */\nconst BACK_TRIES = 5\n\n/**\n * A unit of a formation standing off its place (stepped aside for another, or pushed off it) walks back to it once it\n * has stood off it a while (`PLACE_WAIT`), as one of the formation: it swaps, passes on and trades places on the way,\n * and makes its own room by it (`nudge`), but does not try again: held up `HELD_UP` near it, it stops, its place kept.\n * Where another of the formation stands there, off its own, that one keeps this place and this one goes to the\n * other's; where one stands at its own there it waits. After a few walks back (`BACK_TRIES`) without getting there\n * it lets the place go, and stays where it is\n */\nfunction backToPlace(world: World, entity: Entity, m: MovementState, dt: number): void {\n\tconst place = m.place!\n\tif (m.anchored || entity.orders.length > 0 || dist(entity.pos, place) <= PLACE_OFF) return\n\tm.stalledTime += dt\n\tif (m.stalledTime < PLACE_WAIT || (world.tick + entity.id) % LOOK_AHEAD_INTERVAL !== 0) return\n\tm.stalledTime = 0\n\tconst tries = (m.backTries ?? 0) + 1\n\tif (tries > BACK_TRIES) return leavePlace(m)\n\t// another of the formation standing there off its own (each stood aside onto the other's, or a ring of them): it\n\t// keeps this one where it stands, and this one goes to its own instead, as `swapPlaces`\n\tconst theirs = m.formation !== undefined ? takeOver(world, entity, place, m.formation) : undefined\n\tif (theirs) m.place = theirs\n\tconst to = m.place!\n\tif (theirs || !standingOn(world, entity, to)) {\n\t\t// its place kept on the way, should it not get there (`toPlace` lets it go)\n\t\tif (m.formation !== undefined) toPlace(world, entity, to, m.formation, m.finalFacing ?? entity.facing)\n\t\telse moveTo(world, entity, to, { facing: m.finalFacing ?? entity.facing, aside: true })\n\t\tm.place = to\n\t}\n\t// a swap settles the other: no try spent\n\tif (theirs) delete m.backTries\n\telse m.backTries = tries\n\tif (m.status === 'moving') m.asideDepth = ASIDE_DEPTH\n}\n\n/** Groups bump into each other on arrival and end up looking anywhere: a unit that stopped turns to face the way it was told */\nfunction lineUp(world: World, entity: Entity, m: MovementState, dt: number): void {\n\tif (m.finalFacing === null) return\n\tentity.facing = rotateTowards(entity.facing, m.finalFacing, turnRateOf(world, entity) * dt)\n\tif (entity.facing === m.finalFacing) m.finalFacing = null\n}\n\n/** How far a unit on its way has still to go: to the edge of what it goes to, or to its point. None for a target gone */\nfunction distanceLeft(world: World, entity: Entity, m: MovementState): number | undefined {\n\tif (!m.goalEntity) return dist(entity.pos, m.goal)\n\tconst target = world.get(m.goalEntity)\n\treturn target ? edgeDistance(entity, target) : undefined\n}\n\n/**\n * Round a knot of standing units: sent on past the point beside them as it nears it, and back on its way once it is\n * past that point, or held up there\n */\nfunction steerAround(world: World, entity: Entity, m: MovementState): void {\n\tif (!m.detour) return\n\tconst near = dist(entity.pos, m.detour)\n\tconst aim = m.detourAim ?? m.navGoal\n\tconst passed = (entity.pos.x - m.detour.x) * (aim.x - m.detour.x) + (entity.pos.z - m.detour.z) * (aim.z - m.detour.z) > 0\n\tif ((m.detourPast && passed) || near <= 0.5 || m.stalledTime > 0.5 || (m.slowTime ?? 0) > 0.3) {\n\t\tm.detour = undefined\n\t\twalk(world, entity)\n\t} else if (!m.detourPast && near <= DETOUR_PAST_AT) {\n\t\tm.detourPast = true\n\t\tconst to = m.detourAim ?? m.stretch ?? m.navGoal\n\t\tlet px = to.x - m.detour.x\n\t\tlet pz = to.z - m.detour.z\n\t\tconst past = hypot(px, pz)\n\t\tif (past > DETOUR_PAST) {\n\t\t\tpx *= DETOUR_PAST / past\n\t\t\tpz *= DETOUR_PAST / past\n\t\t}\n\t\tworld.nav.setDestination(entity.id, { x: m.detour.x + px, z: m.detour.z + pz })\n\t}\n}\n\n/**\n * On a route its side planned: planned again once the side knows more (a few units a tick, by their ids), and sent on\n * a stretch further once halfway along the one it is on\n */\nfunction followRoute(world: World, entity: Entity, m: MovementState): void {\n\tif (m.detour || !(m.route || m.routeVersion !== undefined)) return\n\tconst team = sideOf(world, entity)\n\tlet again = false\n\tif (team !== undefined && m.routeVersion !== world.sidePaths!.version(team) && (entity.id + world.tick) % REPATH_SPREAD === 0) {\n\t\tplanRoute(world, entity, team)\n\t\tagain = true\n\t}\n\tif (again || (m.stretch && dist(entity.pos, m.stretch) < stretchOf(entity) / 2)) {\n\t\tconst next = m.route ? stretchPoint(entity) : m.navGoal\n\t\tif (again || !m.stretch || dist(next, m.stretch) > 0.5) walk(world, entity)\n\t}\n}\n\n/**\n * Whether a unit on its way gets anywhere: held up by others (asked aside, gone round), stalled (arrived where close is\n * good enough, or given up after a while)\n */\nfunction watchProgress(world: World, entity: Entity, m: MovementState, distance: number, dt: number): void {\n\t// a new corner to head for is not progress in itself, getting closer to it is\n\tconst progress = hypot(entity.pos.x - agent.cx, entity.pos.z - agent.cz)\n\tif (agent.cx !== m.corner.x || agent.cz !== m.corner.z) {\n\t\tm.corner.x = agent.cx\n\t\tm.corner.z = agent.cz\n\t\tm.bestDistance = progress\n\t}\n\t// held up by others: going well under its speed, once it got going and while it is not slowing to arrive\n\tconst slow = m.speed > 0 && hypot(agent.vx, agent.vz) < m.speed * SLOW_PART && distance > m.range + entity.def.radius * 2 + 0.3\n\tm.slowTime = slow && m.bestDistance < Infinity ? (m.slowTime ?? 0) + dt : 0\n\n\t// what stands in its way further on: gone round, or asked aside, before it gets there. Not while it goes round a\n\t// knot: the way it was sent was clear when it took it, and it would ask the knot aside as it passes. Nor on a\n\t// step aside, which is nobody's business\n\tif (!m.detour && !m.aside && (world.tick + entity.id) % LOOK_AHEAD_INTERVAL === 0) lookAhead(world, entity, agent)\n\n\tif (progress < m.bestDistance - 0.1) {\n\t\tm.bestDistance = progress\n\t\tm.stalledTime = 0\n\t\t// well on its way again since it last tried: it has its tries again\n\t\tif (m.tries && distance < (m.triedAt ?? Infinity) - TRIED_FAR) {\n\t\t\tdelete m.tries\n\t\t\tdelete m.triedAt\n\t\t}\n\t\tif (!m.aside && (m.slowTime ?? 0) > MAKE_WAY_AFTER && (world.tick + entity.id) % MAKE_WAY_INTERVAL === 0) makeWay(world, entity)\n\t\treturn\n\t}\n\tm.stalledTime += dt\n\tif ((!m.aside || (m.asideDepth ?? 1) < ASIDE_DEPTH) && m.stalledTime > MAKE_WAY_AFTER && (world.tick + entity.id) % MAKE_WAY_INTERVAL === 0)\n\t\tmakeWay(world, entity)\n\n\tif (!m.goalEntity) {\n\t\t// one of a formation held up by others of it: they swap places, or pass them on, rather than push through\n\t\tconst formed = m.groupId && m.formation === m.groupId && !m.aside\n\t\tif (formed && m.stalledTime > 0.25 && distance < m.range + 4 && swapPlaces(world, entity, m)) return\n\t\tif (formed && m.stalledTime > 0.25 && (world.tick + entity.id) % LOOK_AHEAD_INTERVAL === 0 && passOn(world, entity, m)) return\n\t\tif (formed && m.stalledTime > 0.25 && (world.tick + entity.id) % LOOK_AHEAD_INTERVAL === 0 && tradeGoals(world, entity, m)) return\n\t\tif (formed && m.stalledTime > MAKE_WAY_AFTER && distance < NUDGE_NEAR && (world.tick + entity.id) % MAKE_WAY_INTERVAL === 0) {\n\t\t\tnudge(world, entity, m)\n\t\t\tclearPlace(world, entity, m)\n\t\t}\n\t\t// someone standing on the destination: close enough is good enough, otherwise groups jostle forever. Not short\n\t\t// of a point nobody stands on: those in the way go aside, or it tries again\n\t\tconst taken = m.aside || (m.stalledTime > 0.25 && distance < m.range + 4 && goalTaken(world, entity, m))\n\t\tif (taken && m.stalledTime > 0.25 && distance < m.range + 4 && blockedByArrivedGroupMate(world, entity)) arrive(world, entity)\n\t\telse if (taken && m.stalledTime > 0.6 && distance < 1.25) arrive(world, entity)\n\t}\n\tif (m.status === 'moving' && m.stalledTime > HELD_UP) {\n\t\t// a walk back to its place (it has one on the way): held up near it, it stops, and walks back again later\n\t\tif (!m.goalEntity && distance < 3 && (m.aside || m.place || goalTaken(world, entity, m))) arrive(world, entity)\n\t\telse if (!m.aside && (m.tries ?? 0) < TRIES && !wayEndsShort(entity, m) && heldByUnits(world, entity)) tryAgain(world, entity, m, distance)\n\t\t// out of tries: near enough, or given up\n\t\telse if (!m.goalEntity && distance < 3) arrive(world, entity)\n\t\telse {\n\t\t\tworld.nav.clearDestination(entity.id)\n\t\t\tm.status = 'failed'\n\t\t\tm.stuck = true\n\t\t}\n\t}\n}\n\n/** Seconds a unit on its way gets nowhere before it tries again (`tryAgain`), or, out of tries, gives up */\nconst HELD_UP = 3\n/** How many times a unit held up tries again before it gives up: 4, after 15 seconds held up in all */\nconst TRIES = 4\n/** How much nearer a unit that tried again has to get to have its tries again */\nconst TRIED_FAR = 2\n\n/**\n * Whether another unit stands where a unit on its way is going: then near is as good as there, rather than push it\n * off (a group sent to one point, a unit sent where another stands)\n */\nfunction goalTaken(world: World, entity: Entity, m: MovementState): boolean {\n\treturn !!standingOn(world, entity, m.goal, true)\n}\n\n/**\n * The unit standing on a point, where another would stand, the nearest it: none where nobody does. `sameGoal` counts\n * one on its way to that very point, there already, as standing there: several sent to one point\n */\nfunction standingOn(world: World, entity: Entity, point: Vec2, sameGoal = false): Entity | undefined {\n\tworld.spatial.query(point.x, point.z, entity.def.radius + 1, roomNear)\n\tlet nearest: Entity | undefined\n\tlet best = Infinity\n\tfor (const other of roomNear) {\n\t\tif (other === entity || other.hidden || other.flying !== entity.flying || !other.get(moving)) continue\n\t\tconst om = other.get(moving)!\n\t\tconst room = entity.def.radius + other.def.radius\n\t\tif (om.status === 'moving' && !(sameGoal && hypot(om.goal.x - point.x, om.goal.z - point.z) < room)) continue\n\t\tconst d = hypot(other.pos.x - point.x, other.pos.z - point.z)\n\t\tif (d < room && d < best) {\n\t\t\tbest = d\n\t\t\tnearest = other\n\t\t}\n\t}\n\treturn nearest\n}\n\n/**\n * A unit of a formation held up near its place, with another of the formation standing on it, off its own (it stopped\n * short of it, or stepped aside onto this one): they swap. The one standing there has its place where it stands, and\n * this one goes to the other's. The formation is whole all the same, and neither pushes the other. Only those of a\n * type: a formation that places each by who it is (`FormationDef.points`) keeps them so. True when they do\n */\nfunction swapPlaces(world: World, entity: Entity, m: MovementState): boolean {\n\tconst theirs = takeOver(world, entity, m.goal, m.groupId)\n\tif (!theirs) return false\n\ttoPlace(world, entity, theirs, m.groupId, m.finalFacing)\n\treturn true\n}\n\n/**\n * The one of formation `group` standing on a place, off its own, given that place where it stands, as `swapPlaces`\n * has it: its own place, which is the other one's now, or none where nobody such stands there\n */\nfunction takeOver(world: World, entity: Entity, place: Vec2, group: number): Vec2 | undefined {\n\tconst other = standingOn(world, entity, place)\n\tconst om = other?.get(moving)\n\tif (!other || !om?.place || om.formation !== group || other.def.id !== entity.def.id || other.orders.length > 0) return\n\tif (dist(other.pos, om.place) <= PLACE_OFF || dist(om.place, place) <= PLACE_OFF) return\n\tconst theirs = om.place\n\tom.place = { x: place.x, z: place.z }\n\tdelete om.backTries\n\treturn theirs\n}\n\n/** How near its place one of a formation is for those of it it touches, ahead, to make it room (`nudge`) */\nconst NUDGE_NEAR = 1.5\n/** How far they step to make room, from where they stand: back to their places after (`backToPlace`) */\nconst NUDGE = 0.4\n\n/**\n * One of a formation held up right by its place, those of it at theirs touching it on the way there: they step a\n * little away from it to make it room, as a crowd parts, and go back to their places once it is in its own. The last\n * of a ring to come finds the gap left for it narrowed by those either side, each stopped up to `ARRIVE_RANGE` short\n */\nfunction nudge(world: World, entity: Entity, m: MovementState): void {\n\tconst dx = m.goal.x - entity.pos.x\n\tconst dz = m.goal.z - entity.pos.z\n\tworld.spatial.query(entity.pos.x, entity.pos.z, entity.def.radius + 1.5, roomNear)\n\tconst near = [...roomNear]\n\tfor (const other of near) {\n\t\tconst om = other.get(moving)\n\t\tif (other === entity || !om?.place || om.formation !== m.groupId || om.status === 'moving' || other.orders.length > 0 || om.anchored) continue\n\t\tconst rx = other.pos.x - entity.pos.x\n\t\tconst rz = other.pos.z - entity.pos.z\n\t\tconst apart = hypot(rx, rz)\n\t\tif (rx * dx + rz * dz <= 0 || apart - entity.def.radius - other.def.radius > 0.25 || apart < 0.01) continue\n\t\tconst x = other.pos.x + (rx / apart) * NUDGE\n\t\tconst z = other.pos.z + (rz / apart) * NUDGE\n\t\tif (!walkableAt(world.navFor(other), x, z)) continue\n\t\tmoveTo(world, other, { x, z }, { facing: om.finalFacing ?? other.facing, aside: true })\n\t\tom.asideDepth = ASIDE_DEPTH\n\t}\n}\n\n/**\n * One of a formation held up by its place, an ally of none of it standing there: asked aside, as the rules have it\n * (`stepAside`). A formation is laid out where it is sent, whoever stood there\n */\nfunction clearPlace(world: World, entity: Entity, m: MovementState): void {\n\tconst other = standingOn(world, entity, m.goal)\n\tif (!other || other.get(moving)!.formation === m.groupId) return\n\tconst dx = m.goal.x - entity.pos.x\n\tconst dz = m.goal.z - entity.pos.z\n\tconst length = hypot(dx, dz)\n\tif (length < 0.01 || !world.nav.readAgent(entity.id, agent)) return\n\tdirection.x = dx / length\n\tdirection.z = dz / length\n\tstepAside(world, entity, other, direction, agent)\n}\n\n/** Sends one of a formation to a place in it, as its order did: it keeps the place once there */\nfunction toPlace(world: World, entity: Entity, place: Vec2, groupId: number, facing: number | null): void {\n\tmoveTo(world, entity, place, { groupId, facing: facing ?? undefined })\n\tmovementOf(entity).formation = groupId\n}\n\n/** How much nearer its place the one standing in the way is than the one held up, for it to be passed on (`passOn`) */\nconst PASS_NEARER = 0.25\n\n/**\n * A unit of a formation held up by another of it standing at its place, on the way to its own further in: the one\n * standing goes on to that place, nearer it, and this one takes the one it leaves, right by it. The places of a ring\n * deep in the formation are filled through those already standing, a step at a time, rather than each pushing through\n * those that came first. Each pass has the one going on to the place nearer it (`PASS_NEARER`), so that it comes to an\n * end. Only to one of its type, as `swapPlaces`. True when it is passed on\n */\nfunction passOn(world: World, entity: Entity, m: MovementState): boolean {\n\tconst left = dist(entity.pos, m.goal)\n\tworld.spatial.query(entity.pos.x, entity.pos.z, entity.def.radius + 1.5, roomNear)\n\tlet best: Entity | undefined\n\tlet nearest = left - PASS_NEARER\n\tfor (const other of roomNear) {\n\t\tconst om = other.get(moving)\n\t\tif (\n\t\t\tother === entity ||\n\t\t\t!om?.place ||\n\t\t\tom.formation !== m.groupId ||\n\t\t\tother.def.id !== entity.def.id ||\n\t\t\tom.status === 'moving' ||\n\t\t\tother.orders.length > 0 ||\n\t\t\tom.anchored\n\t\t)\n\t\t\tcontinue\n\t\tif (distanceToEdge(entity.pos, other) - entity.def.radius > 0.35 || dist(other.pos, om.place) > PLACE_OFF) continue\n\t\tif (dist(entity.pos, om.place) > entity.def.radius + other.def.radius + 0.6) continue\n\t\tconst d = dist(other.pos, m.goal)\n\t\tif (d < nearest) {\n\t\t\tnearest = d\n\t\t\tbest = other\n\t\t}\n\t}\n\tif (!best) return false\n\tconst theirs = best.get(moving)!.place!\n\ttoPlace(world, best, { x: m.goal.x, z: m.goal.z }, m.groupId, m.finalFacing)\n\ttoPlace(world, entity, theirs, m.groupId, m.finalFacing)\n\treturn true\n}\n\n/** How much shorter the two ways together are for two of a formation to trade places on the way (`tradeGoals`) */\nconst TRADE_SHORTER = 0.5\n\n/**\n * Two of a formation on their way, holding each other up, each nearer the other's place than its own (they meet head\n * on, or cross): they trade places, when the two ways together are shorter by `TRADE_SHORTER`, rather than each push\n * round the other. Only with one of its type that does nothing but walk to its place, as `swapPlaces`. True when they do\n */\nfunction tradeGoals(world: World, entity: Entity, m: MovementState): boolean {\n\tconst mine = dist(entity.pos, m.goal)\n\tworld.spatial.query(entity.pos.x, entity.pos.z, entity.def.radius + 1.5, roomNear)\n\tlet best: Entity | undefined\n\tlet most = TRADE_SHORTER\n\tfor (const other of roomNear) {\n\t\tconst om = other.get(moving)\n\t\tif (\n\t\t\tother === entity ||\n\t\t\t!om ||\n\t\t\tom.status !== 'moving' ||\n\t\t\tom.aside ||\n\t\t\tom.goalEntity ||\n\t\t\tom.groupId !== m.groupId ||\n\t\t\tom.formation !== m.groupId ||\n\t\t\tother.def.id !== entity.def.id ||\n\t\t\tother.orders.length > 1 ||\n\t\t\t(other.orders.length === 1 && other.orders[0].type !== 'move') ||\n\t\t\tdistanceToEdge(entity.pos, other) - entity.def.radius > 0.35\n\t\t)\n\t\t\tcontinue\n\t\tconst shorter = mine + dist(other.pos, om.goal) - dist(entity.pos, om.goal) - dist(other.pos, m.goal)\n\t\tif (shorter > most) {\n\t\t\tmost = shorter\n\t\t\tbest = other\n\t\t}\n\t}\n\tif (!best) return false\n\tconst goal = best.get(moving)!.goal\n\tconst theirs = { x: goal.x, z: goal.z }\n\ttoPlace(world, best, { x: m.goal.x, z: m.goal.z }, m.groupId, m.finalFacing)\n\ttoPlace(world, entity, theirs, m.groupId, m.finalFacing)\n\treturn true\n}\n\n/**\n * Whether the unit stands at the end of its path, and that end is short of where it goes: the navigation knows no way\n * further (across a wood, up a cliff). Then trying again is no good\n */\nfunction wayEndsShort(entity: Entity, m: MovementState): boolean {\n\tconst to = m.stretch ?? m.navGoal\n\treturn hypot(entity.pos.x - agent.cx, entity.pos.z - agent.cz) < entity.def.radius + 0.5 && hypot(agent.cx - to.x, agent.cz - to.z) > 0.5\n}\n\n/**\n * Whether others that may yet go are what hold a unit up: one against it that is not anchored (an ally that makes way,\n * one on its way, an enemy that moves on). Not the ground, a wood, nor those holding their ground: trying again is no\n * good against them\n */\nfunction heldByUnits(world: World, entity: Entity): boolean {\n\tworld.spatial.query(entity.pos.x, entity.pos.z, entity.def.radius + 1.5, roomNear)\n\tfor (const other of roomNear) {\n\t\tconst om = other.get(moving)\n\t\tif (other === entity || !om || om.anchored || om.ghost || om.phased || other.hidden || !other.alive || other.flying !== entity.flying) continue\n\t\tif (distanceToEdge(entity.pos, other) - entity.def.radius < 0.6) return true\n\t}\n\treturn false\n}\n\n/**\n * A unit held up on its way (`HELD_UP`), where its goal is not taken, tries again rather than give up: it is sent on\n * its way anew, looks round the whole knot it is held up by for a way round, however long, and asks those of it that\n * make way aside. Out of tries (`TRIES`) it gives up: a crowd of others, or enemies, that will not let it through\n */\nfunction tryAgain(world: World, entity: Entity, m: MovementState, distance: number): void {\n\tm.tries = (m.tries ?? 0) + 1\n\tm.triedAt = distance\n\tm.stalledTime = 0\n\tm.slowTime = 0\n\tm.detour = undefined\n\twalk(world, entity)\n\t// where its path heads now, for the look round\n\tif (!world.nav.readAgent(entity.id, agent)) return\n\tm.corner.x = agent.cx\n\tm.corner.z = agent.cz\n\tm.bestDistance = hypot(entity.pos.x - agent.cx, entity.pos.z - agent.cz)\n\tlookFurther(world, entity, agent, true)\n\tif (!m.detour) makeWay(world, entity)\n}\n\nexport const movementSystem: System = {\n\tname: 'movement',\n\tphase: 'move',\n\tupdate(world, dt) {\n\t\tseeToPhasing(world)\n\t\tfollowTargets(world)\n\t\tworld.nav.update(dt)\n\t\treadAgents(world, dt)\n\t}\n}\n"],"mappings":";;;;;;;;;;;AAeA,IAAa,eAAe;;AAG5B,IAAM,cAAc,OAAc,WAA2B,OAAO,IAAI,YAAY,MAAM,SAAS,SAAS;;;;;AA8B5G,SAAgB,cAAc,OAAc,QAAgB,QAAsB;CAEjF,IAAI,OAAO,QAAQ,OAAO,OAAO;CACjC,IAAI,OAAO,IAAI,WAAW,OAAO,mBAAmB,OAAO,KAAK,OAAO,MAAM,OAAO,IAAI,SAAS,GAAI;CACrG,OAAO,OAAO,IAAI,QAAQ,CAAC,EAAE,YAAY,OAAO,KAAK,QAAQ,OAAO,QAAQ,MAAM,IAAI,OAAO;AAC9F;;;;;;AAOA,IAAM,aAAa,WAA2B,KAAK,IAAI,KAAK,IAAI,OAAO,IAAI,SAAS,GAAG,CAAC,GAAG,EAAE;;;AAI7F,SAAS,WAAW,QAA+B;CAClD,MAAM,IAAI,OAAO,IAAI,MAAM;CAC3B,IAAI,CAAC,GAAG,MAAM,IAAI,MAAM,GAAG,OAAO,IAAI,GAAG,GAAG,OAAO,GAAG,8BAA8B;CACpF,OAAO;AACR;AAEA,SAAS,OAAO,OAAc,QAAoC;CACjE,MAAM,QAAQ,MAAM;CACpB,IAAI,CAAC,SAAS,OAAO,UAAU,OAAO,IAAI,OAAO,OAAO,KAAA;CACxD,MAAM,OAAO,MAAM,OAAO,OAAO,KAAK,CAAC,CAAC;CACxC,OAAO,MAAM,IAAI,IAAI,IAAI,OAAO,KAAA;AACjC;;AAGA,SAAS,UAAU,OAAc,QAAgB,MAAoB;CACpE,MAAM,IAAI,WAAW,MAAM;CAE3B,MAAM,QAAQ,MAAM;CACpB,IAAI,CAAC,OAAO;CACZ,EAAE,eAAe,MAAM,QAAQ,IAAI;CACnC,EAAE,UAAU;CAEZ,IAAI,KAAK,OAAO,KAAK,EAAE,OAAO,KAAK,UAAU,MAAM,GAAG;EACrD,EAAE,QAAQ,KAAA;EACV;CACD;CACA,MAAM,QAAQ,MAAM,MAAM,MAAM,OAAO,KAAK,EAAE,OAAO;CACrD,EAAE,QAAQ,SAAS,MAAM,SAAS,IAAI,MAAM,KAAK,EAAE,GAAG,SAAS;EAAE;EAAG;CAAE,EAAE,IAAI,KAAA;AAC7E;;AAGA,SAAS,cAAc,GAAS,GAAS,GAAiB;CACzD,MAAM,KAAK,EAAE,IAAI,EAAE;CACnB,MAAM,KAAK,EAAE,IAAI,EAAE;CACnB,MAAM,SAAS,KAAK,KAAK,KAAK;CAC9B,MAAM,IAAI,SAAS,IAAI,KAAK,IAAI,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,MAAM,QAAQ,CAAC,GAAG,CAAC,IAAI;CAClG,OAAO,MAAM,EAAE,KAAK,EAAE,IAAI,KAAK,IAAI,EAAE,KAAK,EAAE,IAAI,KAAK,EAAE;AACxD;;AAGA,SAAS,aAAa,QAAsB;CAC3C,MAAM,IAAI,WAAW,MAAM;CAC3B,MAAM,QAAQ,EAAE;CAChB,IAAI,CAAC,OAAO,OAAO,EAAE;CAGrB,IAAI,MAAM,KAAK,KAAK,EAAE,WAAW,KAAK,GAAG,CAAC;CAC1C,IAAI,UAAU;CACd,KAAK,IAAI,IAAI,KAAK,IAAI,MAAM,SAAS,GAAG,KAAK;EAC5C,MAAM,IAAI,cAAc,OAAO,KAAK,MAAM,IAAI,MAAM,IAAI,EAAE;EAC1D,IAAI,IAAI,UAAU,MAAM;GACvB,UAAU;GACV,MAAM;EACP;CACD;CACA,MAAM,KAAK,KAAK,IAAI,MAAM,GAAG,MAAM,SAAS,CAAC;CAC7C,EAAE,UAAU;CACZ,IAAI,OAAO,UAAU,MAAM;CAC3B,IAAI,OAAa,OAAO;CACxB,KAAK,IAAI,IAAI,IAAI,IAAI,MAAM,QAAQ,KAAK;EACvC,MAAM,SAAS,KAAK,MAAM,MAAM,EAAE;EAClC,IAAI,UAAU,MAAM;GACnB,MAAM,IAAI,OAAO;GACjB,OAAO;IAAE,GAAG,KAAK,KAAK,MAAM,EAAE,CAAC,IAAI,KAAK,KAAK;IAAG,GAAG,KAAK,KAAK,MAAM,EAAE,CAAC,IAAI,KAAK,KAAK;GAAE;EACvF;EACA,QAAQ;EACR,OAAO,MAAM;CACd;CACA,OAAO,EAAE;AACV;;AAGA,SAAS,KAAK,OAAc,QAAyB;CACpD,MAAM,IAAI,WAAW,MAAM;CAC3B,MAAM,KAAK,EAAE,QAAQ,aAAa,MAAM,IAAI,EAAE;CAC9C,EAAE,UAAU,EAAE,QAAQ;EAAE,GAAG,GAAG;EAAG,GAAG,GAAG;CAAE,IAAI,KAAA;CAC7C,OAAO,MAAM,IAAI,eAAe,OAAO,IAAI,EAAE;AAC9C;;AAGA,SAAgB,OAAO,OAAc,QAAsB;CAC1D,IAAI,OAAO,IAAI,MAAM,CAAC,EAAE,WAAW,UAAU,KAAK,OAAO,MAAM;AAChE;AAEA,SAAS,UAAU,OAAc,QAAgB,SAAqB;CACrE,MAAM,IAAI,WAAW,MAAM;CAC3B,EAAE,eAAe;CACjB,EAAE,cAAc;CAChB,EAAE,cAAc;CAChB,EAAE,WAAW;CACb,EAAE,SAAS,KAAA;CACX,OAAO,EAAE;CACT,OAAO,EAAE;CACT,EAAE,QAAQ,IAAI,QAAQ;CACtB,EAAE,QAAQ,IAAI,QAAQ;CACtB,EAAE,aAAa,MAAM,IAAI;CACzB,EAAE,QAAQ;CACV,IAAI,EAAE,UAAU;EACf,EAAE,WAAW;EACb,MAAM,IAAI,YAAY,OAAO,IAAI,KAAK;CACvC;CACA,MAAM,OAAO,OAAO,OAAO,MAAM;CACjC,IAAI,SAAS,KAAA,GAAW,EAAE,QAAQ,KAAA;MAC7B,UAAU,OAAO,QAAQ,IAAI;CAClC,EAAE,SAAS,KAAK,OAAO,MAAM,IAAI,WAAW;AAC7C;;;;;;;;;AAUA,SAAgB,OAAO,OAAc,QAAgB,MAAY,UAAuB,CAAC,GAAS;CACjG,MAAM,IAAI,OAAO,IAAI,MAAM;CAC3B,IAAI,CAAC,KAAK,OAAO,QAAQ;CACzB,EAAE,KAAK,IAAI,KAAK;CAChB,EAAE,KAAK,IAAI,KAAK;CAChB,EAAE,aAAa;CACf,EAAE,QAAQ,QAAQ,SAAA;CAClB,EAAE,UAAU,QAAQ,WAAW;CAC/B,EAAE,QAAQ,QAAQ,SAAS,KAAA;CAC3B,OAAO,EAAE;CAET,IAAI,CAAC,QAAQ,OAAO,WAAW,CAAC;CAChC,UAAU,OAAO,QAAQ,IAAI;CAC7B,EAAE,cAAc,QAAQ,UAAU;AACnC;;;;;;AAOA,SAAgB,aAAa,OAAc,QAAgB,QAAgB,OAAqB;CAC/F,MAAM,IAAI,OAAO,IAAI,MAAM;CAC3B,IAAI,CAAC,KAAK,OAAO,QAAQ;CACzB,IAAI,EAAE,WAAW,YAAY,EAAE,eAAe,OAAO,MAAM,EAAE,UAAU,OAAO;CAC9E,EAAE,aAAa,OAAO;CACtB,EAAE,QAAQ;CACV,EAAE,UAAU;CACZ,EAAE,QAAQ,KAAA;CACV,WAAW,CAAC;CACZ,UAAU,OAAO,QAAQ,cAAc,OAAO,QAAQ,MAAM,CAAC;AAC9D;;;;;;AAOA,SAAgB,WAAW,QAAgB,MAAqB;CAC/D,MAAM,IAAI,OAAO,IAAI,MAAM;CAC3B,OAAO,CAAC,CAAC,KAAK,EAAE,WAAW,YAAY,EAAE,eAAe,KAAK,EAAE,KAAK,MAAM,KAAK,KAAK,EAAE,KAAK,MAAM,KAAK;AACvG;;;;;;AAOA,SAAgB,KAAK,OAAc,QAAsB;CACxD,MAAM,IAAI,OAAO,IAAI,MAAM;CAC3B,IAAI,CAAC,GAAG;CACR,IAAI,EAAE,WAAW,UAAU,MAAM,IAAI,iBAAiB,OAAO,EAAE;CAC/D,EAAE,SAAS;CACX,EAAE,aAAa;CACf,EAAE,UAAU;CACZ,EAAE,SAAS,KAAA;AACZ;;AAGA,SAAS,WAAW,GAAwB;CAC3C,OAAO,EAAE;CACT,OAAO,EAAE;AACV;;;;;;;AAQA,SAAgB,cAAc,QAAgB,UAAU,GAAS;CAChE,MAAM,IAAI,OAAO,IAAI,MAAM;CAC3B,IAAI,CAAC,GAAG;CACR,WAAW,CAAC;CACZ,IAAI,SAAS,EAAE,YAAY;MACtB,OAAO,EAAE;AACf;;;;;;AAOA,SAAgB,YAAY,OAAc,QAAgB,UAAyB;CAClF,MAAM,IAAI,OAAO,IAAI,MAAM;CAC3B,IAAI,CAAC,KAAK,EAAE,aAAa,UAAU;CACnC,IAAI,YAAY,EAAE,WAAW,UAAU,KAAK,OAAO,MAAM;CACzD,EAAE,WAAW;CACb,MAAM,IAAI,YAAY,OAAO,IAAI,QAAQ;AAC1C;;;;;;AAOA,SAAgB,SAAS,OAAc,QAAgB,OAAsB;CAC5E,MAAM,IAAI,OAAO,IAAI,MAAM;CAC3B,IAAI,CAAC,KAAK,EAAE,UAAU,OAAO;CAC7B,EAAE,QAAQ;CAEV,MAAM,IAAI,SAAS,OAAO,IAAI,SAAU,CAAC,MAAM,IAAI,cAAc,CAAC,CAAC,EAAE,MAAO;AAC7E;;;;;;AAOA,SAAS,aAAa,OAAoB;CACzC,KAAK,MAAM,UAAU,MAAM,MAAM,KAAK,MAAM,GAAG;EAC9C,MAAM,IAAI,OAAO,IAAI,MAAM;EAC3B,IAAI,CAAC,GAAG;EACR,MAAM,UAAU,OAAO,MAAM,SAAS,KAAK,OAAO,SAAS,CAAC,OAAO,UAAU,UAAU,OAAO,MAAM;EACpG,IAAI,YAAY,CAAC,CAAC,EAAE,QAAQ;EAC5B,IAAI,SAAS,EAAE,SAAS;OACnB,OAAO,EAAE;EACd,IAAI,MAAM,IAAI,YAAY,MAAM,IAAI,WAAW,OAAO,IAAI,OAAO;OAC5D,MAAM,IAAI,SAAS,OAAO,IAAI,WAAW,EAAE,KAAK;CACtD;AACD;;;;;;;AAQA,SAAgB,YAAY,OAAc,QAAgB,OAAa,IAAkB;CACxF,MAAM,IAAI,OAAO,IAAI,MAAM;CAC3B,IAAI,GAAG,EAAE,cAAc;CACvB,MAAM,UAAU,MAAM,MAAM,IAAI,OAAO,IAAI,GAAG,MAAM,IAAI,OAAO,IAAI,CAAC;CACpE,OAAO,SAAS,cAAc,OAAO,QAAQ,SAAS,WAAW,OAAO,MAAM,IAAI,EAAE;AACrF;AAEA,SAAS,OAAO,OAAc,QAAsB;CACnD,MAAM,IAAI,iBAAiB,OAAO,EAAE;CACpC,MAAM,IAAI,WAAW,MAAM;CAC3B,EAAE,SAAS;CACX,EAAE,cAAc;CAGhB,IAAI,EAAE,WAAW,EAAE,cAAc,EAAE,WAAW,CAAC,EAAE,SAAS,CAAC,EAAE,YAAY;EACxE,EAAE,QAAQ;GAAE,GAAG,EAAE,KAAK;GAAG,GAAG,EAAE,KAAK;EAAE;EAErC,IAAI,KAAK,OAAO,KAAK,EAAE,KAAK,KAAK,WAAW,OAAO,EAAE;CACtD,OAAO,IAAI,EAAE,SAAS,KAAK,OAAO,KAAK,EAAE,KAAK,KAAK,WAAW,OAAO,EAAE;AACxE;;AAGA,SAAS,0BAA0B,OAAc,QAAyB;CACzE,MAAM,IAAI,WAAW,MAAM;CAC3B,IAAI,CAAC,EAAE,SAAS,OAAO;CACvB,MAAM,QAAQ,MAAM,OAAO,IAAI,GAAG,OAAO,IAAI,GAAG,OAAO,IAAI,SAAS,GAAG,UAAU;CACjF,KAAK,MAAM,SAAS,YAAY;EAC/B,MAAM,KAAK,MAAM,IAAI,MAAM;EAC3B,IAAI,UAAU,UAAU,CAAC,MAAM,MAAM,WAAW,OAAO,QAAQ;EAC/D,IAAI,GAAG,YAAY,EAAE,WAAW,GAAG,WAAW,WAAW;EACzD,IAAI,eAAe,OAAO,KAAK,KAAK,IAAI,OAAO,IAAI,SAAS,KAAM,OAAO;CAC1E;CACA,OAAO;AACR;;AAGA,IAAM,iBAAiB;;AAEvB,IAAM,cAAc;;AAEpB,IAAM,oBAAoB;;AAE1B,IAAM,sBAAsB;;AAE5B,IAAM,mBAAmB;;;;;;AAMzB,IAAM,cAAc;AACpB,IAAM,iBAAiB;;AAEvB,IAAM,YAAY;;AAElB,IAAM,aAAa;;AAEnB,IAAM,YAAY;;;;;AAKlB,IAAM,YAAY;;AAElB,IAAI,WAAW;;;;;;;;;;AAWf,SAAgB,YAAY,OAAc,OAAe,OAAwB;CAChF,MAAM,KAAK,MAAM,IAAI,MAAM;CAC3B,IAAI,UAAU,SAAS,CAAC,MAAM,MAAM,UAAU,CAAC,MAAM,OAAO,OAAO;CACnE,IAAI,GAAG,WAAW,YAAY,GAAG,SAAS,GAAG,QAAQ,OAAO;CAC5D,MAAM,IAAI,MAAM,IAAI,MAAM;CAE1B,IAAI,GAAG,QAAQ,OAAO;CACtB,IAAI,MAAM,MAAM,OAAO,EAAE,cAAc,MAAM,MAAM,IAAI,IAAI,EAAE,QAAQ,GAAG,MAAM,IAAI,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,MAAM,IAAI,SAAS,MAAM,IAAI,SAC3I,OAAO;CACR,OAAO,MAAM,IAAI,YAAY,MAAM,IAAI,MAAM,EAAE,KAAK;AACrD;;AAGA,SAAS,gBAAgB,IAAY,IAAY,IAAY,IAAY,IAAY,IAAoB;CACxG,MAAM,KAAK,KAAK;CAChB,MAAM,KAAK,KAAK;CAChB,MAAM,SAAS,KAAK,KAAK,KAAK;CAC9B,MAAM,IAAI,SAAS,IAAI,KAAK,IAAI,KAAK,MAAM,KAAK,MAAM,MAAM,KAAK,MAAM,MAAM,QAAQ,CAAC,GAAG,CAAC,IAAI;CAC9F,OAAO,MAAM,MAAM,KAAK,KAAK,IAAI,MAAM,KAAK,KAAK,EAAE;AACpD;AAEA,IAAM,QAAc;CAAE,GAAG;CAAG,GAAG;AAAE;;AAGjC,SAAS,WAAW,KAAiB,GAAW,GAAoB;CACnE,MAAM,IAAI;CACV,MAAM,IAAI;CACV,MAAM,UAAU,IAAI,aAAa,OAAO,CAAC;CACzC,OAAO,CAAC,CAAC,WAAW,MAAM,QAAQ,IAAI,GAAG,QAAQ,IAAI,CAAC,KAAK;AAC5D;;;;;;;AAQA,SAAS,WAAW,OAAc,OAAe,OAAe,IAAY,IAAY,OAAgC;CACvH,MAAM,KAAK,MAAM,IAAI,IAAI,MAAM,IAAI;CACnC,MAAM,KAAK,MAAM,IAAI,IAAI,MAAM,IAAI;CAEnC,MAAM,QADQ,MAAM,IAAI,SAAS,MAAM,IAAI,SACrB;CAEtB,MAAM,SAAS,KAAK,KAAK,KAAK;CAC9B,MAAM,QAAQ,KAAK,IAAI,MAAM,IAAI,MAAO,KAAK,KAAK,MAAM,IAAI,MAAM,KAAK,IAAI,IAAI;CAC/E,MAAM,MAAM,MAAM,OAAO,KAAK;CAC9B,MAAM,EAAE,QAAQ;CAChB,IAAI,QAAqB;CAEzB,MAAM,OAAO,MAAM,OAAO,WAAW;CACrC,KAAK,IAAI,OAAO,GAAG,OAAO,GAAG,QAAQ;EACpC,MAAM,OAAO,SAAS,IAAI,QAAQ,CAAC;EAEnC,KAAK,IAAI,OAAO,QAAQ,KAAK,IAAI,MAAM,GAAG,QAAQ,QAAQ,GAAG,QAAQ,IAAK;GACzE,MAAM,IAAI,MAAM,IAAI,IAAI,KAAK,OAAO;GACpC,MAAM,IAAI,MAAM,IAAI,IAAI,KAAK,OAAO;GACpC,IAAI,gBAAgB,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,MAAM,IAAI,MAAM,EAAE,IAAI,QAAQ,KAAM;GAC5E,IAAI,gBAAgB,GAAG,GAAG,MAAM,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,EAAE,IAAI,QAAQ,KAAM;GAClF,IAAI,CAAC,WAAW,KAAK,GAAG,CAAC,GAAG;GAE5B,IAAI,QAAQ,CAAC,QAAQ,OAAO,OAAO,OAAO,GAAG,CAAC,GAAG;IAChD,UAAU;KAAE;KAAG;IAAE;IACjB;GACD;GACA,OAAO;IAAE;IAAG;GAAE;EACf;CACD;CACA,OAAO;AACR;AAEA,IAAM,WAAqB,CAAC;;AAG5B,SAAS,QAAQ,OAAc,QAAgB,OAAe,GAAW,GAAoB;CAC5F,MAAM,QAAQ,MAAM,GAAG,GAAG,OAAO,IAAI,SAAS,GAAG,QAAQ;CACzD,KAAK,MAAM,SAAS,UAAU;EAC7B,IAAI,UAAU,UAAU,UAAU,SAAS,MAAM,UAAU,MAAM,WAAW,OAAO,QAAQ;EAC3F,MAAM,KAAK,MAAM,IAAI,MAAM;EAC3B,IAAI,CAAC,MAAM,GAAG,SAAS,GAAG,QAAQ;EAClC,MAAM,OAAO,OAAO,IAAI,SAAS,MAAM,IAAI,SAAS;EACpD,IAAI,GAAG,WAAW,YAAY,MAAM,MAAM,IAAI,IAAI,GAAG,MAAM,IAAI,IAAI,CAAC,IAAI,MAAM,OAAO;EACrF,IAAI,GAAG,SAAS,GAAG,WAAW,YAAY,MAAM,GAAG,KAAK,IAAI,GAAG,GAAG,KAAK,IAAI,CAAC,IAAI,MAAM,OAAO;CAC9F;CACA,OAAO;AACR;;;;;;;;AASA,SAAgB,UAAU,OAAc,OAAe,OAAe,WAAiB,OAA4B;CAClH,MAAM,KAAK,MAAM,IAAI,MAAM;CAC3B,IAAI,CAAC,MAAM,CAAC,MAAM,UAAU,MAAM,OAAO,MAAM,KAAK,KAAK,CAAC,MAAM,SAAS,SAAS,SAAS,OAAO,OAAO,KAAK,GAAG,OAAO;CACxH,MAAM,IAAI,MAAM,IAAI,MAAM;CAG1B,IAAI,GAAG,YAAY,GAAG,YAAY,EAAE,WAAW,GAAG,cAAc,EAAE,UAAU,OAAO;CACnF,IAAI,QAAQ,WAAW,OAAO,OAAO,OAAO,UAAU,GAAG,UAAU,GAAG,KAAK;CAC3E,IAAI,MAAM,MAAM,IAAI,SAAS,GAAG,QAAQ,MAAM,MAAM,IAAI,WAAW;EAAE;EAAO;EAAO;EAAW;CAAM,CAAC,CAAC,CAAC;CACvG,IAAI,CAAC,OAAO,OAAO;CACnB,OAAO,OAAO,OAAO,OAAO;EAAE,QAAQ,GAAG,eAAe,MAAM;EAAQ,OAAO;CAAK,CAAC;CAEnF,IAAI,GAAG,OAAO,GAAG,cAAc,EAAE,cAAc,KAAK;CACpD,OAAO;AACR;AAEA,IAAM,aAAuB,CAAC;AAC9B,IAAM,QAAkB,CAAC;AACzB,IAAM,OAAiB,CAAC;;;;;;AAMxB,IAAI,2BAAW,IAAI,WAAW,GAAG;;;;;;AAMjC,IAAI,wBAAQ,IAAI,aAAa,GAAG;AAChC,IAAI,wBAAQ,IAAI,aAAa,GAAG;AAChC,IAAI,6BAAa,IAAI,aAAa,GAAG;;AAErC,IAAI,yBAAS,IAAI,WAAW,GAAG;;AAE/B,IAAI,yBAAS,IAAI,WAAW,GAAG;;;;;;AAM/B,IAAI,4BAAY,IAAI,WAAW,GAAG;AAClC,IAAI,4BAAY,IAAI,WAAW,GAAG;AAClC,IAAI,2BAAW,IAAI,WAAW,GAAG;AACjC,IAAI,2BAAW,IAAI,WAAW,GAAG;AACjC,IAAI,WAAW;AACf,IAAI,WAAW;AACf,IAAI,WAAW;AACf,IAAI,WAAW;AACf,IAAI,aAAa;;;;;;AAOjB,SAAS,SAAS,OAAwB;CACzC,IAAI,OAAO;CACX,IAAI,OAAO;CACX,IAAI,OAAO;CACX,IAAI,OAAO;CACX,IAAI,SAAS;CAEb,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;EAC/B,MAAM,IAAI,MAAM;EAChB,MAAM,IAAI,MAAM;EAChB,OAAO,IAAI,IAAI,WAAW;EAC1B,IAAI,IAAI,MAAM,OAAO;EACrB,IAAI,IAAI,MAAM,OAAO;EACrB,IAAI,IAAI,MAAM,OAAO;EACrB,IAAI,IAAI,MAAM,OAAO;EACrB,IAAI,WAAW,KAAK,QAAQ,SAAS,WAAW;CACjD;CACA,MAAM,OAAO,KAAK,MAAM,OAAO,IAAI,IAAI;CACvC,MAAM,OAAO,KAAK,MAAM,OAAO,IAAI,IAAI;CACvC,MAAM,QAAQ,OAAO;CACrB,IAAI,OAAO,MAAM,GAAG,KAAK,EAAE,SAAS,QAAQ,IAAI,OAAO;CACvD,IAAI,UAAU,SAAS,QAAQ,GAAG;EACjC,YAAY,IAAI,YAAY,QAAQ,KAAK,CAAC;EAC1C,WAAW,IAAI,YAAY,QAAQ,KAAK,CAAC;CAC1C;CACA,UAAU,KAAK,GAAG,GAAG,QAAQ,CAAC;CAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;EAC/B,MAAM,OAAO,KAAK,MAAM,MAAM,KAAK,IAAI,IAAI,OAAO,KAAK,MAAM,MAAM,KAAK,IAAI;EAC5E,SAAS,KAAK;EACd,UAAU,OAAO,EAAE;CACpB;CACA,KAAK,IAAI,OAAO,GAAG,OAAO,OAAO,QAAQ,UAAU,OAAO,MAAM,UAAU;CAC1E,SAAS,IAAI,UAAU,SAAS,GAAG,KAAK,CAAC;CACzC,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK,UAAU,SAAS,SAAS,GAAG,MAAM;CACrE,WAAW;CACX,WAAW;CACX,WAAW;CACX,WAAW;CACX,aAAa;CACb,OAAO;AACR;;;;;;;AAQA,SAAS,SAAS,OAAc,QAAgB,OAAqB;CACpE,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;EAC/B,MAAM,QAAQ,WAAW;EACzB,MAAM,KAAK,MAAM,IAAI;EACrB,MAAM,KAAK,MAAM,IAAI;EACrB,WAAW,KAAK,MAAM,IAAI;CAC3B;CACA,MAAM,QAAQ,SAAS,KAAK;CAC5B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,UAAU,KAAK,SAAS,UAAU,KAAK;EAC/D,MAAM,SAAS,OAAO;EACtB,MAAM,UAAU,MAAM;EACtB,MAAM,UAAU,MAAM;EACtB,MAAM,eAAe,WAAW;EAChC,IAAI,QAAQ;EACZ,MAAM,QAAQ,MAAoB;GACjC,MAAM,OAAO,SAAS;GACtB,IAAI,SAAS,WAAW,SAAS,OAAO;GACxC,IAAI,MAAM,MAAM,KAAK,SAAS,MAAM,KAAK,OAAO,KAAK,eAAe,WAAW,KAAK,IAAK;GACzF,IAAI,CAAC,YAAY,OAAO,QAAQ,CAAC,GAAG;GACpC,SAAS,KAAK;GAEd,IAAI,QAAQ;GACZ,OAAO,QAAQ,KAAK,OAAO,QAAQ,KAAK,GAAG,SAAS,OAAO,SAAS,OAAO,QAAQ;GACnF,OAAO,SAAS;EACjB;EACA,IAAI,OAAO;GAEV,MAAM,QAAQ,eAAe,aAAa,KAAM;GAChD,MAAM,UAAU,KAAK,IAAI,KAAK,MAAM,UAAU,QAAQ,QAAQ,GAAG,CAAC;GAClE,MAAM,QAAQ,KAAK,IAAI,KAAK,MAAM,UAAU,QAAQ,QAAQ,GAAG,WAAW,CAAC;GAC3E,MAAM,UAAU,KAAK,IAAI,KAAK,MAAM,UAAU,QAAQ,QAAQ,GAAG,CAAC;GAClE,MAAM,QAAQ,KAAK,IAAI,KAAK,MAAM,UAAU,QAAQ,QAAQ,GAAG,WAAW,CAAC;GAE3E,KAAK,IAAI,MAAM,SAAS,OAAO,OAAO,OACrC,KAAK,IAAI,IAAI,UAAU,MAAM,WAAW,UAAU,MAAM,UAAU,MAAM,WAAW,QAAQ,IAAI,IAAI,KAAK,KAAK,KAAK,UAAU,EAAE;EAChI,OAAO,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK,KAAK,CAAC;EAC7C,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;GAC/B,OAAO,KAAK,UAAU,OAAO;GAC7B,KAAK,KAAK,WAAW,OAAO,GAAG;EAChC;CACD;AACD;AACA,IAAM,UAAU;AAChB,IAAM,QAAQ;AACd,IAAM,WAAW;AACjB,IAAM,UAAU;AAChB,IAAM,YAAkB;CAAE,GAAG;CAAG,GAAG;AAAE;AACrC,IAAM,QAAoB;CAAE,GAAG;CAAG,GAAG;CAAG,IAAI;CAAG,IAAI;CAAG,IAAI;CAAG,IAAI;CAAG,IAAI;CAAG,IAAI;AAAE;;;;;;;AAQjF,SAAgB,QAAQ,OAAc,QAAsB;CAC3D,MAAM,IAAI,WAAW,MAAM;CAC3B,IAAI,CAAC,MAAM,IAAI,UAAU,OAAO,IAAI,KAAK,GAAG;CAC5C,MAAM,KAAK,EAAE,UAAU,EAAE;CACzB,IAAI,KAAK,GAAG,IAAI,OAAO,IAAI;CAC3B,IAAI,KAAK,GAAG,IAAI,OAAO,IAAI;CAC3B,MAAM,SAAS,MAAM,IAAI,EAAE;CAC3B,IAAI,SAAS,KAAM;CACnB,MAAM;CACN,MAAM;CACN,UAAU,IAAI;CACd,UAAU,IAAI;CAEd,MAAM,QAAQ,MAAM,OAAO,IAAI,GAAG,OAAO,IAAI,GAAG,OAAO,IAAI,SAAS,KAAK,UAAU;CAGnF,IAAI;CACJ,KAAK,MAAM,SAAS,YAAY;EAC/B,MAAM,KAAK,MAAM,IAAI,IAAI,OAAO,IAAI;EACpC,MAAM,KAAK,MAAM,IAAI,IAAI,OAAO,IAAI;EACpC,MAAM,QAAQ,OAAO,IAAI,SAAS,MAAM,IAAI;EAC5C,MAAM,QAAQ,KAAK,KAAK,KAAK;EAC7B,IAAI,QAAQ,OAAQ,QAAQ,QAAQ,GAAG;EAEvC,MAAM,SAAS,KAAK,KAAK,KAAK;EAC9B,IAAI,KAAK,IAAI,MAAM,IAAI,OAAO;EAC9B,YAAY,CAAC;EACb,QAAQ,KAAK,KAAK;CACnB;CACA,IAAI,CAAC,SAAS;CACd,KAAK,MAAM,SAAS,SAAS,IAAI,YAAY,OAAO,QAAQ,KAAK,GAAG,UAAU,OAAO,QAAQ,OAAO,WAAW,KAAK;AACrH;;AAGA,SAAS,aAAa,QAAgB,IAAY,IAAY,IAAY,IAAqB;CAC9F,KAAK,MAAM,SAAS,MACnB,IAAI,gBAAgB,MAAM,IAAI,GAAG,MAAM,IAAI,GAAG,IAAI,IAAI,IAAI,EAAE,IAAI,SAAS,MAAM,IAAI,SAAS,KAAM,OAAO;CAE1G,OAAO;AACR;AAEA,IAAM,UAAgB;CAAE,GAAG;CAAG,GAAG;AAAE;AACnC,IAAM,QAAc;CAAE,GAAG;CAAG,GAAG;AAAE;;;;;AAMjC,SAAS,YAAY,KAAiB,OAAe,OAAe,KAAa,KAAsB;CACtG,MAAM,OAAO;CACb,MAAM,KAAK;CACX,KAAK,IAAI;CACT,KAAK,IAAI;CACT,GAAG,IAAI;CACP,GAAG,IAAI;CACP,MAAM,OAAO,IAAI,SAAS,MAAM,EAAE;CAClC,IAAI,CAAC,QAAQ,KAAK,WAAW,GAAG,OAAO;CACvC,IAAI,SAAS,KAAK,MAAM,KAAK,EAAE;CAC/B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,UAAU,KAAK,KAAK,IAAI,IAAI,KAAK,EAAE;CACzE,UAAU,KAAK,KAAK,KAAK,SAAS,IAAI,EAAE;CACxC,OAAO,UAAU,KAAK,MAAM,EAAE,IAAI,OAAO;AAC1C;AAEA,IAAM,gBAA0B,CAAC;;;;;AAMjC,SAAS,UAAU,OAAc,KAAiB,QAAgB,GAAW,GAA0B;CACtG,IAAI,CAAC,WAAW,KAAK,GAAG,CAAC,GAAG,OAAO;CACnC,MAAM,QAAQ,MAAM,GAAG,GAAG,OAAO,IAAI,SAAS,GAAG,aAAa;CAC9D,KAAK,MAAM,SAAS,eAAe;EAClC,IAAI,UAAU,UAAU,CAAC,MAAM,IAAI,MAAM,KAAK,MAAM,QAAQ;EAC5D,MAAM,OAAO,OAAO,IAAI,SAAS,MAAM,IAAI,SAAS;EAEpD,IAAI,MAAM,MAAM,IAAI,IAAI,GAAG,MAAM,IAAI,IAAI,CAAC,IAAI,QAAQ,YAAY,OAAO,QAAQ,KAAK,GAAG,OAAO;EAEhG,MAAM,KAAK,MAAM,IAAI,MAAM;EAC3B,IAAI,GAAG,SAAS,GAAG,WAAW,YAAY,MAAM,GAAG,KAAK,IAAI,GAAG,GAAG,KAAK,IAAI,CAAC,IAAI,MAAM,OAAO;CAC9F;CACA,OAAO;AACR;;AAGA,SAAS,YAAY,OAAc,QAAgB,GAAoB;CACtE,IAAI,SAAS,OAAO,SAAS,SAAS,KAAK,YAAY,OAAO,QAAQ,WAAW,EAAE,IAAI,WAAW;CAClG,OAAO,SAAS,OAAO;AACxB;;;;;;;;;;AAWA,SAAgB,UAAU,OAAc,QAAgB,OAAyB;CAChF,YAAY,OAAO,QAAQ,OAAO,KAAK;AACxC;;;;;AAMA,SAAS,YAAY,OAAc,QAAgB,OAAmB,MAAqB;CAC1F,MAAM,IAAI,WAAW,MAAM;CAC3B,MAAM,OAAO,OAAO,KAAK,IAAI,MAAM,SAAS,SAAS,UAAU,OAAO,MAAM,GAAG,CAAC,IAAI,MAAM,SAAS,SAAS,UAAU,OAAO,MAAM;CACnI,IAAI,QAAQ,GAAG;CACf,WAAW,OAAO,YAAY;CAC9B,MAAM,EAAE,QAAQ;CAChB,MAAM,SAAS,OAAO,IAAI;CAC1B,IAAI,KAAK,MAAM,KAAK,IAAI;CACxB,IAAI,KAAK,MAAM,KAAK,IAAI;CACxB,MAAM,WAAW,MAAM,IAAI,EAAE;CAC7B,IAAI,WAAW,QAAQ;CACvB,MAAM;CACN,MAAM;CACN,MAAM,QAAQ,KAAK,IAAI,UAAU,IAAI;CAErC,MAAM,QAAQ,MAAM,IAAI,IAAK,KAAK,QAAS,GAAG,IAAI,IAAK,KAAK,QAAS,GAAG,QAAQ,KAAK,OAAO,aAAa,IAAI,UAAU;CACvH,MAAM,QAAQ,WAAW;CACzB,IAAI,SAAS,SAAS,OAAO;EAC5B,WAAW,IAAI,WAAW,QAAQ,CAAC;EACnC,QAAQ,IAAI,aAAa,QAAQ,CAAC;EAClC,QAAQ,IAAI,aAAa,QAAQ,CAAC;EAClC,aAAa,IAAI,aAAa,QAAQ,CAAC;EACvC,SAAS,IAAI,WAAW,QAAQ,CAAC;EACjC,SAAS,IAAI,WAAW,QAAQ,CAAC;EACjC,WAAW,IAAI,WAAW,QAAQ,CAAC;EACnC,YAAY,IAAI,WAAW,QAAQ,CAAC;CACrC;CACA,SAAS,KAAK,SAAS,GAAG,KAAK;CAC/B,MAAM,SAAS;CACf,KAAK,SAAS;CACd,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;EAC/B,MAAM,QAAQ,WAAW;EACzB,MAAM,KAAK,MAAM,IAAI,IAAI,IAAI;EAC7B,MAAM,KAAK,MAAM,IAAI,IAAI,IAAI;EAC7B,MAAM,QAAQ,SAAS,MAAM,IAAI;EACjC,MAAM,QAAQ,KAAK,KAAK,KAAK;EAE7B,IAAI,QAAQ,UAAU,QAAQ,QAAQ,OAAO;EAE7C,MAAM,SAAS,KAAK,KAAK,KAAK;EAC9B,IAAI,KAAK,IAAI,MAAM,IAAI,QAAQ,KAAM;EACrC,IAAI,CAAC,YAAY,OAAO,QAAQ,CAAC,GAAG;EACpC,SAAS,KAAK;EACd,OAAO,MAAM,UAAU;EACvB,MAAM,KAAK,KAAK;CACjB;CACA,IAAI,MAAM,WAAW,GAAG;CAGxB,KAAK,MAAM,SAAS,OAAO,KAAK,KAAK,KAAK;CAC1C,IAAI,KAAK,SAAS,UAAU,SAAS,OAAO,QAAQ,KAAK;CAEzD,IAAI,SAAsB;CAC1B,IAAI,KAAK,SAAS,UAAU;EAC3B,MAAM,MAAM,MAAM,OAAO,MAAM;EAG/B,IAAI,OAAO,MAAM;EACjB,IAAI,OAAO,MAAM;EAEjB,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,CAAC,QAAQ,SAAS;GAClD,IAAI,OAAO;GACX,IAAI,QAAQ;GACZ,IAAI,QAAQ;GACZ,KAAK,MAAM,SAAS,MAAM;IACzB,MAAM,KAAK,MAAM,IAAI,IAAI,IAAI;IAC7B,MAAM,KAAK,MAAM,IAAI,IAAI,IAAI;IAC7B,MAAM,SAAS,KAAK,KAAK,KAAK;IAC9B,OAAO,KAAK,IAAI,MAAM,SAAS,MAAM,IAAI,MAAM;IAC/C,QAAQ,KAAK,IAAI,OAAO,SAAS,MAAM,IAAI,MAAM;IACjD,SAAS,KAAK,KAAK,KAAK;GACzB;GACA,QAAQ,KAAK,IAAI,QAAQ,KAAK,QAAQ,MAAM;GAE5C,MAAM,YAAY,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,KAAK;GAClD,IAAI,UAAyB;GAC7B,KAAK,IAAI,OAAO,GAAG,OAAO,GAAG,QAAQ;IACpC,MAAM,OAAO,eAAe,SAAS,KAAK,OAAO;IACjD,MAAM,MAAM,OAAO,IAAI,IAAI;IAC3B,KAAK,IAAI,OAAO,GAAG,OAAO,KAAK,CAAC,QAAQ,QAAQ;KAC/C,MAAM,SAAS,OAAO,OAAO,SAAS,mBAAmB,OAAO;KAChE,MAAM,IAAI,IAAI,IAAI,KAAK,QAAQ,KAAK;KACpC,MAAM,IAAI,IAAI,IAAI,KAAK,QAAQ,KAAK;KACpC,MAAM,QAAQ,UAAU,OAAO,KAAK,QAAQ,GAAG,CAAC;KAChD,IAAI,OAAO;MACV,IAAI,UAAU,UAAU,CAAC,KAAK,SAAS,KAAK,GAAG,YAAY;MAC3D;KACD;KACA,IAAI,CAAC,aAAa,QAAQ,IAAI,GAAG,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,YAAY,KAAK,IAAI,GAAG,IAAI,GAAG,GAAG,CAAC,GAAG;KACxF,IAAI,aAAa,QAAQ,GAAG,GAAG,MAAM,IAAI,MAAM,EAAE,KAAK,YAAY,KAAK,GAAG,GAAG,MAAM,IAAI,MAAM,EAAE,GAAG;MACjG,OAAO,MAAM;MACb,OAAO,MAAM;KACd,OAAO,KACL,MAAM,OAAO,MAAM,MAAM,MAAM,OAAO,MAAM,OAC7C,aAAa,QAAQ,GAAG,GAAG,MAAM,IAAI,MAAM,EAAE,KAC7C,YAAY,KAAK,GAAG,GAAG,MAAM,IAAI,MAAM,EAAE,GACxC;MACD,OAAO,MAAM;MACb,OAAO,MAAM;KACd,OAAO;KACP,SAAS;MAAE;MAAG;KAAE;IACjB;IACA,IAAI,QAAQ;GACb;GACA,IAAI,CAAC,UAAU,WAAW,KAAK,SAAS,UAAU,KAAK,KAAK,OAAO;QAC9D,IAAI,CAAC,QAAQ;EACnB;EACA,IAAI,QAAQ;GACX,MAAM,WAAW,SAAS,MAAM,MAAM,SAAS,MAAM,KAAK,WAAW,WAAW,MAAM,MAAM,KAAK,MAAM,IAAI,MAAM,KAAK,MAAM,EAAE;GAC9H,MAAM,SAAS,MAAM,OAAO,IAAI,IAAI,GAAG,OAAO,IAAI,IAAI,CAAC,IAAI,MAAM,OAAO,OAAO,GAAG,OAAO,OAAO,CAAC,IAAI;GACrG,MAAM,SAAS,CAAC,GAAG,IAAI;GACvB,IAAI,CAAC,QAAQ,CAAC,MAAM,SAAS,SAAS,WAAW,OAAO,QAAQ,QAAQ,QAAQ,QAAQ,GAAG,SAAS;GACpG,IAAI,MAAM,MAAM,IAAI,QAAQ,GAAG,SAAS,MAAM,MAAM,IAAI,UAAU;IAAE;IAAQ;IAAQ;IAAU;IAAQ,OAAO;GAAO,CAAC,CAAC,CAAC;GACvH,IAAI,QAAQ;IACX,EAAE,SAAS;IACX,EAAE,YAAY;KAAE,GAAG;KAAM,GAAG;IAAK;IACjC,EAAE,aAAa;IACf,MAAM,IAAI,eAAe,OAAO,IAAI,MAAM;IAC1C;GACD;EACD;CACD;CAEA,UAAU,IAAI;CACd,UAAU,IAAI;CACd,KAAK,MAAM,SAAS,CAAC,GAAG,KAAK,GAAG,UAAU,OAAO,QAAQ,OAAO,WAAW,KAAK;AACjF;;;;;;AAOA,IAAa,gBAAgB;;AAG7B,SAAS,cAAc,OAAoB;CAC1C,MAAM,EAAE,QAAQ;CAChB,KAAK,MAAM,UAAU,MAAM,MAAM,KAAK,MAAM,GAAG;EAC9C,MAAM,IAAI,OAAO,IAAI,MAAM;EAC3B,IAAI,CAAC,KAAK,EAAE,WAAW,YAAY,CAAC,EAAE,YAAY;EAClD,MAAM,SAAS,MAAM,IAAI,EAAE,UAAU;EACrC,IAAI,CAAC,UAAU,OAAO,QAAQ;GAC7B,IAAI,iBAAiB,OAAO,EAAE;GAC9B,EAAE,SAAS;GACX;EACD;EACA,MAAM,QAAQ,cAAc,OAAO,QAAQ,MAAM;EAIjD,MAAM,QAAQ,EAAE,eAAe,IAAI,YAAY,OAAO,KAAK,MAAM,QAAA,MAA0B;EAC3F,IAAI,KAAK,OAAO,EAAE,OAAO,IAAI,OAAQ,OAAO,UAAU,OAAO,QAAQ,KAAK;CAC3E;AACD;;AAGA,SAAS,WAAW,OAAc,IAAkB;CACnD,KAAK,MAAM,UAAU,MAAM,MAAM,KAAK,MAAM,GAAG;EAC9C,MAAM,IAAI,OAAO,IAAI,MAAM;EAC3B,IAAI,CAAC,KAAK,CAAC,OAAO,SAAS,OAAO,QAAQ;EAC1C,IAAI,CAAC,MAAM,IAAI,UAAU,OAAO,IAAI,KAAK,GAAG;EAC5C,UAAU,OAAO,QAAQ,GAAG,EAAE;CAC/B;AACD;;AAGA,SAAS,UAAU,OAAc,QAAgB,GAAkB,IAAkB;CAEpF,OAAO,OAAO,MAAM,GAAG,MAAM,CAAC;CAC9B,OAAO,SAAS,IAAI,MAAM;CAC1B,OAAO,SAAS,IAAI,MAAM;CAC1B,IAAI,EAAE,WAAW,UAAU;EAC1B,IAAI,EAAE,OAAO,YAAY,OAAO,QAAQ,GAAG,EAAE;EAC7C,OAAO,OAAO,OAAO,QAAQ,GAAG,EAAE;CACnC;CAEA,IAAI,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,IAAK;EACpD,MAAM,UAAU,MAAM,MAAM,IAAI,MAAM,EAAE;EACxC,OAAO,SAAS,cAAc,OAAO,QAAQ,SAAS,WAAW,OAAO,MAAM,IAAI,EAAE;CACrF;CACA,MAAM,WAAW,aAAa,OAAO,QAAQ,CAAC;CAC9C,IAAI,aAAa,KAAA,GAAW;CAC5B,IAAI,YAAY,EAAE,OAAO,OAAO,OAAO,OAAO,MAAM;CACpD,YAAY,OAAO,QAAQ,CAAC;CAC5B,YAAY,OAAO,QAAQ,CAAC;CAC5B,cAAc,OAAO,QAAQ,GAAG,UAAU,EAAE;AAC7C;;AAGA,IAAM,YAAY;;AAElB,IAAM,aAAa;;AAEnB,IAAM,aAAa;;;;;;;;;AAUnB,SAAS,YAAY,OAAc,QAAgB,GAAkB,IAAkB;CACtF,MAAM,QAAQ,EAAE;CAChB,IAAI,EAAE,YAAY,OAAO,OAAO,SAAS,KAAK,KAAK,OAAO,KAAK,KAAK,KAAK,WAAW;CACpF,EAAE,eAAe;CACjB,IAAI,EAAE,cAAc,eAAe,MAAM,OAAO,OAAO,MAAM,wBAAwB,GAAG;CACxF,EAAE,cAAc;CAChB,MAAM,SAAS,EAAE,aAAa,KAAK;CACnC,IAAI,QAAQ,YAAY,OAAO,WAAW,CAAC;CAG3C,MAAM,SAAS,EAAE,cAAc,KAAA,IAAY,SAAS,OAAO,QAAQ,OAAO,EAAE,SAAS,IAAI,KAAA;CACzF,IAAI,QAAQ,EAAE,QAAQ;CACtB,MAAM,KAAK,EAAE;CACb,IAAI,UAAU,CAAC,WAAW,OAAO,QAAQ,EAAE,GAAG;EAE7C,IAAI,EAAE,cAAc,KAAA,GAAW,QAAQ,OAAO,QAAQ,IAAI,EAAE,WAAW,EAAE,eAAe,OAAO,MAAM;OAChG,OAAO,OAAO,QAAQ,IAAI;GAAE,QAAQ,EAAE,eAAe,OAAO;GAAQ,OAAO;EAAK,CAAC;EACtF,EAAE,QAAQ;CACX;CAEA,IAAI,QAAQ,OAAO,EAAE;MAChB,EAAE,YAAY;CACnB,IAAI,EAAE,WAAW,UAAU,EAAE,aAAa;AAC3C;;AAGA,SAAS,OAAO,OAAc,QAAgB,GAAkB,IAAkB;CACjF,IAAI,EAAE,gBAAgB,MAAM;CAC5B,OAAO,SAAS,cAAc,OAAO,QAAQ,EAAE,aAAa,WAAW,OAAO,MAAM,IAAI,EAAE;CAC1F,IAAI,OAAO,WAAW,EAAE,aAAa,EAAE,cAAc;AACtD;;AAGA,SAAS,aAAa,OAAc,QAAgB,GAAsC;CACzF,IAAI,CAAC,EAAE,YAAY,OAAO,KAAK,OAAO,KAAK,EAAE,IAAI;CACjD,MAAM,SAAS,MAAM,IAAI,EAAE,UAAU;CACrC,OAAO,SAAS,aAAa,QAAQ,MAAM,IAAI,KAAA;AAChD;;;;;AAMA,SAAS,YAAY,OAAc,QAAgB,GAAwB;CAC1E,IAAI,CAAC,EAAE,QAAQ;CACf,MAAM,OAAO,KAAK,OAAO,KAAK,EAAE,MAAM;CACtC,MAAM,MAAM,EAAE,aAAa,EAAE;CAC7B,MAAM,UAAU,OAAO,IAAI,IAAI,EAAE,OAAO,MAAM,IAAI,IAAI,EAAE,OAAO,MAAM,OAAO,IAAI,IAAI,EAAE,OAAO,MAAM,IAAI,IAAI,EAAE,OAAO,KAAK;CACzH,IAAK,EAAE,cAAc,UAAW,QAAQ,MAAO,EAAE,cAAc,OAAQ,EAAE,YAAY,KAAK,IAAK;EAC9F,EAAE,SAAS,KAAA;EACX,KAAK,OAAO,MAAM;CACnB,OAAO,IAAI,CAAC,EAAE,cAAc,QAAQ,gBAAgB;EACnD,EAAE,aAAa;EACf,MAAM,KAAK,EAAE,aAAa,EAAE,WAAW,EAAE;EACzC,IAAI,KAAK,GAAG,IAAI,EAAE,OAAO;EACzB,IAAI,KAAK,GAAG,IAAI,EAAE,OAAO;EACzB,MAAM,OAAO,MAAM,IAAI,EAAE;EACzB,IAAI,OAAO,aAAa;GACvB,MAAM,cAAc;GACpB,MAAM,cAAc;EACrB;EACA,MAAM,IAAI,eAAe,OAAO,IAAI;GAAE,GAAG,EAAE,OAAO,IAAI;GAAI,GAAG,EAAE,OAAO,IAAI;EAAG,CAAC;CAC/E;AACD;;;;;AAMA,SAAS,YAAY,OAAc,QAAgB,GAAwB;CAC1E,IAAI,EAAE,UAAU,EAAE,EAAE,SAAS,EAAE,iBAAiB,KAAA,IAAY;CAC5D,MAAM,OAAO,OAAO,OAAO,MAAM;CACjC,IAAI,QAAQ;CACZ,IAAI,SAAS,KAAA,KAAa,EAAE,iBAAiB,MAAM,UAAW,QAAQ,IAAI,MAAM,OAAO,KAAK,MAAM,QAAA,MAA0B,GAAG;EAC9H,UAAU,OAAO,QAAQ,IAAI;EAC7B,QAAQ;CACT;CACA,IAAI,SAAU,EAAE,WAAW,KAAK,OAAO,KAAK,EAAE,OAAO,IAAI,UAAU,MAAM,IAAI,GAAI;EAChF,MAAM,OAAO,EAAE,QAAQ,aAAa,MAAM,IAAI,EAAE;EAChD,IAAI,SAAS,CAAC,EAAE,WAAW,KAAK,MAAM,EAAE,OAAO,IAAI,IAAK,KAAK,OAAO,MAAM;CAC3E;AACD;;;;;AAMA,SAAS,cAAc,OAAc,QAAgB,GAAkB,UAAkB,IAAkB;CAE1G,MAAM,WAAW,MAAM,OAAO,IAAI,IAAI,MAAM,IAAI,OAAO,IAAI,IAAI,MAAM,EAAE;CACvE,IAAI,MAAM,OAAO,EAAE,OAAO,KAAK,MAAM,OAAO,EAAE,OAAO,GAAG;EACvD,EAAE,OAAO,IAAI,MAAM;EACnB,EAAE,OAAO,IAAI,MAAM;EACnB,EAAE,eAAe;CAClB;CAGA,EAAE,WADW,EAAE,QAAQ,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,IAAI,EAAE,QAAQ,aAAa,WAAW,EAAE,QAAQ,OAAO,IAAI,SAAS,IAAI,MACvG,EAAE,eAAe,YAAY,EAAE,YAAY,KAAK,KAAK;CAK1E,IAAI,CAAC,EAAE,UAAU,CAAC,EAAE,UAAU,MAAM,OAAO,OAAO,MAAM,wBAAwB,GAAG,UAAU,OAAO,QAAQ,KAAK;CAEjH,IAAI,WAAW,EAAE,eAAe,IAAK;EACpC,EAAE,eAAe;EACjB,EAAE,cAAc;EAEhB,IAAI,EAAE,SAAS,YAAY,EAAE,WAAW,YAAY,WAAW;GAC9D,OAAO,EAAE;GACT,OAAO,EAAE;EACV;EACA,IAAI,CAAC,EAAE,UAAU,EAAE,YAAY,KAAK,mBAAmB,MAAM,OAAO,OAAO,MAAM,sBAAsB,GAAG,QAAQ,OAAO,MAAM;EAC/H;CACD;CACA,EAAE,eAAe;CACjB,KAAK,CAAC,EAAE,UAAU,EAAE,cAAc,KAAK,gBAAgB,EAAE,cAAc,mBAAmB,MAAM,OAAO,OAAO,MAAM,sBAAsB,GACzI,QAAQ,OAAO,MAAM;CAEtB,IAAI,CAAC,EAAE,YAAY;EAElB,MAAM,SAAS,EAAE,WAAW,EAAE,cAAc,EAAE,WAAW,CAAC,EAAE;EAC5D,IAAI,UAAU,EAAE,cAAc,OAAQ,WAAW,EAAE,QAAQ,KAAK,WAAW,OAAO,QAAQ,CAAC,GAAG;EAC9F,IAAI,UAAU,EAAE,cAAc,QAAS,MAAM,OAAO,OAAO,MAAM,wBAAwB,KAAK,OAAO,OAAO,QAAQ,CAAC,GAAG;EACxH,IAAI,UAAU,EAAE,cAAc,QAAS,MAAM,OAAO,OAAO,MAAM,wBAAwB,KAAK,WAAW,OAAO,QAAQ,CAAC,GAAG;EAC5H,IAAI,UAAU,EAAE,cAAc,kBAAkB,WAAW,eAAe,MAAM,OAAO,OAAO,MAAM,sBAAsB,GAAG;GAC5H,MAAM,OAAO,QAAQ,CAAC;GACtB,WAAW,OAAO,QAAQ,CAAC;EAC5B;EAGA,MAAM,QAAQ,EAAE,SAAU,EAAE,cAAc,OAAQ,WAAW,EAAE,QAAQ,KAAK,UAAU,OAAO,QAAQ,CAAC;EACtG,IAAI,SAAS,EAAE,cAAc,OAAQ,WAAW,EAAE,QAAQ,KAAK,0BAA0B,OAAO,MAAM,GAAG,OAAO,OAAO,MAAM;OACxH,IAAI,SAAS,EAAE,cAAc,MAAO,WAAW,MAAM,OAAO,OAAO,MAAM;CAC/E;CACA,IAAI,EAAE,WAAW,YAAY,EAAE,cAAc,SAAS;EAErD,IAAI,CAAC,EAAE,cAAc,WAAW,MAAM,EAAE,SAAS,EAAE,SAAS,UAAU,OAAO,QAAQ,CAAC,IAAI,OAAO,OAAO,MAAM;OACzG,IAAI,CAAC,EAAE,UAAU,EAAE,SAAS,KAAK,SAAS,CAAC,aAAa,QAAQ,CAAC,KAAK,YAAY,OAAO,MAAM,GAAG,SAAS,OAAO,QAAQ,GAAG,QAAQ;OAErI,IAAI,CAAC,EAAE,cAAc,WAAW,GAAG,OAAO,OAAO,MAAM;OACvD;GACJ,MAAM,IAAI,iBAAiB,OAAO,EAAE;GACpC,EAAE,SAAS;GACX,EAAE,QAAQ;EACX;CACD;AACD;;AAGA,IAAM,UAAU;;AAEhB,IAAM,QAAQ;;AAEd,IAAM,YAAY;;;;;AAMlB,SAAS,UAAU,OAAc,QAAgB,GAA2B;CAC3E,OAAO,CAAC,CAAC,WAAW,OAAO,QAAQ,EAAE,MAAM,IAAI;AAChD;;;;;AAMA,SAAS,WAAW,OAAc,QAAgB,OAAa,WAAW,OAA2B;CACpG,MAAM,QAAQ,MAAM,MAAM,GAAG,MAAM,GAAG,OAAO,IAAI,SAAS,GAAG,QAAQ;CACrE,IAAI;CACJ,IAAI,OAAO;CACX,KAAK,MAAM,SAAS,UAAU;EAC7B,IAAI,UAAU,UAAU,MAAM,UAAU,MAAM,WAAW,OAAO,UAAU,CAAC,MAAM,IAAI,MAAM,GAAG;EAC9F,MAAM,KAAK,MAAM,IAAI,MAAM;EAC3B,MAAM,OAAO,OAAO,IAAI,SAAS,MAAM,IAAI;EAC3C,IAAI,GAAG,WAAW,YAAY,EAAE,YAAY,MAAM,GAAG,KAAK,IAAI,MAAM,GAAG,GAAG,KAAK,IAAI,MAAM,CAAC,IAAI,OAAO;EACrG,MAAM,IAAI,MAAM,MAAM,IAAI,IAAI,MAAM,GAAG,MAAM,IAAI,IAAI,MAAM,CAAC;EAC5D,IAAI,IAAI,QAAQ,IAAI,MAAM;GACzB,OAAO;GACP,UAAU;EACX;CACD;CACA,OAAO;AACR;;;;;;;AAQA,SAAS,WAAW,OAAc,QAAgB,GAA2B;CAC5E,MAAM,SAAS,SAAS,OAAO,QAAQ,EAAE,MAAM,EAAE,OAAO;CACxD,IAAI,CAAC,QAAQ,OAAO;CACpB,QAAQ,OAAO,QAAQ,QAAQ,EAAE,SAAS,EAAE,WAAW;CACvD,OAAO;AACR;;;;;AAMA,SAAS,SAAS,OAAc,QAAgB,OAAa,OAAiC;CAC7F,MAAM,QAAQ,WAAW,OAAO,QAAQ,KAAK;CAC7C,MAAM,KAAK,OAAO,IAAI,MAAM;CAC5B,IAAI,CAAC,SAAS,CAAC,IAAI,SAAS,GAAG,cAAc,SAAS,MAAM,IAAI,OAAO,OAAO,IAAI,MAAM,MAAM,OAAO,SAAS,GAAG;CACjH,IAAI,KAAK,MAAM,KAAK,GAAG,KAAK,KAAK,aAAa,KAAK,GAAG,OAAO,KAAK,KAAK,WAAW;CAClF,MAAM,SAAS,GAAG;CAClB,GAAG,QAAQ;EAAE,GAAG,MAAM;EAAG,GAAG,MAAM;CAAE;CACpC,OAAO,GAAG;CACV,OAAO;AACR;;AAGA,IAAM,aAAa;;AAEnB,IAAM,QAAQ;;;;;;AAOd,SAAS,MAAM,OAAc,QAAgB,GAAwB;CACpE,MAAM,KAAK,EAAE,KAAK,IAAI,OAAO,IAAI;CACjC,MAAM,KAAK,EAAE,KAAK,IAAI,OAAO,IAAI;CACjC,MAAM,QAAQ,MAAM,OAAO,IAAI,GAAG,OAAO,IAAI,GAAG,OAAO,IAAI,SAAS,KAAK,QAAQ;CACjF,MAAM,OAAO,CAAC,GAAG,QAAQ;CACzB,KAAK,MAAM,SAAS,MAAM;EACzB,MAAM,KAAK,MAAM,IAAI,MAAM;EAC3B,IAAI,UAAU,UAAU,CAAC,IAAI,SAAS,GAAG,cAAc,EAAE,WAAW,GAAG,WAAW,YAAY,MAAM,OAAO,SAAS,KAAK,GAAG,UAAU;EACtI,MAAM,KAAK,MAAM,IAAI,IAAI,OAAO,IAAI;EACpC,MAAM,KAAK,MAAM,IAAI,IAAI,OAAO,IAAI;EACpC,MAAM,QAAQ,MAAM,IAAI,EAAE;EAC1B,IAAI,KAAK,KAAK,KAAK,MAAM,KAAK,QAAQ,OAAO,IAAI,SAAS,MAAM,IAAI,SAAS,OAAQ,QAAQ,KAAM;EACnG,MAAM,IAAI,MAAM,IAAI,IAAK,KAAK,QAAS;EACvC,MAAM,IAAI,MAAM,IAAI,IAAK,KAAK,QAAS;EACvC,IAAI,CAAC,WAAW,MAAM,OAAO,KAAK,GAAG,GAAG,CAAC,GAAG;EAC5C,OAAO,OAAO,OAAO;GAAE;GAAG;EAAE,GAAG;GAAE,QAAQ,GAAG,eAAe,MAAM;GAAQ,OAAO;EAAK,CAAC;EACtF,GAAG,aAAa;CACjB;AACD;;;;;AAMA,SAAS,WAAW,OAAc,QAAgB,GAAwB;CACzE,MAAM,QAAQ,WAAW,OAAO,QAAQ,EAAE,IAAI;CAC9C,IAAI,CAAC,SAAS,MAAM,IAAI,MAAM,CAAC,CAAE,cAAc,EAAE,SAAS;CAC1D,MAAM,KAAK,EAAE,KAAK,IAAI,OAAO,IAAI;CACjC,MAAM,KAAK,EAAE,KAAK,IAAI,OAAO,IAAI;CACjC,MAAM,SAAS,MAAM,IAAI,EAAE;CAC3B,IAAI,SAAS,OAAQ,CAAC,MAAM,IAAI,UAAU,OAAO,IAAI,KAAK,GAAG;CAC7D,UAAU,IAAI,KAAK;CACnB,UAAU,IAAI,KAAK;CACnB,UAAU,OAAO,QAAQ,OAAO,WAAW,KAAK;AACjD;;AAGA,SAAS,QAAQ,OAAc,QAAgB,OAAa,SAAiB,QAA6B;CACzG,OAAO,OAAO,QAAQ,OAAO;EAAE;EAAS,QAAQ,UAAU,KAAA;CAAU,CAAC;CACrE,WAAW,MAAM,CAAC,CAAC,YAAY;AAChC;;AAGA,IAAM,cAAc;;;;;;;;AASpB,SAAS,OAAO,OAAc,QAAgB,GAA2B;CACxE,MAAM,OAAO,KAAK,OAAO,KAAK,EAAE,IAAI;CACpC,MAAM,QAAQ,MAAM,OAAO,IAAI,GAAG,OAAO,IAAI,GAAG,OAAO,IAAI,SAAS,KAAK,QAAQ;CACjF,IAAI;CACJ,IAAI,UAAU,OAAO;CACrB,KAAK,MAAM,SAAS,UAAU;EAC7B,MAAM,KAAK,MAAM,IAAI,MAAM;EAC3B,IACC,UAAU,UACV,CAAC,IAAI,SACL,GAAG,cAAc,EAAE,WACnB,MAAM,IAAI,OAAO,OAAO,IAAI,MAC5B,GAAG,WAAW,YACd,MAAM,OAAO,SAAS,KACtB,GAAG,UAEH;EACD,IAAI,eAAe,OAAO,KAAK,KAAK,IAAI,OAAO,IAAI,SAAS,OAAQ,KAAK,MAAM,KAAK,GAAG,KAAK,IAAI,WAAW;EAC3G,IAAI,KAAK,OAAO,KAAK,GAAG,KAAK,IAAI,OAAO,IAAI,SAAS,MAAM,IAAI,SAAS,IAAK;EAC7E,MAAM,IAAI,KAAK,MAAM,KAAK,EAAE,IAAI;EAChC,IAAI,IAAI,SAAS;GAChB,UAAU;GACV,OAAO;EACR;CACD;CACA,IAAI,CAAC,MAAM,OAAO;CAClB,MAAM,SAAS,KAAK,IAAI,MAAM,CAAC,CAAE;CACjC,QAAQ,OAAO,MAAM;EAAE,GAAG,EAAE,KAAK;EAAG,GAAG,EAAE,KAAK;CAAE,GAAG,EAAE,SAAS,EAAE,WAAW;CAC3E,QAAQ,OAAO,QAAQ,QAAQ,EAAE,SAAS,EAAE,WAAW;CACvD,OAAO;AACR;;AAGA,IAAM,gBAAgB;;;;;;AAOtB,SAAS,WAAW,OAAc,QAAgB,GAA2B;CAC5E,MAAM,OAAO,KAAK,OAAO,KAAK,EAAE,IAAI;CACpC,MAAM,QAAQ,MAAM,OAAO,IAAI,GAAG,OAAO,IAAI,GAAG,OAAO,IAAI,SAAS,KAAK,QAAQ;CACjF,IAAI;CACJ,IAAI,OAAO;CACX,KAAK,MAAM,SAAS,UAAU;EAC7B,MAAM,KAAK,MAAM,IAAI,MAAM;EAC3B,IACC,UAAU,UACV,CAAC,MACD,GAAG,WAAW,YACd,GAAG,SACH,GAAG,cACH,GAAG,YAAY,EAAE,WACjB,GAAG,cAAc,EAAE,WACnB,MAAM,IAAI,OAAO,OAAO,IAAI,MAC5B,MAAM,OAAO,SAAS,KACrB,MAAM,OAAO,WAAW,KAAK,MAAM,OAAO,EAAE,CAAC,SAAS,UACvD,eAAe,OAAO,KAAK,KAAK,IAAI,OAAO,IAAI,SAAS,KAExD;EACD,MAAM,UAAU,OAAO,KAAK,MAAM,KAAK,GAAG,IAAI,IAAI,KAAK,OAAO,KAAK,GAAG,IAAI,IAAI,KAAK,MAAM,KAAK,EAAE,IAAI;EACpG,IAAI,UAAU,MAAM;GACnB,OAAO;GACP,OAAO;EACR;CACD;CACA,IAAI,CAAC,MAAM,OAAO;CAClB,MAAM,OAAO,KAAK,IAAI,MAAM,CAAC,CAAE;CAC/B,MAAM,SAAS;EAAE,GAAG,KAAK;EAAG,GAAG,KAAK;CAAE;CACtC,QAAQ,OAAO,MAAM;EAAE,GAAG,EAAE,KAAK;EAAG,GAAG,EAAE,KAAK;CAAE,GAAG,EAAE,SAAS,EAAE,WAAW;CAC3E,QAAQ,OAAO,QAAQ,QAAQ,EAAE,SAAS,EAAE,WAAW;CACvD,OAAO;AACR;;;;;AAMA,SAAS,aAAa,QAAgB,GAA2B;CAChE,MAAM,KAAK,EAAE,WAAW,EAAE;CAC1B,OAAO,MAAM,OAAO,IAAI,IAAI,MAAM,IAAI,OAAO,IAAI,IAAI,MAAM,EAAE,IAAI,OAAO,IAAI,SAAS,MAAO,MAAM,MAAM,KAAK,GAAG,GAAG,MAAM,KAAK,GAAG,CAAC,IAAI;AACvI;;;;;;AAOA,SAAS,YAAY,OAAc,QAAyB;CAC3D,MAAM,QAAQ,MAAM,OAAO,IAAI,GAAG,OAAO,IAAI,GAAG,OAAO,IAAI,SAAS,KAAK,QAAQ;CACjF,KAAK,MAAM,SAAS,UAAU;EAC7B,MAAM,KAAK,MAAM,IAAI,MAAM;EAC3B,IAAI,UAAU,UAAU,CAAC,MAAM,GAAG,YAAY,GAAG,SAAS,GAAG,UAAU,MAAM,UAAU,CAAC,MAAM,SAAS,MAAM,WAAW,OAAO,QAAQ;EACvI,IAAI,eAAe,OAAO,KAAK,KAAK,IAAI,OAAO,IAAI,SAAS,IAAK,OAAO;CACzE;CACA,OAAO;AACR;;;;;;AAOA,SAAS,SAAS,OAAc,QAAgB,GAAkB,UAAwB;CACzF,EAAE,SAAS,EAAE,SAAS,KAAK;CAC3B,EAAE,UAAU;CACZ,EAAE,cAAc;CAChB,EAAE,WAAW;CACb,EAAE,SAAS,KAAA;CACX,KAAK,OAAO,MAAM;CAElB,IAAI,CAAC,MAAM,IAAI,UAAU,OAAO,IAAI,KAAK,GAAG;CAC5C,EAAE,OAAO,IAAI,MAAM;CACnB,EAAE,OAAO,IAAI,MAAM;CACnB,EAAE,eAAe,MAAM,OAAO,IAAI,IAAI,MAAM,IAAI,OAAO,IAAI,IAAI,MAAM,EAAE;CACvE,YAAY,OAAO,QAAQ,OAAO,IAAI;CACtC,IAAI,CAAC,EAAE,QAAQ,QAAQ,OAAO,MAAM;AACrC;AAEA,IAAa,iBAAyB;CACrC,MAAM;CACN,OAAO;CACP,OAAO,OAAO,IAAI;EACjB,aAAa,KAAK;EAClB,cAAc,KAAK;EACnB,MAAM,IAAI,OAAO,EAAE;EACnB,WAAW,OAAO,EAAE;CACrB;AACD"}

package/dist/systems/orders.js

@@ -0,0 +1,64 @@
+import { orderSays } from "../orders/facts.js";
+import { constructionSite } from "./construction.js";
+import { fighting } from "../entity.js";
+import { isStunned } from "../abilities/buffs.js";
+import { halt } from "./movement.js";
+import { cancelSwing } from "./combat.js";
+import { dashing } from "../dashing.js";
+import { clearOrders, completeOrder } from "../orders/queue.js";
+import { idle } from "../orders/idle.js";
+import { controlled, steerControlled } from "../abilities/control.js";
+//#region src/systems/orders.ts
+/** Runs the order at the front of every queue */
+var orderSystem = {
+	name: "orders",
+	phase: "decide",
+	update(world, dt) {
+		for (const entity of world.units.values()) {
+			if (!entity.alive || entity.isStructure && entity.has(constructionSite)) continue;
+			if (isStunned(world, entity)) {
+				if (orderSays(world, entity, "channelling")) clearOrders(world, entity);
+				halt(world, entity);
+				cancelSwing(world, entity);
+				continue;
+			}
+			if ((entity.buffs.length || entity.has(controlled)) && steerControlled(world, entity, dt)) continue;
+			const dash = entity.get(dashing);
+			if (dash && (dash.height || dash.pulled)) continue;
+			if (entity.get(fighting)?.recovery !== void 0) continue;
+			const order = entity.orders[0];
+			if (!order) {
+				if (!entity.hidden) idle(world, entity, dt);
+				continue;
+			}
+			try {
+				runOrder(world, entity, order, dt);
+			} catch (error) {
+				world.caught(error, {
+					kind: "order",
+					id: order.type,
+					entity: entity.id
+				});
+				dropOrder(world, entity, order);
+			}
+		}
+	}
+};
+/** Takes an order that threw off its unit, without asking the order anything more: it stands where it is */
+function dropOrder(world, entity, order) {
+	entity.removeOrder(order);
+	if (entity.alive) halt(world, entity);
+}
+/** One tick of an order: started when it has not been, and taken off the queue when it is over */
+function runOrder(world, entity, order, dt) {
+	const behavior = world.registry.order(order.type);
+	if (!order.started) {
+		order.started = true;
+		behavior.start?.(world, entity, order);
+	}
+	if (behavior.update(world, entity, order, dt) !== "running" && entity.alive) completeOrder(world, entity, order);
+}
+//#endregion
+export { orderSystem, runOrder };
+
+//# sourceMappingURL=orders.js.map

package/dist/systems/orders.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"orders.js","names":[],"sources":["../../src/systems/orders.ts"],"sourcesContent":["import { clearOrders } from '#engine/orders/queue'\nimport { orderSays } from '../orders/facts'\nimport { constructionSite } from './construction'\nimport { isStunned } from '#engine/abilities/buffs'\nimport { idle } from '#engine/orders/idle'\nimport { completeOrder } from '#engine/orders/queue'\nimport type { Entity, Order } from '#engine/entity'\nimport type { System } from '#engine/registry'\nimport type { World } from '#engine/world'\nimport { cancelSwing } from './combat'\nimport { fighting } from '#engine/entity'\nimport { halt } from './movement'\nimport { dashing } from '../dashing'\nimport { controlled, steerControlled } from '#engine/abilities/control'\n\n/** Runs the order at the front of every queue */\nexport const orderSystem: System = {\n\tname: 'orders',\n\tphase: 'decide',\n\tupdate(world, dt) {\n\t\tfor (const entity of world.units.values()) {\n\t\t\t// (a site is a structure's: what moves is never one, and is most of what there is)\n\t\t\tif (!entity.alive || (entity.isStructure && entity.has(constructionSite))) continue\n\t\t\tif (isStunned(world, entity)) {\n\t\t\t\t// out cold: whatever it was doing waits, but what it was keeping up is broken off\n\t\t\t\tif (orderSays(world, entity, 'channelling')) clearOrders(world, entity)\n\t\t\t\thalt(world, entity)\n\t\t\t\tcancelSwing(world, entity)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\t// a buff takes its orders (fear, charm, taunt): what it was told waits, and goes on once it lets go\n\t\t\tif ((entity.buffs.length || entity.has(controlled)) && steerControlled(world, entity, dt)) continue\n\t\t\t// in the air, on a leap or thrown, or dragged by a pull: what it was doing goes on when it is let go\n\t\t\tconst dash = entity.get(dashing)\n\t\t\tif (dash && (dash.height || dash.pulled)) continue\n\t\t\t// in the recovery after a blow (`AttackDef.recovery`): held, what it was told waits until it is over\n\t\t\tif (entity.get(fighting)?.recovery !== undefined) continue\n\t\t\tconst order = entity.orders[0]\n\t\t\tif (!order) {\n\t\t\t\tif (!entity.hidden) idle(world, entity, dt)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\ttry {\n\t\t\t\trunOrder(world, entity, order, dt)\n\t\t\t} catch (error) {\n\t\t\t\t// what the world says of errors (`World.caught`): it throws, or the order is taken off the unit\n\t\t\t\tworld.caught(error, { kind: 'order', id: order.type, entity: entity.id })\n\t\t\t\tdropOrder(world, entity, order)\n\t\t\t}\n\t\t}\n\t}\n}\n\n/** Takes an order that threw off its unit, without asking the order anything more: it stands where it is */\nfunction dropOrder(world: World, entity: Entity, order: Order): void {\n\tentity.removeOrder(order)\n\tif (entity.alive) halt(world, entity)\n}\n\n/** One tick of an order: started when it has not been, and taken off the queue when it is over */\nexport function runOrder(world: World, entity: Entity, order: Order, dt: number): void {\n\tconst behavior = world.registry.order(order.type)\n\tif (!order.started) {\n\t\torder.started = true\n\t\tbehavior.start?.(world, entity, order)\n\t}\n\tconst status = behavior.update(world, entity, order, dt)\n\tif (status !== 'running' && entity.alive) completeOrder(world, entity, order)\n}\n"],"mappings":";;;;;;;;;;;;AAgBA,IAAa,cAAsB;CAClC,MAAM;CACN,OAAO;CACP,OAAO,OAAO,IAAI;EACjB,KAAK,MAAM,UAAU,MAAM,MAAM,OAAO,GAAG;GAE1C,IAAI,CAAC,OAAO,SAAU,OAAO,eAAe,OAAO,IAAI,gBAAgB,GAAI;GAC3E,IAAI,UAAU,OAAO,MAAM,GAAG;IAE7B,IAAI,UAAU,OAAO,QAAQ,aAAa,GAAG,YAAY,OAAO,MAAM;IACtE,KAAK,OAAO,MAAM;IAClB,YAAY,OAAO,MAAM;IACzB;GACD;GAEA,KAAK,OAAO,MAAM,UAAU,OAAO,IAAI,UAAU,MAAM,gBAAgB,OAAO,QAAQ,EAAE,GAAG;GAE3F,MAAM,OAAO,OAAO,IAAI,OAAO;GAC/B,IAAI,SAAS,KAAK,UAAU,KAAK,SAAS;GAE1C,IAAI,OAAO,IAAI,QAAQ,CAAC,EAAE,aAAa,KAAA,GAAW;GAClD,MAAM,QAAQ,OAAO,OAAO;GAC5B,IAAI,CAAC,OAAO;IACX,IAAI,CAAC,OAAO,QAAQ,KAAK,OAAO,QAAQ,EAAE;IAC1C;GACD;GACA,IAAI;IACH,SAAS,OAAO,QAAQ,OAAO,EAAE;GAClC,SAAS,OAAO;IAEf,MAAM,OAAO,OAAO;KAAE,MAAM;KAAS,IAAI,MAAM;KAAM,QAAQ,OAAO;IAAG,CAAC;IACxE,UAAU,OAAO,QAAQ,KAAK;GAC/B;EACD;CACD;AACD;;AAGA,SAAS,UAAU,OAAc,QAAgB,OAAoB;CACpE,OAAO,YAAY,KAAK;CACxB,IAAI,OAAO,OAAO,KAAK,OAAO,MAAM;AACrC;;AAGA,SAAgB,SAAS,OAAc,QAAgB,OAAc,IAAkB;CACtF,MAAM,WAAW,MAAM,SAAS,MAAM,MAAM,IAAI;CAChD,IAAI,CAAC,MAAM,SAAS;EACnB,MAAM,UAAU;EAChB,SAAS,QAAQ,OAAO,QAAQ,KAAK;CACtC;CAEA,IADe,SAAS,OAAO,OAAO,QAAQ,OAAO,EACjD,MAAW,aAAa,OAAO,OAAO,cAAc,OAAO,QAAQ,KAAK;AAC7E"}

package/dist/systems/production.js

@@ -0,0 +1,322 @@
+import { atan2 } from "../exactMath.js";
+import { closestPointOnRect } from "../math.js";
+import { supplyPoolsOf, upgradesOf } from "../defs.js";
+import { morphStarted, researchFinished, unitTrained } from "../engineEvents.js";
+import { replicateEvent } from "../replication.js";
+import { deposit } from "../entity.js";
+import { shortOf, spend } from "../player.js";
+import { engineMessage } from "../messages.js";
+import { trainRefusal } from "../shared.js";
+import { giveBack, productionOf, productionQueue } from "./productionQueue.js";
+import { heroState, heroesOf, reviveCost, reviveHero } from "../hero.js";
+import { createOrder, giveOrder } from "../orders/queue.js";
+import { gathering } from "../orders/harvest.js";
+import { morph, techOf, unlocked } from "../tech.js";
+//#region src/systems/production.ts
+function hasRoom(world, building) {
+	if (productionOf(building).queue.length < world.settings.production.queue) return true;
+	world.message(building.owner, engineMessage("queueFull"));
+	return false;
+}
+/**
+* Lets the `beforeProduce` hook have its say about something about to be made, then has the player pay for it.
+* What it ends up costing and how long it takes, or undefined when it is not made (and the player was told why).
+* `producer` is the building it is made in, or the worker putting down a structure
+*/
+function startProducing(world, producer, kind, id, cost, time) {
+	const player = world.player(producer.owner);
+	const event = world.hooks.run("beforeProduce", {
+		player: player.id,
+		producer,
+		kind,
+		id,
+		cost: { ...cost },
+		time,
+		cancelled: false
+	});
+	if (event.cancelled) {
+		if (event.reason) world.message(player.id, event.reason);
+		return;
+	}
+	const short = shortOf(player.resources, event.cost);
+	if (short) {
+		world.message(player.id, engineMessage("notEnough", { resource: short }));
+		return;
+	}
+	spend(world, player.id, event.cost, kind, id);
+	return event;
+}
+/** Queues a unit for training. Returns false (and tells the player why) when that is not possible. */
+function enqueueProduction(world, building, unitType) {
+	const production = productionOf(building);
+	if (!production || !building.operational || !building.def.trains?.includes(unitType)) return false;
+	const def = world.registry.unit(unitType);
+	const player = world.player(building.owner);
+	if (!hasRoom(world, building)) return false;
+	if (!unlocked(world, player.id, "unit", unitType, def.requires)) return false;
+	const refusal = trainRefusal(world.registry, def, playerFacts(world, player.id), {
+		cost: false,
+		tech: false
+	});
+	if (refusal) {
+		world.message(player.id, refusal);
+		return false;
+	}
+	const supply = world.settings.supply.of(world, {
+		def,
+		owner: player.id,
+		queued: true
+	});
+	const made = startProducing(world, building, "unit", unitType, def.cost, def.buildTime ?? 1);
+	if (!made) return false;
+	player.supplyUsed += supply;
+	const pools = supplyPoolsOf(def);
+	for (const name in pools) if (player.supplies[name]) player.supplies[name].used += pools[name];
+	production.queue.push({
+		kind: "unit",
+		id: unitType,
+		paid: made.cost,
+		progress: 0,
+		duration: made.time
+	});
+	return true;
+}
+/**
+* What there is to know about a player for whether they can make something, see `trainRefusal`
+*
+* @beta
+*/
+function playerFacts(world, playerId) {
+	const player = world.player(playerId);
+	const heroes = heroesOf(world, playerId).map((hero) => hero.def.id);
+	for (const other of world.index.ownedBy(playerId)) {
+		const production = productionOf(other);
+		if (!production) continue;
+		for (const item of production.queue) if (item.kind === "unit" && world.registry.unit(item.id).hero) heroes.push(item.id);
+	}
+	return {
+		resources: player.resources,
+		supplyUsed: player.supplyUsed,
+		supplyCap: player.supplyCap,
+		...Object.keys(player.supplies).length > 0 && { supplies: player.supplies },
+		tech: techOf(world, playerId),
+		heroes,
+		...player.race !== void 0 && { race: player.race }
+	};
+}
+/**
+* Levels of an upgrade a player has, counting the one being researched
+*
+* @beta
+*/
+function upgradeLevel(world, playerId, upgrade) {
+	const player = world.player(playerId);
+	return {
+		level: player.upgrades.get(upgrade) ?? 0,
+		researching: player.researching.has(upgrade)
+	};
+}
+/** Queues an upgrade. One level at a time, and only in one building at once. */
+function enqueueResearch(world, building, upgrade) {
+	const production = productionOf(building);
+	if (!production || !building.operational || !building.def.researches?.includes(upgrade)) return false;
+	const def = world.registry.upgrade(upgrade);
+	const player = world.player(building.owner);
+	const { level, researching } = upgradeLevel(world, player.id, upgrade);
+	if (researching) {
+		world.message(player.id, engineMessage("alreadyResearching"));
+		return false;
+	}
+	if (level >= (def.maxLevel ?? 1)) return false;
+	if (!unlocked(world, player.id, "upgrade", upgrade, def.requires?.[level], level + 1)) return false;
+	if (!hasRoom(world, building)) return false;
+	const made = startProducing(world, building, "upgrade", upgrade, def.cost, def.researchTime);
+	if (!made) return false;
+	player.researching.add(upgrade);
+	production.queue.push({
+		kind: "upgrade",
+		id: upgrade,
+		paid: made.cost,
+		progress: 0,
+		duration: made.time
+	});
+	return true;
+}
+/** Queues bringing a fallen hero back */
+function enqueueRevive(world, building, heroId) {
+	const production = productionOf(building);
+	const hero = world.entities.get(heroId);
+	if (!production || !building.operational || !building.def.revives) return false;
+	if (!hero?.has(heroState) || hero.alive || hero.owner !== building.owner || hero.reviving) return false;
+	const { cost, time } = reviveCost(world, hero);
+	if (!hasRoom(world, building)) return false;
+	const made = startProducing(world, building, "revive", String(heroId), cost, time);
+	if (!made) return false;
+	hero.reviving = true;
+	production.queue.push({
+		kind: "revive",
+		id: String(heroId),
+		paid: made.cost,
+		progress: 0,
+		duration: made.time
+	});
+	return true;
+}
+/**
+* Queues upgrading a building into a type it can become (`UnitTypeDef.upgradesTo`): `into`, one of them, or the first
+* where none is named. One at a time
+*/
+function enqueueMorph(world, building, into = upgradesOf(building.def)[0]) {
+	const production = productionOf(building);
+	if (!production || !building.operational || into === void 0 || !upgradesOf(building.def).includes(into)) return false;
+	if (production.queue.some((item) => item.kind === "morph")) return false;
+	const def = world.registry.unit(into);
+	if (!unlocked(world, building.owner, "unit", into, def.requires) || !hasRoom(world, building)) return false;
+	const made = startProducing(world, building, "morph", into, def.cost, def.buildTime ?? 1);
+	if (!made) return false;
+	production.queue.push({
+		kind: "morph",
+		id: into,
+		paid: made.cost,
+		progress: 0,
+		duration: made.time
+	});
+	world.events.emit(morphStarted, {
+		entity: building,
+		into,
+		time: made.time
+	});
+	return true;
+}
+function cancelProduction(world, building, index) {
+	const production = productionOf(building);
+	const item = production?.queue[index];
+	if (!production || !item) return false;
+	production.queue.splice(index, 1);
+	giveBack(world, building, item);
+	return true;
+}
+/** Where what a building produced comes out: on the side of its rally point */
+function exitOf(world, building, radius) {
+	const rally = productionOf(building).rally;
+	const towards = world.get(rally?.target)?.pos ?? rally?.point ?? {
+		x: building.pos.x,
+		z: building.pos.z - 100
+	};
+	return {
+		exit: closestPointOnRect(towards, building.rect, radius + .3),
+		towards
+	};
+}
+function finishUnit(world, building, unitType) {
+	const def = world.registry.unit(unitType);
+	const rally = productionOf(building).rally;
+	const rallyTarget = world.get(rally?.target);
+	const { exit, towards } = exitOf(world, building, def.radius);
+	const unit = world.spawn(unitType, building.owner, exit, { facing: atan2(towards.x - exit.x, towards.z - exit.z) });
+	world.events.emit(unitTrained, {
+		building,
+		unit
+	});
+	world.hooks.run("produced", {
+		producer: building,
+		kind: "unit",
+		id: unitType,
+		unit
+	});
+	if (!rally) return;
+	if (rallyTarget?.get(deposit) && unit.has(gathering)) giveOrder(world, unit, createOrder(world, {
+		type: "harvest",
+		target: rallyTarget.id
+	}));
+	else if (rallyTarget && rallyTarget.isUnit) giveOrder(world, unit, createOrder(world, {
+		type: "move",
+		target: rallyTarget.id
+	}));
+	else giveOrder(world, unit, createOrder(world, {
+		type: "move",
+		point: rally.point
+	}));
+}
+function finishUpgrade(world, building, upgrade) {
+	const player = world.player(building.owner);
+	const level = (player.upgrades.get(upgrade) ?? 0) + 1;
+	player.setUpgrade(upgrade, level);
+	player.researching.delete(upgrade);
+	const { apply } = world.registry.upgrade(upgrade);
+	if (apply) {
+		for (const entity of [...world.index.ownedBy(player.id)]) if (entity.alive) apply(world, entity, level);
+	}
+	world.events.emit(researchFinished, {
+		building,
+		upgrade,
+		level
+	});
+	world.hooks.run("produced", {
+		producer: building,
+		kind: "upgrade",
+		id: upgrade,
+		level
+	});
+	world.message(player.id, engineMessage("researchDone", { upgrade }), "info");
+}
+var productionSystem = {
+	name: "production",
+	phase: "resolve",
+	over: productionQueue,
+	each(world, entity, dt) {
+		const production = productionOf(entity);
+		if (!production || !entity.operational || entity.scenery) return;
+		const item = production.queue[0];
+		if (!item) return;
+		item.progress += dt;
+		if (item.progress < item.duration) return;
+		production.queue.shift();
+		if (item.kind === "unit") finishUnit(world, entity, item.id);
+		else if (item.kind === "upgrade") finishUpgrade(world, entity, item.id);
+		else if (item.kind === "morph") {
+			morph(world, entity, item.id);
+			world.hooks.run("produced", {
+				producer: entity,
+				kind: "morph",
+				id: item.id,
+				unit: entity
+			});
+		} else {
+			const hero = world.entities.get(Number(item.id));
+			if (hero) {
+				reviveHero(world, hero, exitOf(world, entity, hero.def.radius).exit);
+				world.hooks.run("produced", {
+					producer: entity,
+					kind: "revive",
+					id: item.id,
+					unit: hero
+				});
+			}
+		}
+	}
+};
+/** A unit made, to those who see it */
+var toldTrained = replicateEvent(unitTrained, "trained", ({ building, unit }, view) => view.knows(unit) ? {
+	type: "trained",
+	id: unit.id,
+	building: view.knows(building) ? building.id : void 0
+} : void 0);
+/** Research done: to its side */
+var toldResearched = replicateEvent(researchFinished, "researched", ({ building, upgrade, level }, view) => view.isAlly(building.owner) ? {
+	type: "researched",
+	upgrade,
+	level,
+	building: building.id
+} : void 0);
+/** A building starting to become another, to those who see it */
+var toldUpgradeStarted = replicateEvent(morphStarted, "upgradeStarted", ({ entity, into, time }, view) => view.knows(entity) ? {
+	type: "upgradeStarted",
+	id: entity.id,
+	to: into,
+	time
+} : void 0);
+//#endregion
+export { cancelProduction, enqueueMorph, enqueueProduction, enqueueResearch, enqueueRevive, playerFacts, productionSystem, startProducing, toldResearched, toldTrained, toldUpgradeStarted, upgradeLevel };
+
+//# sourceMappingURL=production.js.map