IProperty: Make use of ranged for where applicable
Same behavior, less moving parts.
This commit is contained in:
parent
e4feff9930
commit
6799e40ef5
|
@ -10,6 +10,7 @@
|
||||||
#include "Core/Resource/Script/NGameList.h"
|
#include "Core/Resource/Script/NGameList.h"
|
||||||
#include "Core/Resource/Script/NPropertyMap.h"
|
#include "Core/Resource/Script/NPropertyMap.h"
|
||||||
|
|
||||||
|
#include <algorithm>
|
||||||
#include <cfloat>
|
#include <cfloat>
|
||||||
|
|
||||||
/** IProperty */
|
/** IProperty */
|
||||||
|
@ -19,15 +20,15 @@ IProperty::IProperty(EGame Game)
|
||||||
|
|
||||||
void IProperty::_ClearChildren()
|
void IProperty::_ClearChildren()
|
||||||
{
|
{
|
||||||
for (int ChildIdx = 0; ChildIdx < mChildren.size(); ChildIdx++)
|
for (auto* child : mChildren)
|
||||||
{
|
{
|
||||||
// Unregister children from the name map. This has to be done before actually deleting them.
|
// Unregister children from the name map. This has to be done before actually deleting them.
|
||||||
if (mChildren[ChildIdx]->UsesNameMap())
|
if (child->UsesNameMap())
|
||||||
{
|
{
|
||||||
NPropertyMap::UnregisterProperty(mChildren[ChildIdx]);
|
NPropertyMap::UnregisterProperty(child);
|
||||||
}
|
}
|
||||||
|
|
||||||
delete mChildren[ChildIdx];
|
delete child;
|
||||||
}
|
}
|
||||||
|
|
||||||
mChildren.clear();
|
mChildren.clear();
|
||||||
|
@ -45,9 +46,9 @@ IProperty::~IProperty()
|
||||||
// If this is an archetype, make sure no sub-instances have a reference to us.
|
// If this is an archetype, make sure no sub-instances have a reference to us.
|
||||||
if (IsArchetype())
|
if (IsArchetype())
|
||||||
{
|
{
|
||||||
for( int SubIdx = 0; SubIdx < mSubInstances.size(); SubIdx++ )
|
for (auto* subInstance : mSubInstances)
|
||||||
{
|
{
|
||||||
mSubInstances[SubIdx]->mpArchetype = nullptr;
|
subInstance->mpArchetype = nullptr;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -69,7 +70,7 @@ void IProperty::Serialize(IArchive& rArc)
|
||||||
{
|
{
|
||||||
// Always serialize ID first! ID is always required (except for root properties, which have an ID of 0xFFFFFFFF)
|
// Always serialize ID first! ID is always required (except for root properties, which have an ID of 0xFFFFFFFF)
|
||||||
// because they are needed to look up the correct property to apply parameter overrides to.
|
// because they are needed to look up the correct property to apply parameter overrides to.
|
||||||
rArc << SerialParameter("ID", mID, SH_HexDisplay | SH_Attribute | SH_Optional, (uint32) 0xFFFFFFFF);
|
rArc << SerialParameter("ID", mID, SH_HexDisplay | SH_Attribute | SH_Optional, 0xFFFFFFFFU);
|
||||||
|
|
||||||
// Now we can serialize the archetype reference and initialize if needed
|
// Now we can serialize the archetype reference and initialize if needed
|
||||||
if (((mpArchetype && mpArchetype->IsRootParent()) || rArc.IsReader()) && rArc.CanSkipParameters())
|
if (((mpArchetype && mpArchetype->IsRootParent()) || rArc.IsReader()) && rArc.CanSkipParameters())
|
||||||
|
@ -195,7 +196,7 @@ void IProperty::Initialize(IProperty* pInParent, CScriptTemplate* pInTemplate, u
|
||||||
// Now, route initialization to any child properties...
|
// Now, route initialization to any child properties...
|
||||||
uint32 ChildOffset = mOffset;
|
uint32 ChildOffset = mOffset;
|
||||||
|
|
||||||
for (int ChildIdx = 0; ChildIdx < mChildren.size(); ChildIdx++)
|
for (size_t ChildIdx = 0; ChildIdx < mChildren.size(); ChildIdx++)
|
||||||
{
|
{
|
||||||
IProperty* pChild = mChildren[ChildIdx];
|
IProperty* pChild = mChildren[ChildIdx];
|
||||||
|
|
||||||
|
@ -227,13 +228,15 @@ void* IProperty::RawValuePtr(void* pData) const
|
||||||
|
|
||||||
IProperty* IProperty::ChildByID(uint32 ID) const
|
IProperty* IProperty::ChildByID(uint32 ID) const
|
||||||
{
|
{
|
||||||
for (uint32 ChildIdx = 0; ChildIdx < mChildren.size(); ChildIdx++)
|
const auto iter = std::find_if(mChildren.begin(), mChildren.end(),
|
||||||
|
[ID](const auto* element) { return element->mID == ID; });
|
||||||
|
|
||||||
|
if (iter == mChildren.cend())
|
||||||
{
|
{
|
||||||
if (mChildren[ChildIdx]->mID == ID)
|
return nullptr;
|
||||||
return mChildren[ChildIdx];
|
|
||||||
}
|
}
|
||||||
|
|
||||||
return nullptr;
|
return *iter;
|
||||||
}
|
}
|
||||||
|
|
||||||
IProperty* IProperty::ChildByIDString(const TIDString& rkIdString)
|
IProperty* IProperty::ChildByIDString(const TIDString& rkIdString)
|
||||||
|
@ -242,15 +245,15 @@ IProperty* IProperty::ChildByIDString(const TIDString& rkIdString)
|
||||||
// some ID strings are formatted with 8 characters and some with 2 (plus the beginning "0x")
|
// some ID strings are formatted with 8 characters and some with 2 (plus the beginning "0x")
|
||||||
ASSERT(rkIdString.Size() >= 4);
|
ASSERT(rkIdString.Size() >= 4);
|
||||||
|
|
||||||
uint32 IDEndPos = rkIdString.IndexOf(':');
|
const uint32 IDEndPos = rkIdString.IndexOf(':');
|
||||||
uint32 NextChildID = -1;
|
uint32 NextChildID = UINT32_MAX;
|
||||||
|
|
||||||
if (IDEndPos == -1)
|
if (IDEndPos == UINT32_MAX)
|
||||||
NextChildID = rkIdString.ToInt32(16);
|
NextChildID = rkIdString.ToInt32(16);
|
||||||
else
|
else
|
||||||
NextChildID = rkIdString.SubString(2, IDEndPos - 2).ToInt32(16);
|
NextChildID = rkIdString.SubString(2, IDEndPos - 2).ToInt32(16);
|
||||||
|
|
||||||
if (NextChildID == 0xFFFFFFFF)
|
if (NextChildID == UINT32_MAX)
|
||||||
{
|
{
|
||||||
return nullptr;
|
return nullptr;
|
||||||
}
|
}
|
||||||
|
@ -258,7 +261,7 @@ IProperty* IProperty::ChildByIDString(const TIDString& rkIdString)
|
||||||
IProperty* pNextChild = ChildByID(NextChildID);
|
IProperty* pNextChild = ChildByID(NextChildID);
|
||||||
|
|
||||||
// Check if we need to recurse
|
// Check if we need to recurse
|
||||||
if (IDEndPos != -1)
|
if (IDEndPos != UINT32_MAX)
|
||||||
{
|
{
|
||||||
return pNextChild->ChildByIDString(rkIdString.ChopFront(IDEndPos + 1));
|
return pNextChild->ChildByIDString(rkIdString.ChopFront(IDEndPos + 1));
|
||||||
}
|
}
|
||||||
|
@ -272,14 +275,12 @@ void IProperty::GatherAllSubInstances(std::list<IProperty*>& OutList, bool Recur
|
||||||
{
|
{
|
||||||
OutList.push_back(this);
|
OutList.push_back(this);
|
||||||
|
|
||||||
for( uint32 SubIdx = 0; SubIdx < mSubInstances.size(); SubIdx++ )
|
for (auto* subInstance : mSubInstances)
|
||||||
{
|
{
|
||||||
IProperty* pSubInstance = mSubInstances[SubIdx];
|
|
||||||
|
|
||||||
if (Recursive)
|
if (Recursive)
|
||||||
pSubInstance->GatherAllSubInstances( OutList, true );
|
subInstance->GatherAllSubInstances(OutList, true);
|
||||||
else
|
else
|
||||||
OutList.push_back( pSubInstance );
|
OutList.push_back(subInstance);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -304,7 +305,7 @@ TString IProperty::GetTemplateFileName()
|
||||||
pTemplateRoot = pTemplateRoot->RootParent();
|
pTemplateRoot = pTemplateRoot->RootParent();
|
||||||
|
|
||||||
// Now that we have the base property of our template, we can return the file path.
|
// Now that we have the base property of our template, we can return the file path.
|
||||||
static const uint32 kChopAmount = strlen(*(gDataDir + "templates/"));
|
static const size_t kChopAmount = strlen(*(gDataDir + "templates/"));
|
||||||
|
|
||||||
if (pTemplateRoot->ScriptTemplate())
|
if (pTemplateRoot->ScriptTemplate())
|
||||||
{
|
{
|
||||||
|
@ -361,37 +362,38 @@ bool IProperty::ShouldCook(void* pPropertyData) const
|
||||||
|
|
||||||
void IProperty::SetName(const TString& rkNewName)
|
void IProperty::SetName(const TString& rkNewName)
|
||||||
{
|
{
|
||||||
if (mName != rkNewName)
|
if (mName == rkNewName)
|
||||||
{
|
return;
|
||||||
|
|
||||||
mName = rkNewName;
|
mName = rkNewName;
|
||||||
mFlags.ClearFlag(EPropertyFlag::HasCachedNameCheck);
|
mFlags.ClearFlag(EPropertyFlag::HasCachedNameCheck);
|
||||||
MarkDirty();
|
MarkDirty();
|
||||||
}
|
}
|
||||||
}
|
|
||||||
|
|
||||||
void IProperty::SetDescription(const TString& rkNewDescription)
|
void IProperty::SetDescription(const TString& rkNewDescription)
|
||||||
{
|
{
|
||||||
if (mDescription != rkNewDescription)
|
if (mDescription == rkNewDescription)
|
||||||
{
|
return;
|
||||||
|
|
||||||
mDescription = rkNewDescription;
|
mDescription = rkNewDescription;
|
||||||
MarkDirty();
|
MarkDirty();
|
||||||
}
|
}
|
||||||
}
|
|
||||||
|
|
||||||
void IProperty::SetSuffix(const TString& rkNewSuffix)
|
void IProperty::SetSuffix(const TString& rkNewSuffix)
|
||||||
{
|
{
|
||||||
if (mSuffix != rkNewSuffix)
|
if (mSuffix == rkNewSuffix)
|
||||||
{
|
return;
|
||||||
|
|
||||||
mSuffix = rkNewSuffix;
|
mSuffix = rkNewSuffix;
|
||||||
MarkDirty();
|
MarkDirty();
|
||||||
}
|
}
|
||||||
}
|
|
||||||
|
|
||||||
void IProperty::MarkDirty()
|
void IProperty::MarkDirty()
|
||||||
{
|
{
|
||||||
// Don't allow properties to be marked dirty before they are fully initialized.
|
// Don't allow properties to be marked dirty before they are fully initialized.
|
||||||
if (IsInitialized())
|
if (!IsInitialized())
|
||||||
{
|
return;
|
||||||
|
|
||||||
// Mark the root parent as dirty so the template file will get resaved
|
// Mark the root parent as dirty so the template file will get resaved
|
||||||
RootParent()->mFlags |= EPropertyFlag::IsDirty;
|
RootParent()->mFlags |= EPropertyFlag::IsDirty;
|
||||||
|
|
||||||
|
@ -399,10 +401,9 @@ void IProperty::MarkDirty()
|
||||||
mFlags &= ~(EPropertyFlag::HasCachedNameCheck | EPropertyFlag::HasCorrectPropertyName);
|
mFlags &= ~(EPropertyFlag::HasCachedNameCheck | EPropertyFlag::HasCorrectPropertyName);
|
||||||
|
|
||||||
// Mark sub-instances as dirty since they may need to resave as well
|
// Mark sub-instances as dirty since they may need to resave as well
|
||||||
for (uint32 SubIdx = 0; SubIdx < mSubInstances.size(); SubIdx++)
|
for (auto& subInstance : mSubInstances)
|
||||||
{
|
{
|
||||||
mSubInstances[SubIdx]->MarkDirty();
|
subInstance->MarkDirty();
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -411,7 +412,7 @@ void IProperty::ClearDirtyFlag()
|
||||||
RootParent()->mFlags &= ~EPropertyFlag::IsDirty;
|
RootParent()->mFlags &= ~EPropertyFlag::IsDirty;
|
||||||
}
|
}
|
||||||
|
|
||||||
bool IProperty::ConvertType(EPropertyType NewType, IProperty* pNewArchetype /*= nullptr*/)
|
bool IProperty::ConvertType(EPropertyType NewType, IProperty* pNewArchetype)
|
||||||
{
|
{
|
||||||
if (mpArchetype && !pNewArchetype)
|
if (mpArchetype && !pNewArchetype)
|
||||||
{
|
{
|
||||||
|
@ -459,13 +460,11 @@ bool IProperty::ConvertType(EPropertyType NewType, IProperty* pNewArchetype /*=
|
||||||
std::list<IProperty*> SubInstances;
|
std::list<IProperty*> SubInstances;
|
||||||
GatherAllSubInstances(SubInstances, true);
|
GatherAllSubInstances(SubInstances, true);
|
||||||
|
|
||||||
for (auto Iter = SubInstances.begin(); Iter != SubInstances.end(); Iter++)
|
for (auto* property : SubInstances)
|
||||||
{
|
{
|
||||||
IProperty* pProperty = *Iter;
|
if (property->UsesNameMap())
|
||||||
|
|
||||||
if (pProperty->UsesNameMap())
|
|
||||||
{
|
{
|
||||||
NPropertyMap::UnregisterProperty(pProperty);
|
NPropertyMap::UnregisterProperty(property);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -475,7 +474,7 @@ bool IProperty::ConvertType(EPropertyType NewType, IProperty* pNewArchetype /*=
|
||||||
// Swap out our parent's reference to us to point to the new property.
|
// Swap out our parent's reference to us to point to the new property.
|
||||||
if (mpParent)
|
if (mpParent)
|
||||||
{
|
{
|
||||||
for (uint32 SiblingIdx = 0; SiblingIdx < mpParent->mChildren.size(); SiblingIdx++)
|
for (size_t SiblingIdx = 0; SiblingIdx < mpParent->mChildren.size(); SiblingIdx++)
|
||||||
{
|
{
|
||||||
IProperty* pSibling = mpParent->mChildren[SiblingIdx];
|
IProperty* pSibling = mpParent->mChildren[SiblingIdx];
|
||||||
if (pSibling == this)
|
if (pSibling == this)
|
||||||
|
@ -487,10 +486,10 @@ bool IProperty::ConvertType(EPropertyType NewType, IProperty* pNewArchetype /*=
|
||||||
}
|
}
|
||||||
|
|
||||||
// Change all our child properties to be parented under the new property. (Is this adoption?)
|
// Change all our child properties to be parented under the new property. (Is this adoption?)
|
||||||
for (uint32 ChildIdx = 0; ChildIdx < mChildren.size(); ChildIdx++)
|
for (auto* child : mChildren)
|
||||||
{
|
{
|
||||||
mChildren[ChildIdx]->mpParent = pNewProperty;
|
child->mpParent = pNewProperty;
|
||||||
pNewProperty->mChildren.push_back(mChildren[ChildIdx]);
|
pNewProperty->mChildren.push_back(child);
|
||||||
}
|
}
|
||||||
ASSERT(pNewProperty->mChildren.size() == mChildren.size());
|
ASSERT(pNewProperty->mChildren.size() == mChildren.size());
|
||||||
mChildren.clear();
|
mChildren.clear();
|
||||||
|
@ -499,11 +498,11 @@ bool IProperty::ConvertType(EPropertyType NewType, IProperty* pNewArchetype /*=
|
||||||
// Note that when the sub-instances complete their conversion, they delete themselves.
|
// Note that when the sub-instances complete their conversion, they delete themselves.
|
||||||
// The IProperty destructor removes the property from the archetype's sub-instance list.
|
// The IProperty destructor removes the property from the archetype's sub-instance list.
|
||||||
// So we shouldn't use a for loop, instead we should just wait until the array is empty
|
// So we shouldn't use a for loop, instead we should just wait until the array is empty
|
||||||
uint32 SubCount = mSubInstances.size();
|
[[maybe_unused]] const size_t SubCount = mSubInstances.size();
|
||||||
|
|
||||||
while (!mSubInstances.empty())
|
while (!mSubInstances.empty())
|
||||||
{
|
{
|
||||||
bool SubSuccess = mSubInstances[0]->ConvertType(NewType, pNewProperty);
|
[[maybe_unused]] const bool SubSuccess = mSubInstances[0]->ConvertType(NewType, pNewProperty);
|
||||||
ASSERT(SubSuccess);
|
ASSERT(SubSuccess);
|
||||||
}
|
}
|
||||||
ASSERT(pNewProperty->mSubInstances.size() == SubCount);
|
ASSERT(pNewProperty->mSubInstances.size() == SubCount);
|
||||||
|
@ -528,7 +527,7 @@ bool IProperty::ConvertType(EPropertyType NewType, IProperty* pNewArchetype /*=
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
bool IProperty::UsesNameMap()
|
bool IProperty::UsesNameMap() const
|
||||||
{
|
{
|
||||||
return Game() >= EGame::EchoesDemo &&
|
return Game() >= EGame::EchoesDemo &&
|
||||||
!IsRootParent() &&
|
!IsRootParent() &&
|
||||||
|
@ -553,7 +552,7 @@ bool IProperty::HasAccurateName()
|
||||||
{
|
{
|
||||||
if (mpParent)
|
if (mpParent)
|
||||||
return mpParent->HasAccurateName();
|
return mpParent->HasAccurateName();
|
||||||
else
|
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -596,8 +595,7 @@ EGame IProperty::Game() const
|
||||||
return mGame;
|
return mGame;
|
||||||
}
|
}
|
||||||
|
|
||||||
IProperty* IProperty::Create(EPropertyType Type,
|
IProperty* IProperty::Create(EPropertyType Type, EGame Game)
|
||||||
EGame Game)
|
|
||||||
{
|
{
|
||||||
IProperty* pOut = nullptr;
|
IProperty* pOut = nullptr;
|
||||||
|
|
||||||
|
|
|
@ -202,7 +202,7 @@ public:
|
||||||
void MarkDirty();
|
void MarkDirty();
|
||||||
void ClearDirtyFlag();
|
void ClearDirtyFlag();
|
||||||
bool ConvertType(EPropertyType NewType, IProperty* pNewArchetype = nullptr);
|
bool ConvertType(EPropertyType NewType, IProperty* pNewArchetype = nullptr);
|
||||||
bool UsesNameMap();
|
bool UsesNameMap() const;
|
||||||
bool HasAccurateName();
|
bool HasAccurateName();
|
||||||
|
|
||||||
/** Accessors */
|
/** Accessors */
|
||||||
|
|
Loading…
Reference in New Issue