metaforce/Runtime/Character/CAnimTreeDoubleChild.cpp

161 lines
6.3 KiB
C++
Raw Permalink Normal View History

#include "Runtime/Character/CAnimTreeDoubleChild.hpp"
2016-09-04 02:27:35 +00:00
2021-04-10 08:42:06 +00:00
namespace metaforce {
2016-09-04 02:27:35 +00:00
2018-12-08 05:30:43 +00:00
CAnimTreeDoubleChild::CAnimTreeDoubleChild(const std::weak_ptr<CAnimTreeNode>& a, const std::weak_ptr<CAnimTreeNode>& b,
2017-11-13 06:19:18 +00:00
std::string_view name)
2018-12-08 05:30:43 +00:00
: CAnimTreeNode(name), x14_a(a.lock()), x18_b(b.lock()) {}
2016-09-04 02:27:35 +00:00
CAnimTreeDoubleChild::CDoubleChildAdvancementResult
2018-12-08 05:30:43 +00:00
CAnimTreeDoubleChild::AdvanceViewBothChildren(const CCharAnimTime& time, bool runLeft, bool loopLeft) {
CCharAnimTime lRemTime = time;
CCharAnimTime totalTime;
if (!runLeft)
totalTime = CCharAnimTime();
else if (loopLeft)
totalTime = CCharAnimTime::Infinity();
else
totalTime = x14_a->VGetTimeRemaining();
SAdvancementDeltas leftDeltas, rightDeltas;
CCharAnimTime rRemTime = time;
if (time.GreaterThanZero()) {
while (lRemTime.GreaterThanZero() && !lRemTime.EpsilonZero() && totalTime.GreaterThanZero() &&
(loopLeft || !totalTime.EpsilonZero())) {
SAdvancementResults res = x14_a->VAdvanceView(lRemTime);
auto simp = x14_a->Simplified();
if (simp)
x14_a = CAnimTreeNode::Cast(std::move(*simp));
leftDeltas.x0_posDelta += res.x8_deltas.x0_posDelta;
leftDeltas.xc_rotDelta = leftDeltas.xc_rotDelta * res.x8_deltas.xc_rotDelta;
if (!loopLeft)
totalTime = x14_a->VGetTimeRemaining();
2018-12-08 05:30:43 +00:00
lRemTime = res.x0_remTime;
}
2018-12-08 05:30:43 +00:00
while (rRemTime.GreaterThanZero() && !rRemTime.EpsilonZero()) {
SAdvancementResults res = x18_b->VAdvanceView(rRemTime);
auto simp = x18_b->Simplified();
if (simp)
x18_b = CAnimTreeNode::Cast(std::move(*simp));
rightDeltas.x0_posDelta += res.x8_deltas.x0_posDelta;
rightDeltas.xc_rotDelta = rightDeltas.xc_rotDelta * res.x8_deltas.xc_rotDelta;
rRemTime = res.x0_remTime;
}
2018-12-08 05:30:43 +00:00
}
2018-12-08 05:30:43 +00:00
return {time, leftDeltas, rightDeltas};
}
2018-12-08 05:30:43 +00:00
SAdvancementResults CAnimTreeDoubleChild::VAdvanceView(const CCharAnimTime& a) {
SAdvancementResults resA = x14_a->VAdvanceView(a);
SAdvancementResults resB = x14_a->VAdvanceView(a);
return (resA.x0_remTime > resB.x0_remTime) ? resA : resB;
2016-09-04 02:27:35 +00:00
}
size_t CAnimTreeDoubleChild::VGetBoolPOIList(const CCharAnimTime& time, CBoolPOINode* listOut, size_t capacity,
size_t iterator, u32 unk) const {
size_t newCapacity = x14_a->GetBoolPOIList(time, listOut, capacity, iterator, unk);
2018-12-08 05:30:43 +00:00
newCapacity += x18_b->GetBoolPOIList(time, listOut, capacity, newCapacity + iterator, unk);
if (newCapacity > capacity) {
2018-12-08 05:30:43 +00:00
newCapacity = capacity;
}
2016-09-11 18:40:33 +00:00
2018-12-08 05:30:43 +00:00
std::sort(listOut, listOut + newCapacity);
2016-09-11 18:40:33 +00:00
2018-12-08 05:30:43 +00:00
return newCapacity;
2016-09-04 02:27:35 +00:00
}
size_t CAnimTreeDoubleChild::VGetInt32POIList(const CCharAnimTime& time, CInt32POINode* listOut, size_t capacity,
size_t iterator, u32 unk) const {
size_t newCapacity = x14_a->GetInt32POIList(time, listOut, capacity, iterator, unk);
2018-12-08 05:30:43 +00:00
newCapacity += x18_b->GetInt32POIList(time, listOut, capacity, newCapacity + iterator, unk);
if (newCapacity > capacity) {
2018-12-08 05:30:43 +00:00
newCapacity = capacity;
}
2016-09-11 18:40:33 +00:00
2018-12-08 05:30:43 +00:00
std::sort(listOut, listOut + newCapacity);
2016-09-11 18:40:33 +00:00
2018-12-08 05:30:43 +00:00
return newCapacity;
2016-09-04 02:27:35 +00:00
}
size_t CAnimTreeDoubleChild::VGetParticlePOIList(const CCharAnimTime& time, CParticlePOINode* listOut, size_t capacity,
size_t iterator, u32 unk) const {
size_t newCapacity = x14_a->GetParticlePOIList(time, listOut, capacity, iterator, unk);
2018-12-08 05:30:43 +00:00
newCapacity += x18_b->GetParticlePOIList(time, listOut, capacity, newCapacity + iterator, unk);
if (newCapacity > capacity) {
2018-12-08 05:30:43 +00:00
newCapacity = capacity;
}
2016-09-11 18:40:33 +00:00
2018-12-08 05:30:43 +00:00
std::sort(listOut, listOut + newCapacity);
2016-09-11 18:40:33 +00:00
2018-12-08 05:30:43 +00:00
return newCapacity;
2016-09-04 02:27:35 +00:00
}
size_t CAnimTreeDoubleChild::VGetSoundPOIList(const CCharAnimTime& time, CSoundPOINode* listOut, size_t capacity,
size_t iterator, u32 unk) const {
size_t newCapacity = x14_a->GetSoundPOIList(time, listOut, capacity, iterator, unk);
2018-12-08 05:30:43 +00:00
newCapacity += x18_b->GetSoundPOIList(time, listOut, capacity, newCapacity + iterator, unk);
if (newCapacity > capacity) {
2018-12-08 05:30:43 +00:00
newCapacity = capacity;
}
2016-09-11 18:40:33 +00:00
2018-12-08 05:30:43 +00:00
std::sort(listOut, listOut + newCapacity);
2018-06-08 01:15:46 +00:00
2018-12-08 05:30:43 +00:00
return newCapacity;
2016-09-04 02:27:35 +00:00
}
bool CAnimTreeDoubleChild::VGetBoolPOIState(std::string_view name) const { return x18_b->VGetBoolPOIState(name); }
2016-09-04 02:27:35 +00:00
s32 CAnimTreeDoubleChild::VGetInt32POIState(std::string_view name) const { return x18_b->VGetInt32POIState(name); }
2016-09-04 02:27:35 +00:00
CParticleData::EParentedMode CAnimTreeDoubleChild::VGetParticlePOIState(std::string_view name) const {
2018-12-08 05:30:43 +00:00
return x18_b->VGetParticlePOIState(name);
2016-09-04 02:27:35 +00:00
}
2018-12-08 05:30:43 +00:00
void CAnimTreeDoubleChild::VSetPhase(float phase) {
x14_a->VSetPhase(phase);
x18_b->VSetPhase(phase);
2016-09-04 02:27:35 +00:00
}
2018-12-08 05:30:43 +00:00
SAdvancementResults CAnimTreeDoubleChild::VGetAdvancementResults(const CCharAnimTime& a, const CCharAnimTime& b) const {
SAdvancementResults resA = x14_a->VGetAdvancementResults(a, b);
SAdvancementResults resB = x18_b->VGetAdvancementResults(a, b);
return (resA.x0_remTime > resB.x0_remTime) ? resA : resB;
2016-09-04 02:27:35 +00:00
}
2018-12-08 05:30:43 +00:00
u32 CAnimTreeDoubleChild::Depth() const { return std::max(x14_a->Depth(), x18_b->Depth()) + 1; }
2016-09-04 02:27:35 +00:00
2018-12-08 05:30:43 +00:00
CAnimTreeEffectiveContribution CAnimTreeDoubleChild::VGetContributionOfHighestInfluence() const {
CAnimTreeEffectiveContribution cA = x14_a->GetContributionOfHighestInfluence();
CAnimTreeEffectiveContribution cB = x18_b->GetContributionOfHighestInfluence();
2018-01-30 01:04:01 +00:00
2018-12-08 05:30:43 +00:00
float leftWeight = (1.f - VGetRightChildWeight()) * cA.GetContributionWeight();
float rightWeight = VGetRightChildWeight() * cB.GetContributionWeight();
2018-01-30 01:04:01 +00:00
2018-12-08 05:30:43 +00:00
if (leftWeight > rightWeight) {
return {leftWeight, cA.GetPrimitiveName(), cA.GetSteadyStateAnimInfo(), cA.GetTimeRemaining(),
cA.GetAnimDatabaseIndex()};
} else {
return {rightWeight, cB.GetPrimitiveName(), cB.GetSteadyStateAnimInfo(), cB.GetTimeRemaining(),
cB.GetAnimDatabaseIndex()};
}
2016-09-04 02:27:35 +00:00
}
2018-12-08 05:30:43 +00:00
u32 CAnimTreeDoubleChild::VGetNumChildren() const { return x14_a->VGetNumChildren() + x18_b->VGetNumChildren() + 2; }
2016-09-04 02:27:35 +00:00
2018-12-08 05:30:43 +00:00
std::shared_ptr<IAnimReader> CAnimTreeDoubleChild::VGetBestUnblendedChild() const {
std::shared_ptr<CAnimTreeNode> bestChild = (VGetRightChildWeight() > 0.5f) ? x18_b : x14_a;
if (!bestChild)
return {};
return bestChild->GetBestUnblendedChild();
2016-09-04 02:27:35 +00:00
}
void CAnimTreeDoubleChild::VGetWeightedReaders(
2018-12-08 05:30:43 +00:00
rstl::reserved_vector<std::pair<float, std::weak_ptr<IAnimReader>>, 16>& out, float w) const {
x14_a->VGetWeightedReaders(out, w);
x18_b->VGetWeightedReaders(out, w);
2016-09-04 02:27:35 +00:00
}
2021-04-10 08:42:06 +00:00
} // namespace metaforce