forked from twig33/ynoclient
-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy pathdrawable_list.cpp
113 lines (92 loc) · 2.5 KB
/
drawable_list.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
/*
* This file is part of EasyRPG Player.
*
* EasyRPG Player is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* EasyRPG Player is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with EasyRPG Player. If not, see <http://www.gnu.org/licenses/>.
*/
// Headers
#include "drawable_list.h"
#include "drawable_mgr.h"
#include <algorithm>
#include <cassert>
static bool DrawCmp(Drawable* l, Drawable* r) {
return l->GetZ() < r->GetZ();
}
DrawableList::~DrawableList() {
if (DrawableMgr::GetLocalListPtr() == this) {
DrawableMgr::SetLocalList(nullptr);
}
}
void DrawableList::Clear() {
_list.clear();
SetClean();
}
bool DrawableList::IsSorted() const {
return std::is_sorted(_list.begin(), _list.end(), DrawCmp);
}
void DrawableList::Sort() {
// stable sort to work around a flickering event sprite issue when
// the map is scrolling (have same Z value)
std::stable_sort(_list.begin(), _list.end(), DrawCmp);
SetClean();
}
void DrawableList::Append(Drawable* ptr) {
assert(ptr != nullptr);
assert(_list.end() == std::find(_list.begin(), _list.end(), ptr));
const bool ordered = _list.empty() || !DrawCmp(ptr, _list.back());
_list.push_back(ptr);
if (!ordered) {
SetDirty();
}
}
Drawable* DrawableList::Take(Drawable* ptr) {
auto iter = std::find(_list.begin(), _list.end(), ptr);
if (iter == _list.end()) {
return nullptr;
}
auto ret = *iter;
// FIXME: Can we remove this O(N) operation here?
_list.erase(iter);
return ret;
// Removing doesn't change sorted order, so not dirty flag.
}
void DrawableList::TakeFrom(DrawableList& other) noexcept {
if (&other == this) { return; }
auto& olist = other._list;
if (olist.empty()) {
return;
}
_list.insert(_list.end(), olist.begin(), olist.end());
olist.clear();
SetDirty();
other.SetClean();
}
void DrawableList::Draw(Bitmap& dst, int min_z, int max_z) {
if (IsDirty()) {
Sort();
} else {
assert(IsSorted());
}
for (auto* drawable : _list) {
auto z = drawable->GetZ();
if (z < min_z) {
continue;
}
if (z > max_z) {
break;
}
if (drawable->IsVisible()) {
drawable->Draw(dst);
}
}
}