Relintai/pandemonium_engine
1
0
Fork 0
mirror of https://github.com/Relintai/pandemonium_engine.git synced 2025-01-23 17:47:17 +01:00
Code Issues Packages Projects Releases Wiki Activity

Fix typo.

Browse Source
This commit is contained in:
Relintai 2022-06-11 23:01:00 +02:00
parent aa38f53ed2
commit 667f466b9c
1 changed files with 16 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
core/pool_vector.h
View File

@ -377,7 +377,9 @@ public:
T get(int p_index) const; T get(int p_index) const;
void set(int p_index, const T &p_val); void set(int p_index, const T &p_val);
void push_back(const T &p_val); void push_back(const T &p_val);
void append(const T &p_val) { push_back(p_val); } void append(const T &p_val) {
push_back(p_val);
}
void append_array(const PoolVector<T> &p_arr) { void append_array(const PoolVector<T> &p_arr) {
int ds = p_arr.size(); int ds = p_arr.size();
if (ds == 0) { if (ds == 0) {
@ -443,7 +445,9 @@ public:
bool contains(const T &p_val) const; bool contains(const T &p_val) const;
bool is_locked() const { return alloc && alloc->lock.get() > 0; } bool is_locked() const {
return alloc && alloc->lock.get() > 0;
}
inline T operator[](int p_index) const; inline T operator[](int p_index) const;
@ -451,13 +455,19 @@ public:
void invert(); void invert();
void operator=(const PoolVector &p_pool_vector) { _reference(p_pool_vector); } void operator=(const PoolVector &p_pool_vector) {
PoolVector() { alloc = nullptr; } _reference(p_pool_vector);
}
PoolVector() {
alloc = nullptr;
}
PoolVector(const PoolVector &p_pool_vector) { PoolVector(const PoolVector &p_pool_vector) {
alloc = nullptr; alloc = nullptr;
_reference(p_pool_vector); _reference(p_pool_vector);
} }
~PoolVector() { _unreference(); } ~PoolVector() {
_unreference();
}
}; };
template <class T> template <class T>
@ -494,7 +504,7 @@ bool PoolVector<T>::contains(const T &p_val) const {
Read r = read(); Read r = read();
int s = size(); int s = size();
for (int i = 0; i < s; ++s) { for (int i = 0; i < s; ++i) {
if (r[i] == p_val) { if (r[i] == p_val) {
return true; return true;
} }