本文整理汇总了C++中boost::thread_specific_ptr::getPath2方法的典型用法代码示例。如果您正苦于以下问题：C++ thread_specific_ptr::getPath2方法的具体用法？C++ thread_specific_ptr::getPath2怎么用？C++ thread_specific_ptr::getPath2使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类boost::thread_specific_ptr的用法示例。
在下文中一共展示了thread_specific_ptr::getPath2方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: whereToExplore
int3 whereToExplore(HeroPtr h)
{
//TODO it's stupid and ineffective, write sth better
cb->setSelection(*h);
int radius = h->getSightRadious();
int3 hpos = h->visitablePos();
//look for nearby objs -> visit them if they're close enouh
const int DIST_LIMIT = 3;
std::vector<const CGObjectInstance *> nearbyVisitableObjs;
for(const CGObjectInstance *obj : ai->getPossibleDestinations(h))
{
int3 op = obj->visitablePos();
CGPath p;
cb->getPath2(op, p);
if(p.nodes.size() && p.endPos() == op && p.nodes.size() <= DIST_LIMIT)
nearbyVisitableObjs.push_back(obj);
}
boost::sort(nearbyVisitableObjs, isCloser);
if(nearbyVisitableObjs.size())
return nearbyVisitableObjs.back()->visitablePos();
try
{
return ai->explorationBestNeighbour(hpos, radius, h);
}
catch(cannotFulfillGoalException &e)
{
std::vector<std::vector<int3> > tiles; //tiles[distance_to_fow]
try
{
return ai->explorationNewPoint(radius, h, tiles);
}
catch(cannotFulfillGoalException &e)
{
std::map<int, std::vector<int3> > profits;
{
TimeCheck tc("Evaluating exploration possibilities");
tiles[0].clear(); //we can't reach FoW anyway
for(auto &vt : tiles)
for(auto &tile : vt)
profits[howManyTilesWillBeDiscovered(tile, radius)].push_back(tile);
}
if(profits.empty())
return int3 (-1,-1,-1);
auto bestDest = profits.end();
bestDest--;
return bestDest->second.front(); //TODO which is the real best tile?
}
}
}