CvAStar::Step()
- Defined in
- CvAStar.cpp, line 319
- Class
- CvAStar
- Hook name
CivHooks::CvAStar_Step
Hooks
static bool BeforeCvAStar_Step(CvAStar* self, int& result);static void AfterCvAStar_Step(CvAStar* self, int& result);static int ReplaceCvAStar_Step(int (*original)(CvAStar*), CvAStar* self);CivRegisterBefore<CivHooks::CvAStar_Step>(host, &BeforeCvAStar_Step);CivRegisterAfter<CivHooks::CvAStar_Step>(host, &AfterCvAStar_Step);CivRegisterReplace<CivHooks::CvAStar_Step>(host, &ReplaceCvAStar_Step);
Code
318/// Takes one step in the algorithm319int CvAStar::Step()320{321 if((m_pBest = GetBest()) == NULL)322 {323 return -1;324 }325326 CreateChildren(m_pBest); // needs to be done, even on the last node, to allow for re-use...327328 if (m_pBest == NULL) // There seems to be a case were this will come back NULL.329 return -1;330331 if(IsPathDest(m_pBest->m_iX, m_pBest->m_iY))332 {333 return 1;334 }335336 return 0;337}