PathState.h

#pragma once
 
#include <Foundation/Containers/HashTable.h>
#include <Foundation/Math/Math.h>
#include <Utilities/UtilitiesDLL.h>
 
struct plPathState
{
  PL_DECLARE_POD_TYPE();
 
  plPathState()
  {
    m_iReachedThroughNode = 0;
    m_fCostToNode = 0.0f;
    m_fEstimatedCostToTarget = 0.0f;
  }
 
  plInt64 m_iReachedThroughNode;
 
  float m_fCostToNode;
 
  float m_fEstimatedCostToTarget;
};
 
template <typename PathStateType>
class plPathSearch;
 
template <typename PathStateType>
class plPathStateGenerator
{
public:
  virtual void GenerateAdjacentStates(plInt64 iNodeIndex, const PathStateType& StartState, plPathSearch<PathStateType>* pPathSearch) = 0;
 
  virtual void StartSearchForClosest(plInt64 iStartNodeIndex, const PathStateType* pStartState) {}
 
  virtual void StartSearch(plInt64 iStartNodeIndex, const PathStateType* pStartState, plInt64 iTargetNodeIndex) {}
 
  virtual void SearchFinished(plResult res) {}
};