6a3804addc
## Summary Replaces `FastAStarAlgorithm` with `BitmapAStarAlgorithm`: one cache lookup per cell expansion (8-direction mask + per-direction destination Z) instead of 8 separate `MovementImpl.CheckMovement` calls. Adds the supporting cache infrastructure to back it. Public API unchanged — `MovementPath` / `Mobile.Move` / `CalcMoves.Find` return the same shapes; the algorithm swap is internal. ## What's in this PR - **`BitmapAStarAlgorithm`** — A* that issues one `StepCache.TryGetMask` call per cell expansion. Inline fallthrough to the per-cell slow path for multi-Z, off-map, source-Z mismatch, and non-default walkers. - **`StepCache`** — singleton chunk store keyed by `(mapId, chunkX, chunkY)`. Lazily built on first query, invalidated by `Sector.MultisVersion` mismatch, memory-bounded by sampled probabilistic LRU. - **`StepProbe`** — computes static-only walkability for a single cell, mirroring `MovementImpl.Check` minus the item / mobile collision phases. - **`StepMask` / `StepChunk`** — value / storage types for the per-cell results. - **`CacheEvictionTimer`** — periodic cap backstop (60s interval; early-returns when not over cap). - **`Map.Sector.MultisVersion`** promoted to `public` so the cache can detect dynamic-static invalidations cheaply. ## Eviction strategy Sampled probabilistic LRU (Redis-style). Per eviction, sample 5 random keys from a parallel `List<long>` kept in lockstep with the chunk dictionary; evict the oldest of the sample via swap-and-pop. O(1) per eviction regardless of resident count, so sustained cap pressure has no perpetual perf hit. ## Capability handling (interim) Non-default walkers (non-GM players, creatures with `CanSwim` / `CanFly` / `CanOpenDoors` / `CanMoveOverObstacles`) route entirely through the per-cell slow path via `BitmapAStarAlgorithm.GetSuccessorsSlowPath`. The 2-pass design (cache + capability overlay + dynamic-obstacle pass) lands in the follow-up PR.
39 lines
1.1 KiB
C#
39 lines
1.1 KiB
C#
namespace Server.Engines.Pathing.Cache;
|
|
|
|
public readonly struct StepMask(
|
|
byte mask,
|
|
sbyte destZn,
|
|
sbyte destZne,
|
|
sbyte destZe,
|
|
sbyte destZse,
|
|
sbyte destZs,
|
|
sbyte destZsw,
|
|
sbyte destZw,
|
|
sbyte destZnw
|
|
)
|
|
{
|
|
public readonly byte Mask = mask;
|
|
public readonly sbyte DestZ_N = destZn;
|
|
public readonly sbyte DestZ_NE = destZne;
|
|
public readonly sbyte DestZ_E = destZe;
|
|
public readonly sbyte DestZ_SE = destZse;
|
|
public readonly sbyte DestZ_S = destZs;
|
|
public readonly sbyte DestZ_SW = destZsw;
|
|
public readonly sbyte DestZ_W = destZw;
|
|
public readonly sbyte DestZ_NW = destZnw;
|
|
|
|
public bool IsWalkable(Direction d) => (Mask & (1 << (int)d)) != 0;
|
|
|
|
public sbyte GetDestZ(Direction d) => d switch
|
|
{
|
|
Direction.North => DestZ_N,
|
|
Direction.Right => DestZ_NE,
|
|
Direction.East => DestZ_E,
|
|
Direction.Down => DestZ_SE,
|
|
Direction.South => DestZ_S,
|
|
Direction.Left => DestZ_SW,
|
|
Direction.West => DestZ_W,
|
|
Direction.Up => DestZ_NW,
|
|
_ => 0
|
|
};
|
|
}
|