bool Monster::pushItem(Item* item, int32_t radius)
{
const Position& centerPos = item->getPosition();
PairVector pairVector;
pairVector.push_back(PositionPair(-1, -1));
pairVector.push_back(PositionPair(-1, 0));
pairVector.push_back(PositionPair(-1, 1));
pairVector.push_back(PositionPair(0, -1));
pairVector.push_back(PositionPair(0, 1));
pairVector.push_back(PositionPair(1, -1));
pairVector.push_back(PositionPair(1, 0));
pairVector.push_back(PositionPair(1, 1));
std::random_shuffle(pairVector.begin(), pairVector.end());
Position tryPos;
for(int32_t n = 1; n <= radius; ++n)
{
for(PairVector::iterator it = pairVector.begin(); it != pairVector.end(); ++it)
{
int32_t dx = it->first * n, dy = it->second * n;
tryPos = centerPos;
tryPos.x = tryPos.x + dx;
tryPos.y = tryPos.y + dy;
Tile* tile = g_game.getTile(tryPos);
if(tile && g_game.canThrowObjectTo(centerPos, tryPos) && g_game.internalMoveItem(this, item->getParent(),
tile, INDEX_WHEREEVER, item, item->getItemCount(), NULL) == RET_NOERROR)
return true;
}
}
return false;
}
void Transformed::divideTools(const std::vector<TopoDS_Shape> &toolsIn, std::vector<TopoDS_Shape> &individualsOut,
TopoDS_Compound &compoundOut) const
{
typedef std::pair<TopoDS_Shape, Bnd_Box> ShapeBoundPair;
typedef std::list<ShapeBoundPair> PairList;
typedef std::vector<ShapeBoundPair> PairVector;
PairList pairList;
std::vector<TopoDS_Shape>::const_iterator it;
for (it = toolsIn.begin(); it != toolsIn.end(); ++it)
{
Bnd_Box bound;
BRepBndLib::Add(*it, bound);
bound.SetGap(0.0);
ShapeBoundPair temp = std::make_pair(*it, bound);
pairList.push_back(temp);
}
BRep_Builder builder;
builder.MakeCompound(compoundOut);
while(!pairList.empty())
{
PairVector currentGroup;
currentGroup.push_back(pairList.front());
pairList.pop_front();
PairList::iterator it = pairList.begin();
while(it != pairList.end())
{
PairVector::const_iterator groupIt;
bool found(false);
for (groupIt = currentGroup.begin(); groupIt != currentGroup.end(); ++groupIt)
{
if (!(*it).second.IsOut((*groupIt).second))//touching means is out.
{
found = true;
break;
}
}
if (found)
{
currentGroup.push_back(*it);
pairList.erase(it);
it=pairList.begin();
continue;
}
it++;
}
if (currentGroup.size() == 1)
builder.Add(compoundOut, currentGroup.front().first);
else
{
PairVector::const_iterator groupIt;
for (groupIt = currentGroup.begin(); groupIt != currentGroup.end(); ++groupIt)
individualsOut.push_back((*groupIt).first);
}
}
}
String UCK::lambda(String lambda_d, const PairVector& e, const vector<String>& v, Size i, Size d)
{
lambda_d = v[i]; // fix label
vector<String>* lam;
lam = new vector<String>;
if(d==0) // depth 0 is reached, return the label written in new_label
{
delete lam;
return lambda_d;
}
else // d!=0
{
// compute lambda_d-1_labels for all children
for(PairVector::const_iterator it = e.begin(); it != e.end(); ++it)
{
if(it->first!=i) // if source node in e is not equal to the current position i, then skip this edge
{
continue;
}
else // an edge to another node is found, so compute lambda_d-1 of the child and store the resulting string
// in vector lam
{
lam->push_back(eraseDoubleLabels(d, v[i], lambda("", e, v, it->second, d-1)));
}
}
sort(lam->begin(), lam->end()); // lexicographically order the lambda_d-1 -labels
}
// concatenate lambda_d-1 -labels and produce lambda_d -label
for(vector<String>::iterator it = lam->begin(); it != lam->end(); ++it)
{
lambda_d += *it;
}
delete lam;
return lambda_d;
}
void DataPartitions::pairSort(PairVector &dimOrData){
std::sort(dimOrData.begin(),dimOrData.end(),pairSortComp);
}
