optimization

This commit is contained in:
Jorijn van der Graaf 2025-11-26 00:00:50 +01:00
commit bf6793e41d
5 changed files with 51 additions and 43 deletions

View file

@ -61,27 +61,12 @@ namespace Crafter {
std::vector<Keyframe<T>> keyframes;
std::uint_fast32_t currentFrame;
std::chrono::time_point<std::chrono::high_resolution_clock> startedAt;
mutable T cachedValue; // Cache the last computed value
mutable std::chrono::time_point<std::chrono::high_resolution_clock> lastTime; // Track when cached value was computed
Animation(std::vector<Keyframe<T>>&& keyframes) : keyframes(std::move(keyframes)), currentFrame(0) {}
Animation(std::vector<Keyframe<T>>&& keyframes) : keyframes(std::move(keyframes)) {}
void Start(std::chrono::time_point<std::chrono::high_resolution_clock> time) {
currentFrame = 0;
startedAt = time;
// Invalidate cache
lastTime = std::chrono::time_point<std::chrono::high_resolution_clock>();
}
T Play(std::chrono::time_point<std::chrono::high_resolution_clock> time) {
// Check if we can reuse cached value
if (lastTime != std::chrono::time_point<std::chrono::high_resolution_clock>()) {
// Only use cached value if we haven't moved forward in time
if (time <= lastTime) {
return cachedValue;
}
}
std::chrono::duration<double> elapsed = time - startedAt; // elapsed time since animation started
std::chrono::duration<double> accumulated(0);
@ -92,21 +77,17 @@ namespace Crafter {
auto t = (elapsed - frameStartTime) / keyframes[i+1].duration.count();
currentFrame = i;
cachedValue = LerpTuple(
return LerpTuple(
keyframes[i].values,
keyframes[i + 1].values,
t.count()
);
lastTime = time;
return cachedValue;
}
}
// If we get here, we're past the last keyframe
currentFrame = keyframes.size() - 1;
cachedValue = keyframes.back().values;
lastTime = time;
return cachedValue;
return keyframes.back().values;
}
};
}