gpt4 book ai didi

c++ - 操作迭代器列表+指针

转载 作者:行者123 更新时间:2023-11-28 06:07:37 25 4
gpt4 key购买 nike

我正在尝试检查所有实体的所有碰撞。我这样做是这样的:我的父类“实体”有一个 static std::list<Entity*> allEntities

所有子类的构造函数都有这句话Entity::AddEntity((*this));

我有一个属性(property)std::list< Entity*> m_collisionWith;它将获取具有交集的实体的所有指针

之后,我在实体类中有一个静态函数:

for (std::list<Entity*>::iterator it = allEntities.begin(); it != allEntities.end(); it++) //to check everything...
{

for (std::list<Entity*>::iterator itSec = allEntities.begin(); itSec != allEntities.end(); itSec++) // ... with everything
{

if ((*it)->m_spriteCharacter[(*it)->m_currentFrameCharacter].getGlobalBounds().intersects((*itSec)->m_spriteCharacter[(*itSec)->m_currentFrameCharacter].getGlobalBounds()) && *itSec != (*it)) //to_check if we have an intersection between two objects
{
if ((*it)->m_collisionWith.empty())
{
(*it)->m_collisionWith.push_back((*itSec));
}
else
{
for (std::list<Entity*>::iterator itThr = (*it)->m_collisionWith.begin(); itThr != (*it)->m_collisionWith.end(); itThr++)
{
if ((*itThr) != (*itSec)) //to check if the second object is not here yet. itThr will be every objects in m_collisionWith
{
(*it)->m_collisionWith.push_back((*itSec));
}

}
}
}
}
}

所以我想检查一个实体是否与另一个实体有交集,如果有,我不想将它添加到 m_collision 中。通常,如果我有 3 个实体,m_collision.size() 等于 3,但它会不停地增长

最佳答案

for (std::list<Entity*>::iterator itThr = (*it)->m_collisionWith.begin(); itThr != (*it)->m_collisionWith.end(); itThr++)
{
if ((*itThr) != (*itSec)) //to check if the second object is not here yet. itThr will be every objects in m_collisionWith
{
(*it)->m_collisionWith.push_back((*itSec));
}

}

对于 (*i​​t)->m_collisionWith 中不等于 *itSec 的每个元素,这会将 itSec 推到后面。应该是:

bool exists = false;
for (std::list<Entity*>::iterator itThr = (*it)->m_collisionWith.begin(); itThr != (*it)->m_collisionWith.end(); itThr++)
{
if ((*itThr) != (*itSec)) //to check if the second object is not here yet. itThr will be every objects in m_collisionWith
{
exists = true;
break;
}

}
if (!exists)
{
(*it)->m_collisionWith.push_back((*itSec));
}

关于c++ - 操作迭代器列表+指针,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/32062272/

25 4 0
Copyright 2021 - 2024 cfsdn All Rights Reserved 蜀ICP备2022000587号
广告合作:1813099741@qq.com 6ren.com