172 lines
4.6 KiB
C++
172 lines
4.6 KiB
C++
|
|
#include "animqueue.hpp"
|
|
#include "luastack.hpp"
|
|
#include <limits>
|
|
|
|
|
|
AnimStep::AnimStep() {}
|
|
AnimStep::~AnimStep() {}
|
|
|
|
AnimQueue::AnimQueue() {
|
|
size_limit_ = 10; // Default size limit.
|
|
steps_.emplace_back();
|
|
AnimStep &init = steps_.back();
|
|
init.id_ = 0;
|
|
init.facing_ = 0;
|
|
init.xyz_ = util::XYZ(0,0,0);
|
|
init.graphic_ = "nothing";
|
|
init.plane_ = "nowhere";
|
|
init.bits_ = AnimStep::HAS_EVERYTHING;
|
|
}
|
|
|
|
void AnimQueue::set_size_limit(int n) {
|
|
assert(n >= 2);
|
|
size_limit_ = n;
|
|
}
|
|
|
|
void AnimQueue::add(int64_t id, const std::string &action) {
|
|
steps_.emplace_back();
|
|
AnimStep &last = steps_.back();
|
|
last = steps_[steps_.size() - 2];
|
|
last.id_ = id;
|
|
last.action_ = action;
|
|
last.bits_ = 0;
|
|
|
|
while (int(steps_.size()) > size_limit_) {
|
|
steps_.pop_front();
|
|
}
|
|
AnimStep &init = steps_.front();
|
|
init.id_ = 0;
|
|
init.action_ = "";
|
|
init.bits_ = AnimStep::HAS_EVERYTHING;
|
|
}
|
|
|
|
void AnimQueue::set_facing(float f) {
|
|
AnimStep &last = steps_.back();
|
|
last.bits_ |= AnimStep::HAS_FACING;
|
|
last.facing_ = f;
|
|
}
|
|
|
|
void AnimQueue::set_xyz(util::XYZ xyz) {
|
|
AnimStep &last = steps_.back();
|
|
last.bits_ |= AnimStep::HAS_XYZ;
|
|
last.xyz_ = xyz;
|
|
}
|
|
|
|
void AnimQueue::set_graphic(const std::string &g) {
|
|
AnimStep &last = steps_.back();
|
|
last.bits_ |= AnimStep::HAS_GRAPHIC;
|
|
last.graphic_ = g;
|
|
}
|
|
|
|
void AnimQueue::set_plane(const std::string &p) {
|
|
AnimStep &last = steps_.back();
|
|
last.bits_ |= AnimStep::HAS_PLANE;
|
|
last.plane_ = p;
|
|
}
|
|
|
|
const std::string &AnimQueue::get_graphic() const {
|
|
const AnimStep &last = steps_.back();
|
|
return last.graphic_;
|
|
}
|
|
|
|
const std::string &AnimQueue::get_plane() const {
|
|
const AnimStep &last = steps_.back();
|
|
return last.plane_;
|
|
}
|
|
|
|
const util::XYZ &AnimQueue::get_xyz() const {
|
|
const AnimStep &last = steps_.back();
|
|
return last.xyz_;
|
|
}
|
|
|
|
void AnimView::update_from(const AnimQueue &queue) {
|
|
id_ = queue.get_id();
|
|
graphic_ = queue.get_graphic();
|
|
plane_ = queue.get_plane();
|
|
xyz_ = queue.get_xyz();
|
|
updated_ = true;
|
|
}
|
|
|
|
AnimView *AnimViewMap::get_one(int64_t id) {
|
|
auto iter = view_map_.find(id);
|
|
if (iter == view_map_.end()) {
|
|
return nullptr;
|
|
} else {
|
|
return &iter->second;
|
|
}
|
|
}
|
|
|
|
void AnimViewMap::clear_updated_bits() {
|
|
for (auto pair : view_map_) {
|
|
pair.second.updated_ = false;
|
|
}
|
|
}
|
|
|
|
void AnimViewMap::delete_non_updated() {
|
|
for (auto iter = view_map_.begin(); iter != view_map_.end(); ) {
|
|
if (iter->second.updated_) {
|
|
iter++;
|
|
} else {
|
|
iter = view_map_.erase(iter);
|
|
}
|
|
}
|
|
}
|
|
|
|
void AnimViewMap::update_one(const AnimQueue &queue) {
|
|
view_map_[queue.get_id()].update_from(queue);
|
|
}
|
|
|
|
LuaDefine(unittests_animqueue, "c") {
|
|
// Check initial state.
|
|
AnimQueue aq;
|
|
aq.set_size_limit(3);
|
|
|
|
LuaAssert(L, aq.size() == 1);
|
|
const AnimStep *st = &aq.nth(0);
|
|
LuaAssert(L, st->id() == 0);
|
|
LuaAssert(L, st->action() == "");
|
|
LuaAssert(L, st->bits() == AnimStep::HAS_EVERYTHING);
|
|
LuaAssert(L, st->facing() == 0.0);
|
|
LuaAssert(L, st->xyz() == util::XYZ(0,0,0));
|
|
LuaAssert(L, st->graphic() == "nothing");
|
|
LuaAssert(L, st->plane() == "nowhere");
|
|
|
|
// Add a step.
|
|
aq.add(12345, "walk");
|
|
LuaAssert(L, aq.size() == 2);
|
|
st = &aq.nth(1);
|
|
LuaAssert(L, st->id() == 12345);
|
|
LuaAssert(L, st->action() == "walk");
|
|
LuaAssert(L, st->bits() == 0);
|
|
LuaAssert(L, st->facing() == 0.0);
|
|
LuaAssert(L, st->xyz() == util::XYZ(0,0,0));
|
|
LuaAssert(L, st->graphic() == "nothing");
|
|
LuaAssert(L, st->plane() == "nowhere");
|
|
|
|
// Test the setters.
|
|
aq.set_facing(180);
|
|
LuaAssert(L, st->facing() == 180);
|
|
LuaAssert(L, st->bits() == AnimStep::HAS_FACING);
|
|
aq.set_xyz(util::XYZ(3,4,5));
|
|
LuaAssert(L, st->xyz() == util::XYZ(3, 4, 5));
|
|
LuaAssert(L, st->bits() == (AnimStep::HAS_FACING | AnimStep::HAS_XYZ));
|
|
aq.set_plane("somewhere");
|
|
LuaAssert(L, st->plane() == "somewhere");
|
|
LuaAssert(L, st->bits() == (AnimStep::HAS_FACING | AnimStep::HAS_XYZ | AnimStep::HAS_PLANE));
|
|
aq.set_graphic("something");
|
|
LuaAssert(L, st->graphic() == "something");
|
|
LuaAssert(L, st->bits() == (AnimStep::HAS_FACING | AnimStep::HAS_XYZ | AnimStep::HAS_PLANE | AnimStep::HAS_GRAPHIC));
|
|
|
|
// Exceed the length limit, dropping first element.
|
|
aq.add(12346, "walk");
|
|
aq.add(12347, "walk");
|
|
LuaAssert(L, aq.size() == 3);
|
|
LuaAssert(L, aq.nth(0).id() == 0);
|
|
LuaAssert(L, aq.nth(0).action() == "");
|
|
LuaAssert(L, aq.nth(0).bits() == AnimStep::HAS_EVERYTHING);
|
|
LuaAssert(L, aq.nth(1).id() == 12346);
|
|
LuaAssert(L, aq.nth(2).id() == 12347);
|
|
return 0;
|
|
}
|