2014-02-10 01:10:30 +00:00
|
|
|
/*************************************************************************/
|
|
|
|
/* vector.h */
|
|
|
|
/*************************************************************************/
|
|
|
|
/* This file is part of: */
|
|
|
|
/* GODOT ENGINE */
|
2017-08-27 12:16:55 +00:00
|
|
|
/* https://godotengine.org */
|
2014-02-10 01:10:30 +00:00
|
|
|
/*************************************************************************/
|
2022-01-03 20:27:34 +00:00
|
|
|
/* Copyright (c) 2007-2022 Juan Linietsky, Ariel Manzur. */
|
|
|
|
/* Copyright (c) 2014-2022 Godot Engine contributors (cf. AUTHORS.md). */
|
2014-02-10 01:10:30 +00:00
|
|
|
/* */
|
|
|
|
/* Permission is hereby granted, free of charge, to any person obtaining */
|
|
|
|
/* a copy of this software and associated documentation files (the */
|
|
|
|
/* "Software"), to deal in the Software without restriction, including */
|
|
|
|
/* without limitation the rights to use, copy, modify, merge, publish, */
|
|
|
|
/* distribute, sublicense, and/or sell copies of the Software, and to */
|
|
|
|
/* permit persons to whom the Software is furnished to do so, subject to */
|
|
|
|
/* the following conditions: */
|
|
|
|
/* */
|
|
|
|
/* The above copyright notice and this permission notice shall be */
|
|
|
|
/* included in all copies or substantial portions of the Software. */
|
|
|
|
/* */
|
|
|
|
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
|
|
|
|
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
|
|
|
|
/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*/
|
|
|
|
/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
|
|
|
|
/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
|
|
|
|
/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
|
|
|
|
/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
|
|
|
|
/*************************************************************************/
|
2018-01-04 23:50:27 +00:00
|
|
|
|
2014-02-10 01:10:30 +00:00
|
|
|
#ifndef VECTOR_H
|
|
|
|
#define VECTOR_H
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @class Vector
|
|
|
|
* @author Juan Linietsky
|
2020-02-17 21:06:54 +00:00
|
|
|
* Vector container. Regular Vector Container. Use with care and for smaller arrays when possible. Use Vector for large arrays.
|
2021-10-28 13:43:36 +00:00
|
|
|
*/
|
2018-09-11 16:13:45 +00:00
|
|
|
|
2020-11-07 22:33:38 +00:00
|
|
|
#include "core/error/error_macros.h"
|
2018-09-11 16:13:45 +00:00
|
|
|
#include "core/os/memory.h"
|
2020-11-07 22:33:38 +00:00
|
|
|
#include "core/templates/cowdata.h"
|
2021-09-19 18:13:09 +00:00
|
|
|
#include "core/templates/search_array.h"
|
2020-11-07 22:33:38 +00:00
|
|
|
#include "core/templates/sort_array.h"
|
2014-02-10 01:10:30 +00:00
|
|
|
|
2017-03-05 15:44:50 +00:00
|
|
|
template <class T>
|
2018-07-25 01:11:03 +00:00
|
|
|
class VectorWriteProxy {
|
|
|
|
public:
|
|
|
|
_FORCE_INLINE_ T &operator[](int p_index) {
|
2018-12-14 20:03:02 +00:00
|
|
|
CRASH_BAD_INDEX(p_index, ((Vector<T> *)(this))->_cowdata.size());
|
2016-02-19 06:13:16 +00:00
|
|
|
|
2018-12-14 20:03:02 +00:00
|
|
|
return ((Vector<T> *)(this))->_cowdata.ptrw()[p_index];
|
2016-02-19 06:13:16 +00:00
|
|
|
}
|
2018-07-25 01:11:03 +00:00
|
|
|
};
|
2016-03-08 23:00:52 +00:00
|
|
|
|
2018-07-25 01:11:03 +00:00
|
|
|
template <class T>
|
|
|
|
class Vector {
|
|
|
|
friend class VectorWriteProxy<T>;
|
2016-03-08 23:00:52 +00:00
|
|
|
|
2017-03-05 15:44:50 +00:00
|
|
|
public:
|
2018-07-25 01:11:03 +00:00
|
|
|
VectorWriteProxy<T> write;
|
2016-03-08 23:00:52 +00:00
|
|
|
|
2018-12-14 20:03:02 +00:00
|
|
|
private:
|
|
|
|
CowData<T> _cowdata;
|
|
|
|
|
|
|
|
public:
|
2019-12-26 16:38:08 +00:00
|
|
|
bool push_back(T p_elem);
|
2020-02-17 21:06:54 +00:00
|
|
|
_FORCE_INLINE_ bool append(const T &p_elem) { return push_back(p_elem); } //alias
|
2021-02-25 14:10:39 +00:00
|
|
|
void fill(T p_elem);
|
2016-03-08 23:00:52 +00:00
|
|
|
|
2021-07-03 22:17:03 +00:00
|
|
|
void remove_at(int p_index) { _cowdata.remove_at(p_index); }
|
2017-03-05 15:44:50 +00:00
|
|
|
void erase(const T &p_val) {
|
|
|
|
int idx = find(p_val);
|
2020-05-14 14:41:43 +00:00
|
|
|
if (idx >= 0) {
|
2021-07-03 22:17:03 +00:00
|
|
|
remove_at(idx);
|
2020-05-14 14:41:43 +00:00
|
|
|
}
|
2020-02-17 21:06:54 +00:00
|
|
|
}
|
2021-03-14 07:21:32 +00:00
|
|
|
void reverse();
|
2014-02-10 01:10:30 +00:00
|
|
|
|
2018-12-14 20:03:02 +00:00
|
|
|
_FORCE_INLINE_ T *ptrw() { return _cowdata.ptrw(); }
|
|
|
|
_FORCE_INLINE_ const T *ptr() const { return _cowdata.ptr(); }
|
2018-07-25 01:11:03 +00:00
|
|
|
_FORCE_INLINE_ void clear() { resize(0); }
|
2020-12-15 12:04:21 +00:00
|
|
|
_FORCE_INLINE_ bool is_empty() const { return _cowdata.is_empty(); }
|
2016-03-08 23:00:52 +00:00
|
|
|
|
2018-12-14 20:03:02 +00:00
|
|
|
_FORCE_INLINE_ T get(int p_index) { return _cowdata.get(p_index); }
|
2020-09-11 10:58:47 +00:00
|
|
|
_FORCE_INLINE_ const T &get(int p_index) const { return _cowdata.get(p_index); }
|
2018-12-14 20:03:02 +00:00
|
|
|
_FORCE_INLINE_ void set(int p_index, const T &p_elem) { _cowdata.set(p_index, p_elem); }
|
|
|
|
_FORCE_INLINE_ int size() const { return _cowdata.size(); }
|
|
|
|
Error resize(int p_size) { return _cowdata.resize(p_size); }
|
|
|
|
_FORCE_INLINE_ const T &operator[](int p_index) const { return _cowdata.get(p_index); }
|
2019-12-26 16:38:08 +00:00
|
|
|
Error insert(int p_pos, T p_val) { return _cowdata.insert(p_pos, p_val); }
|
2019-01-07 17:02:55 +00:00
|
|
|
int find(const T &p_val, int p_from = 0) const { return _cowdata.find(p_val, p_from); }
|
2014-02-10 01:10:30 +00:00
|
|
|
|
2019-12-26 16:38:08 +00:00
|
|
|
void append_array(Vector<T> p_other);
|
2017-11-21 00:11:39 +00:00
|
|
|
|
2021-09-10 01:54:18 +00:00
|
|
|
bool has(const T &p_val) const {
|
2020-02-21 04:19:00 +00:00
|
|
|
return find(p_val, 0) != -1;
|
|
|
|
}
|
|
|
|
|
2017-03-05 15:44:50 +00:00
|
|
|
template <class C>
|
2014-02-10 01:10:30 +00:00
|
|
|
void sort_custom() {
|
2018-12-14 20:03:02 +00:00
|
|
|
int len = _cowdata.size();
|
2020-05-14 14:41:43 +00:00
|
|
|
if (len == 0) {
|
2014-02-10 01:10:30 +00:00
|
|
|
return;
|
2020-05-14 14:41:43 +00:00
|
|
|
}
|
2018-07-25 01:11:03 +00:00
|
|
|
|
|
|
|
T *data = ptrw();
|
2017-03-05 15:44:50 +00:00
|
|
|
SortArray<T, C> sorter;
|
|
|
|
sorter.sort(data, len);
|
2014-02-10 01:10:30 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void sort() {
|
2020-03-17 06:33:00 +00:00
|
|
|
sort_custom<_DefaultComparator<T>>();
|
2014-02-10 01:10:30 +00:00
|
|
|
}
|
|
|
|
|
2021-09-19 18:13:09 +00:00
|
|
|
int bsearch(const T &p_value, bool p_before) {
|
|
|
|
SearchArray<T> search;
|
|
|
|
return search.bisect(ptrw(), size(), p_value, p_before);
|
|
|
|
}
|
|
|
|
|
2020-12-17 20:26:05 +00:00
|
|
|
Vector<T> duplicate() {
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2017-03-05 15:44:50 +00:00
|
|
|
void ordered_insert(const T &p_val) {
|
|
|
|
int i;
|
2018-12-14 20:03:02 +00:00
|
|
|
for (i = 0; i < _cowdata.size(); i++) {
|
2017-03-05 15:44:50 +00:00
|
|
|
if (p_val < operator[](i)) {
|
|
|
|
break;
|
2020-05-19 13:46:49 +00:00
|
|
|
}
|
|
|
|
}
|
2017-03-05 15:44:50 +00:00
|
|
|
insert(i, p_val);
|
2015-03-19 23:53:54 +00:00
|
|
|
}
|
2014-02-10 01:10:30 +00:00
|
|
|
|
2021-11-30 14:19:26 +00:00
|
|
|
inline void operator=(const Vector &p_from) {
|
2018-12-14 20:03:02 +00:00
|
|
|
_cowdata._ref(p_from._cowdata);
|
2014-02-10 01:10:30 +00:00
|
|
|
}
|
2018-07-29 14:57:05 +00:00
|
|
|
|
2020-05-01 12:34:23 +00:00
|
|
|
Vector<uint8_t> to_byte_array() const {
|
|
|
|
Vector<uint8_t> ret;
|
|
|
|
ret.resize(size() * sizeof(T));
|
2021-04-27 14:19:21 +00:00
|
|
|
memcpy(ret.ptrw(), ptr(), sizeof(T) * size());
|
2020-05-01 12:34:23 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2021-11-27 01:18:26 +00:00
|
|
|
Vector<T> slice(int p_begin, int p_end) const {
|
|
|
|
Vector<T> result;
|
|
|
|
|
|
|
|
if (p_end < 0) {
|
|
|
|
p_end += size() + 1;
|
2020-02-17 21:06:54 +00:00
|
|
|
}
|
|
|
|
|
2021-11-27 01:18:26 +00:00
|
|
|
ERR_FAIL_INDEX_V(p_begin, size(), result);
|
|
|
|
ERR_FAIL_INDEX_V(p_end, size() + 1, result);
|
|
|
|
|
|
|
|
ERR_FAIL_COND_V(p_begin > p_end, result);
|
|
|
|
|
|
|
|
int result_size = p_end - p_begin;
|
|
|
|
result.resize(result_size);
|
2020-02-17 21:06:54 +00:00
|
|
|
|
2021-11-27 01:18:26 +00:00
|
|
|
const T *const r = ptr();
|
|
|
|
T *const w = result.ptrw();
|
|
|
|
for (int i = 0; i < result_size; ++i) {
|
|
|
|
w[i] = r[p_begin + i];
|
2020-02-17 21:06:54 +00:00
|
|
|
}
|
|
|
|
|
2021-11-27 01:18:26 +00:00
|
|
|
return result;
|
2020-02-17 21:06:54 +00:00
|
|
|
}
|
|
|
|
|
2020-11-05 02:01:55 +00:00
|
|
|
bool operator==(const Vector<T> &p_arr) const {
|
|
|
|
int s = size();
|
|
|
|
if (s != p_arr.size()) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
for (int i = 0; i < s; i++) {
|
|
|
|
if (operator[](i) != p_arr[i]) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool operator!=(const Vector<T> &p_arr) const {
|
|
|
|
int s = size();
|
|
|
|
if (s != p_arr.size()) {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
for (int i = 0; i < s; i++) {
|
|
|
|
if (operator[](i) != p_arr[i]) {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
Implement Range Iterators
This PR implements range iterators in the base containers (Vector, Map, List, Pair Set).
Given several of these data structures will be replaced by more efficient versions, having a common iterator API will make this simpler.
Iterating can be done as follows (examples):
```C++
//Vector<String>
for(const String& I: vector) {
}
//List<String>
for(const String& I: list) {
}
//Map<String,int>
for(const KeyValue<String,int>&I : map) {
print_line("key: "+I.key+" value: "+itos(I.value));
}
//if intending to write the elements, reference can be used
//Map<String,int>
for(KeyValue<String,int>& I: map) {
I.value = 25;
//this will fail because key is always const
//I.key = "hello"
}
```
The containers are (for now) not STL compatible, since this would mean changing how they work internally (STL uses a special head/tail allocation for end(), while Godot Map/Set/List do not).
The idea is to change the Godot versions to be more compatible with STL, but this will happen after conversion to new iterators have taken place.
2021-07-08 15:31:19 +00:00
|
|
|
struct Iterator {
|
|
|
|
_FORCE_INLINE_ T &operator*() const {
|
|
|
|
return *elem_ptr;
|
|
|
|
}
|
|
|
|
_FORCE_INLINE_ T *operator->() const { return elem_ptr; }
|
|
|
|
_FORCE_INLINE_ Iterator &operator++() {
|
|
|
|
elem_ptr++;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
_FORCE_INLINE_ Iterator &operator--() {
|
|
|
|
elem_ptr--;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
_FORCE_INLINE_ bool operator==(const Iterator &b) const { return elem_ptr == b.elem_ptr; }
|
|
|
|
_FORCE_INLINE_ bool operator!=(const Iterator &b) const { return elem_ptr != b.elem_ptr; }
|
|
|
|
|
|
|
|
Iterator(T *p_ptr) { elem_ptr = p_ptr; }
|
|
|
|
Iterator() {}
|
|
|
|
Iterator(const Iterator &p_it) { elem_ptr = p_it.elem_ptr; }
|
|
|
|
|
|
|
|
private:
|
|
|
|
T *elem_ptr = nullptr;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct ConstIterator {
|
|
|
|
_FORCE_INLINE_ const T &operator*() const {
|
|
|
|
return *elem_ptr;
|
|
|
|
}
|
|
|
|
_FORCE_INLINE_ const T *operator->() const { return elem_ptr; }
|
|
|
|
_FORCE_INLINE_ ConstIterator &operator++() {
|
|
|
|
elem_ptr++;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
_FORCE_INLINE_ ConstIterator &operator--() {
|
|
|
|
elem_ptr--;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
_FORCE_INLINE_ bool operator==(const ConstIterator &b) const { return elem_ptr == b.elem_ptr; }
|
|
|
|
_FORCE_INLINE_ bool operator!=(const ConstIterator &b) const { return elem_ptr != b.elem_ptr; }
|
|
|
|
|
2021-08-23 17:00:33 +00:00
|
|
|
ConstIterator(const T *p_ptr) { elem_ptr = p_ptr; }
|
Implement Range Iterators
This PR implements range iterators in the base containers (Vector, Map, List, Pair Set).
Given several of these data structures will be replaced by more efficient versions, having a common iterator API will make this simpler.
Iterating can be done as follows (examples):
```C++
//Vector<String>
for(const String& I: vector) {
}
//List<String>
for(const String& I: list) {
}
//Map<String,int>
for(const KeyValue<String,int>&I : map) {
print_line("key: "+I.key+" value: "+itos(I.value));
}
//if intending to write the elements, reference can be used
//Map<String,int>
for(KeyValue<String,int>& I: map) {
I.value = 25;
//this will fail because key is always const
//I.key = "hello"
}
```
The containers are (for now) not STL compatible, since this would mean changing how they work internally (STL uses a special head/tail allocation for end(), while Godot Map/Set/List do not).
The idea is to change the Godot versions to be more compatible with STL, but this will happen after conversion to new iterators have taken place.
2021-07-08 15:31:19 +00:00
|
|
|
ConstIterator() {}
|
|
|
|
ConstIterator(const ConstIterator &p_it) { elem_ptr = p_it.elem_ptr; }
|
|
|
|
|
|
|
|
private:
|
|
|
|
const T *elem_ptr = nullptr;
|
|
|
|
};
|
|
|
|
|
|
|
|
_FORCE_INLINE_ Iterator begin() {
|
|
|
|
return Iterator(ptrw());
|
|
|
|
}
|
|
|
|
_FORCE_INLINE_ Iterator end() {
|
|
|
|
return Iterator(ptrw() + size());
|
|
|
|
}
|
|
|
|
|
|
|
|
_FORCE_INLINE_ ConstIterator begin() const {
|
|
|
|
return ConstIterator(ptr());
|
|
|
|
}
|
|
|
|
_FORCE_INLINE_ ConstIterator end() const {
|
|
|
|
return ConstIterator(ptr() + size());
|
|
|
|
}
|
|
|
|
|
2020-05-12 15:01:17 +00:00
|
|
|
_FORCE_INLINE_ Vector() {}
|
|
|
|
_FORCE_INLINE_ Vector(const Vector &p_from) { _cowdata._ref(p_from._cowdata); }
|
|
|
|
|
2018-12-14 20:03:02 +00:00
|
|
|
_FORCE_INLINE_ ~Vector() {}
|
2018-07-25 01:11:03 +00:00
|
|
|
};
|
2014-02-10 01:10:30 +00:00
|
|
|
|
2017-03-05 15:44:50 +00:00
|
|
|
template <class T>
|
2021-03-14 07:21:32 +00:00
|
|
|
void Vector<T>::reverse() {
|
2017-03-05 15:44:50 +00:00
|
|
|
for (int i = 0; i < size() / 2; i++) {
|
2018-07-25 01:11:03 +00:00
|
|
|
T *p = ptrw();
|
|
|
|
SWAP(p[i], p[size() - i - 1]);
|
2017-01-06 13:15:44 +00:00
|
|
|
}
|
2014-02-10 01:10:30 +00:00
|
|
|
}
|
|
|
|
|
2017-11-21 00:11:39 +00:00
|
|
|
template <class T>
|
2019-12-26 16:38:08 +00:00
|
|
|
void Vector<T>::append_array(Vector<T> p_other) {
|
2017-11-21 00:11:39 +00:00
|
|
|
const int ds = p_other.size();
|
2020-05-14 14:41:43 +00:00
|
|
|
if (ds == 0) {
|
2017-11-21 00:11:39 +00:00
|
|
|
return;
|
2020-05-14 14:41:43 +00:00
|
|
|
}
|
2017-11-21 00:11:39 +00:00
|
|
|
const int bs = size();
|
|
|
|
resize(bs + ds);
|
2020-05-14 14:41:43 +00:00
|
|
|
for (int i = 0; i < ds; ++i) {
|
2018-07-25 01:11:03 +00:00
|
|
|
ptrw()[bs + i] = p_other[i];
|
2020-05-14 14:41:43 +00:00
|
|
|
}
|
2014-02-10 01:10:30 +00:00
|
|
|
}
|
|
|
|
|
2017-03-05 15:44:50 +00:00
|
|
|
template <class T>
|
2019-12-26 16:38:08 +00:00
|
|
|
bool Vector<T>::push_back(T p_elem) {
|
2018-07-25 01:11:03 +00:00
|
|
|
Error err = resize(size() + 1);
|
2019-06-11 12:49:34 +00:00
|
|
|
ERR_FAIL_COND_V(err, true);
|
2018-07-25 01:11:03 +00:00
|
|
|
set(size() - 1, p_elem);
|
2014-02-10 01:10:30 +00:00
|
|
|
|
2018-07-25 01:11:03 +00:00
|
|
|
return false;
|
2014-02-10 01:10:30 +00:00
|
|
|
}
|
|
|
|
|
2021-02-25 14:10:39 +00:00
|
|
|
template <class T>
|
|
|
|
void Vector<T>::fill(T p_elem) {
|
|
|
|
T *p = ptrw();
|
|
|
|
for (int i = 0; i < size(); i++) {
|
|
|
|
p[i] = p_elem;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-03-25 10:10:34 +00:00
|
|
|
#endif // VECTOR_H
|