aystar.h

Go to the documentation of this file.

/*
 * This file is part of OpenTTD.
 * OpenTTD is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, version 2.
 * OpenTTD is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
 * See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with OpenTTD. If not, see <http://www.gnu.org/licenses/>.
 */
 
#ifndef AYSTAR_H
#define AYSTAR_H
 
#include "yapf/nodelist.hpp"
#include "yapf/yapf_node.hpp"
 
static const int AYSTAR_DEF_MAX_SEARCH_NODES = 10000; 
 
enum class AyStarStatus : uint8_t {
  FoundEndNode, 
  EmptyOpenList, 
  StillBusy, 
  NoPath, 
  LimitReached, 
  Done, 
};
enum class AyStarStatus : uint8_t {…};
 
static const int AYSTAR_INVALID_NODE = -1; 
 
using AyStarNode = CYapfNodeKeyTrackDir;
 
struct PathNode : CYapfNodeT<AyStarNode, PathNode> {
};
struct PathNode : CYapfNodeT<AyStarNode, PathNode> {…};
 
class AyStar {
protected:
  virtual int32_t CalculateG(const AyStarNode &current, const PathNode &parent) const = 0;
 
  virtual int32_t CalculateH(const AyStarNode &current, const PathNode &parent) const = 0;
 
  virtual void GetNeighbours(const PathNode &current, std::vector<AyStarNode> &neighours) const = 0;
 
  virtual AyStarStatus EndNodeCheck(const PathNode &current) const = 0;
 
  virtual void FoundEndNode(const PathNode &current) = 0;
 
  void AddStartNode(AyStarNode *start_node, int g);
 
  AyStarStatus Main();
 
public:
  virtual ~AyStar() = default;
 
private:
  NodeList<PathNode, 8, 10> nodes;
  mutable std::vector<AyStarNode> neighbours;
 
  AyStarStatus Loop();
  void OpenListAdd(PathNode *parent, const AyStarNode *node, int f, int g);
  void CheckTile(AyStarNode *current, PathNode *parent);
};
class AyStar {…};
 
#endif /* AYSTAR_H */