mirror of https://github.com/AxioDL/metaforce.git
57 lines
1.5 KiB
C++
57 lines
1.5 KiB
C++
#include "CMetaAnimSequence.hpp"
|
|
#include "CMetaAnimFactory.hpp"
|
|
#include "CAnimTreeSequence.hpp"
|
|
|
|
namespace urde
|
|
{
|
|
|
|
std::vector<std::shared_ptr<IMetaAnim>> CMetaAnimSequence::CreateSequence(CInputStream& in)
|
|
{
|
|
std::vector<std::shared_ptr<IMetaAnim>> ret;
|
|
u32 seqCount = in.readUint32Big();
|
|
ret.reserve(seqCount);
|
|
|
|
for (u32 i=0 ; i<seqCount ; ++i)
|
|
ret.push_back(CMetaAnimFactory::CreateMetaAnim(in));
|
|
|
|
return ret;
|
|
}
|
|
|
|
CMetaAnimSequence::CMetaAnimSequence(CInputStream& in)
|
|
: x4_sequence(CreateSequence(in)) {}
|
|
|
|
void CMetaAnimSequence::GetUniquePrimitives(std::set<CPrimitive>& primsOut) const
|
|
{
|
|
for (const std::shared_ptr<IMetaAnim>& anim : x4_sequence)
|
|
anim->GetUniquePrimitives(primsOut);
|
|
}
|
|
|
|
std::shared_ptr<CAnimTreeNode>
|
|
CMetaAnimSequence::VGetAnimationTree(const CAnimSysContext& animSys,
|
|
const CMetaAnimTreeBuildOrders& orders) const
|
|
{
|
|
if (orders.x0_recursiveAdvance)
|
|
{
|
|
CMetaAnimTreeBuildOrders modOrders;
|
|
modOrders.PreAdvanceForAll(*orders.x0_recursiveAdvance);
|
|
return GetAnimationTree(animSys, modOrders);
|
|
}
|
|
|
|
#if 0
|
|
std::vector<std::string> anims;
|
|
anims.reserve(anims.size());
|
|
for (const std::shared_ptr<IMetaAnim>& anim : x4_sequence)
|
|
{
|
|
std::shared_ptr<CAnimTreeNode> chNode = anim->GetAnimationTree(animSys, orders);
|
|
anims.emplace_back(chNode->GetName());
|
|
}
|
|
#endif
|
|
|
|
std::shared_ptr<CAnimTreeNode> ret =
|
|
std::make_shared<CAnimTreeSequence>(x4_sequence, animSys, "");
|
|
|
|
return ret;
|
|
}
|
|
|
|
}
|