mirror of
https://github.com/vcmi/vcmi.git
synced 2024-12-22 22:13:35 +02:00
1b85abb508
grep -r --include \*.h --include \*.cpp "=" * | grep -v "auto\|int\|char\|bool\|float|\double\|for\|if\|googletest\|fuzzylite\|size_t\|using\|return\|{\|}\|= \"\|= tr(\|virtual\|void" | grep -Po ".*[^ ]+ [^ ]+ [^ ]*[ ]*=.*;" | grep -v "float\|nullptr" | grep "new" | grep -v "AI/FuzzyLite" | grep \( | grep "= new" > redundant_types.txt
import re
with open("redundant_types.txt") as f:
for line in f:
line = line.strip()
path = line.split(":", 1)[0]
original_code = line.split(":")[1].strip()
if "new " in original_code:
cpp_type = original_code.split(" ")[0]
if original_code.count(cpp_type) == 2:
print()
print(path)
print(original_code)
new_code = "auto "+" ".join(original_code.split(" ")[1:])
print(new_code)
with open(path, "r") as f:
filedata = f.read()
filedata = filedata.replace(original_code, new_code)
with open(path, "w") as f:
f.write(filedata)
108 lines
2.2 KiB
C++
108 lines
2.2 KiB
C++
/*
|
|
* BattleFake.cpp, part of VCMI engine
|
|
*
|
|
* Authors: listed in file AUTHORS in main folder
|
|
*
|
|
* License: GNU General Public License v2.0 or later
|
|
* Full text of license available in license.txt file, in main folder
|
|
*
|
|
*/
|
|
#include "StdInc.h"
|
|
|
|
#include "BattleFake.h"
|
|
|
|
namespace test
|
|
{
|
|
namespace battle
|
|
{
|
|
|
|
void UnitFake::addNewBonus(const std::shared_ptr<Bonus> & b)
|
|
{
|
|
bonusFake.addNewBonus(b);
|
|
}
|
|
|
|
void UnitFake::makeAlive()
|
|
{
|
|
EXPECT_CALL(*this, alive()).Times(AtLeast(1)).WillRepeatedly(Return(true));
|
|
}
|
|
|
|
void UnitFake::makeDead()
|
|
{
|
|
EXPECT_CALL(*this, alive()).Times(AtLeast(1)).WillRepeatedly(Return(false));
|
|
EXPECT_CALL(*this, isGhost()).Times(AtLeast(1)).WillRepeatedly(Return(false));
|
|
}
|
|
|
|
void UnitFake::redirectBonusesToFake()
|
|
{
|
|
ON_CALL(*this, getAllBonuses(_, _, _, _)).WillByDefault(Invoke(&bonusFake, &BonusBearerMock::getAllBonuses));
|
|
ON_CALL(*this, getTreeVersion()).WillByDefault(Invoke(&bonusFake, &BonusBearerMock::getTreeVersion));
|
|
}
|
|
|
|
void UnitFake::expectAnyBonusSystemCall()
|
|
{
|
|
EXPECT_CALL(*this, getAllBonuses(_, _, _, _)).Times(AtLeast(0));
|
|
EXPECT_CALL(*this, getTreeVersion()).Times(AtLeast(0));
|
|
}
|
|
|
|
UnitFake & UnitsFake::add(ui8 side)
|
|
{
|
|
auto * unit = new UnitFake();
|
|
ON_CALL(*unit, unitSide()).WillByDefault(Return(side));
|
|
unit->redirectBonusesToFake();
|
|
|
|
allUnits.emplace_back(unit);
|
|
return *allUnits.back().get();
|
|
}
|
|
|
|
Units UnitsFake::getUnitsIf(UnitFilter predicate) const
|
|
{
|
|
Units ret;
|
|
|
|
for(auto & unit : allUnits)
|
|
{
|
|
if(predicate(unit.get()))
|
|
ret.push_back(unit.get());
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
void UnitsFake::setDefaultBonusExpectations()
|
|
{
|
|
for(auto & unit : allUnits)
|
|
{
|
|
unit->expectAnyBonusSystemCall();
|
|
}
|
|
}
|
|
|
|
BattleFake::~BattleFake() = default;
|
|
|
|
#if SCRIPTING_ENABLED
|
|
BattleFake::BattleFake(std::shared_ptr<scripting::PoolMock> pool_):
|
|
pool(pool_)
|
|
{
|
|
}
|
|
#else
|
|
BattleFake::BattleFake() = default;
|
|
#endif
|
|
|
|
void BattleFake::setUp()
|
|
{
|
|
}
|
|
|
|
void BattleFake::setupEmptyBattlefield()
|
|
{
|
|
EXPECT_CALL(*this, getDefendedTown()).WillRepeatedly(Return(nullptr));
|
|
EXPECT_CALL(*this, getAllObstacles()).WillRepeatedly(Return(IBattleInfo::ObstacleCList()));
|
|
EXPECT_CALL(*this, getBattlefieldType()).WillRepeatedly(Return(BattleField(0)));
|
|
}
|
|
|
|
#if SCRIPTING_ENABLED
|
|
scripting::Pool * BattleFake::getContextPool() const
|
|
{
|
|
return pool.get();
|
|
}
|
|
#endif
|
|
|
|
}
|
|
}
|