54ae572303
Introduced also a small Unit test project to prove it. - Separated caching capabilities from PathFinder class to increase cohesion and maintainability. Refactored the pathfinding algorithm by extracting methods based on responsibilities like calculating costs and reordering functions. These changes should provide a in average a small increase in pathfinding performance and maintainability. - Optimized the pathfinder algorithm to reuse calculations like the MovementCost and heuristics. - Introduced base classes, IPathSearch and IPriorityQueue interfaces, and restructured code to ease readability and testability - Renamed the PathFinder related classes to more appropriate names. Made the traits rely on the interface IPathfinder instead of concrete PathFinder implementation. - Massive performance improvements - Solved error with harvesters' Heuristic - Updated the heuristic to ease redability and adjustability. D can be adjusted to offer best paths by decreasing and more performance by increasing it - Refactored the CellLayer<CellInfo> creation in its own Singleton class - Extracted the graph abstraction onto an IGraph interface, making the Pathfinder agnostic to the definition of world and terrain. This abstraction can help in the future to be able to cache graphs for similar classes and their costs, speeding up the pathfinder and being able to feed the A* algorithm with different types of graphs like Hierarchical graphs
75 lines
1.6 KiB
C#
75 lines
1.6 KiB
C#
#region Copyright & License Information
|
|
/*
|
|
* Copyright 2007-2015 The OpenRA Developers (see AUTHORS)
|
|
* This file is part of OpenRA, which is free software. It is made
|
|
* available to you under the terms of the GNU General Public License
|
|
* as published by the Free Software Foundation. For more information,
|
|
* see COPYING.
|
|
*/
|
|
#endregion
|
|
|
|
using System.Collections.Generic;
|
|
using System.Linq;
|
|
|
|
namespace OpenRA.Mods.Common.Pathfinder
|
|
{
|
|
public class PathCacheStorage : ICacheStorage<List<CPos>>
|
|
{
|
|
class CachedPath
|
|
{
|
|
public List<CPos> Result;
|
|
public int Tick;
|
|
}
|
|
|
|
const int MaxPathAge = 50;
|
|
readonly IWorld world;
|
|
Dictionary<string, CachedPath> cachedPaths = new Dictionary<string, CachedPath>(100);
|
|
|
|
public PathCacheStorage(IWorld world)
|
|
{
|
|
this.world = world;
|
|
}
|
|
|
|
public void Remove(string key)
|
|
{
|
|
cachedPaths.Remove(key);
|
|
}
|
|
|
|
public void Store(string key, List<CPos> data)
|
|
{
|
|
// Eventually clean up the cachedPaths dictionary
|
|
if (cachedPaths.Count >= 100)
|
|
foreach (var cachedPath in cachedPaths.Where(p => IsExpired(p.Value)).ToList())
|
|
cachedPaths.Remove(cachedPath.Key);
|
|
|
|
cachedPaths.Add(key, new CachedPath
|
|
{
|
|
Tick = world.WorldTick,
|
|
Result = data
|
|
});
|
|
}
|
|
|
|
public List<CPos> Retrieve(string key)
|
|
{
|
|
CachedPath cached;
|
|
if (cachedPaths.TryGetValue(key, out cached))
|
|
{
|
|
if (IsExpired(cached))
|
|
{
|
|
cachedPaths.Remove(key);
|
|
return null;
|
|
}
|
|
|
|
cached.Tick = world.WorldTick;
|
|
return cached.Result;
|
|
}
|
|
|
|
return null;
|
|
}
|
|
|
|
bool IsExpired(CachedPath path)
|
|
{
|
|
return world.WorldTick - path.Tick > MaxPathAge;
|
|
}
|
|
}
|
|
} |