51 lines
1.6 KiB
C++

#include "UnionsPostProcessor.h"
#include <algorithm>
#include <iostream>
bool UnionsPostProcessor::ProcessUnion(StructureInformation* info)
{
auto index = 0u;
auto lastEntryWithoutCondition = 0u;
auto entriesWithoutConditionCount = 0u;
for(const auto& member : info->m_ordered_members)
{
if(!member->m_condition && !member->m_is_leaf)
{
entriesWithoutConditionCount++;
lastEntryWithoutCondition = index;
}
index++;
}
if (entriesWithoutConditionCount > 1 && !info->m_usages.empty() && !info->m_is_leaf)
{
std::cout << "Union '" << info->m_definition->GetFullName() << "' has more than one entry without a condition!" << std::endl;
return false;
}
if (entriesWithoutConditionCount == 1)
{
// If there is only one entry without condition make it the last of the ordered members
auto entryWithoutCondition = std::move(info->m_ordered_members.at(lastEntryWithoutCondition));
info->m_ordered_members.erase(info->m_ordered_members.begin() + lastEntryWithoutCondition);
info->m_ordered_members.emplace_back(std::move(entryWithoutCondition));
}
return true;
}
bool UnionsPostProcessor::PostProcess(IDataRepository* repository)
{
const auto& allInfos = repository->GetAllStructureInformation();
return std::all_of(allInfos.begin(), allInfos.end(), [](StructureInformation* info)
{
if (info->m_definition->GetType() != DataDefinitionType::UNION)
return true;
return ProcessUnion(info);
});
}