mirror of
https://github.com/Relintai/sfw.git
synced 2024-11-08 07:52:09 +01:00
769 lines
17 KiB
C++
769 lines
17 KiB
C++
/*************************************************************************/
|
|
/* array.cpp */
|
|
/* From https://github.com/Relintai/pandemonium_engine (MIT) */
|
|
/*************************************************************************/
|
|
|
|
//--STRIP
|
|
#include "array.h"
|
|
|
|
#include "core/hashfuncs.h"
|
|
#include "core/vector.h"
|
|
#include "object/object.h"
|
|
#include "object/variant.h"
|
|
#include "core/ustring.h"
|
|
//--STRIP
|
|
|
|
class ArrayPrivate {
|
|
public:
|
|
SafeRefCount refcount;
|
|
Vector<Variant> array;
|
|
};
|
|
|
|
void Array::_ref(const Array &p_from) const {
|
|
ArrayPrivate *_fp = p_from._p;
|
|
|
|
ERR_FAIL_COND(!_fp); // should NOT happen.
|
|
|
|
if (_fp == _p) {
|
|
return; // whatever it is, nothing to do here move along
|
|
}
|
|
|
|
bool success = _fp->refcount.ref();
|
|
|
|
ERR_FAIL_COND(!success); // should really not happen either
|
|
|
|
_unref();
|
|
|
|
_p = p_from._p;
|
|
}
|
|
|
|
void Array::_unref() const {
|
|
if (!_p) {
|
|
return;
|
|
}
|
|
|
|
if (_p->refcount.unref()) {
|
|
memdelete(_p);
|
|
}
|
|
_p = nullptr;
|
|
}
|
|
|
|
Variant &Array::operator[](int p_idx) {
|
|
return _p->array.write[p_idx];
|
|
}
|
|
|
|
const Variant &Array::operator[](int p_idx) const {
|
|
return _p->array[p_idx];
|
|
}
|
|
|
|
int Array::size() const {
|
|
return _p->array.size();
|
|
}
|
|
bool Array::empty() const {
|
|
return _p->array.empty();
|
|
}
|
|
void Array::clear() {
|
|
_p->array.clear();
|
|
}
|
|
|
|
bool Array::deep_equal(const Array &p_array, int p_recursion_count) const {
|
|
// Cheap checks
|
|
ERR_FAIL_COND_V_MSG(p_recursion_count > MAX_RECURSION, true, "Max recursion reached");
|
|
if (_p == p_array._p) {
|
|
return true;
|
|
}
|
|
const Vector<Variant> &a1 = _p->array;
|
|
const Vector<Variant> &a2 = p_array._p->array;
|
|
const int size = a1.size();
|
|
if (size != a2.size()) {
|
|
return false;
|
|
}
|
|
|
|
// Heavy O(n) check
|
|
p_recursion_count++;
|
|
for (int i = 0; i < size; i++) {
|
|
if (!a1[i].deep_equal(a2[i], p_recursion_count)) {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
bool Array::operator==(const Array &p_array) const {
|
|
return _p == p_array._p;
|
|
}
|
|
|
|
uint32_t Array::hash() const {
|
|
return recursive_hash(0);
|
|
}
|
|
|
|
uint32_t Array::recursive_hash(int p_recursion_count) const {
|
|
ERR_FAIL_COND_V_MSG(p_recursion_count > MAX_RECURSION, 0, "Max recursion reached");
|
|
p_recursion_count++;
|
|
|
|
uint32_t h = hash_murmur3_one_32(0);
|
|
|
|
for (int i = 0; i < _p->array.size(); i++) {
|
|
h = hash_murmur3_one_32(_p->array[i].recursive_hash(p_recursion_count), h);
|
|
}
|
|
return hash_fmix32(h);
|
|
}
|
|
|
|
void Array::operator=(const Array &p_array) {
|
|
_ref(p_array);
|
|
}
|
|
|
|
void Array::push_back(const Variant &p_value) {
|
|
_p->array.push_back(p_value);
|
|
}
|
|
|
|
void Array::append_array(const Array &p_array) {
|
|
_p->array.append_array(p_array._p->array);
|
|
}
|
|
|
|
Error Array::resize(int p_new_size) {
|
|
return _p->array.resize(p_new_size);
|
|
}
|
|
|
|
void Array::insert(int p_pos, const Variant &p_value) {
|
|
_p->array.insert(p_pos, p_value);
|
|
}
|
|
|
|
void Array::fill(const Variant &p_value) {
|
|
_p->array.fill(p_value);
|
|
}
|
|
|
|
void Array::erase(const Variant &p_value) {
|
|
_p->array.erase(p_value);
|
|
}
|
|
|
|
Variant Array::front() const {
|
|
ERR_FAIL_COND_V_MSG(_p->array.size() == 0, Variant(), "Can't take value from empty array.");
|
|
return operator[](0);
|
|
}
|
|
|
|
Variant Array::back() const {
|
|
ERR_FAIL_COND_V_MSG(_p->array.size() == 0, Variant(), "Can't take value from empty array.");
|
|
return operator[](_p->array.size() - 1);
|
|
}
|
|
|
|
int Array::find(const Variant &p_value, int p_from) const {
|
|
return _p->array.find(p_value, p_from);
|
|
}
|
|
|
|
int Array::rfind(const Variant &p_value, int p_from) const {
|
|
if (_p->array.size() == 0) {
|
|
return -1;
|
|
}
|
|
|
|
if (p_from < 0) {
|
|
// Relative offset from the end
|
|
p_from = _p->array.size() + p_from;
|
|
}
|
|
if (p_from < 0 || p_from >= _p->array.size()) {
|
|
// Limit to array boundaries
|
|
p_from = _p->array.size() - 1;
|
|
}
|
|
|
|
for (int i = p_from; i >= 0; i--) {
|
|
if (_p->array[i] == p_value) {
|
|
return i;
|
|
}
|
|
}
|
|
|
|
return -1;
|
|
}
|
|
|
|
int Array::find_last(const Variant &p_value) const {
|
|
return rfind(p_value);
|
|
}
|
|
|
|
int Array::count(const Variant &p_value) const {
|
|
if (_p->array.size() == 0) {
|
|
return 0;
|
|
}
|
|
|
|
int amount = 0;
|
|
for (int i = 0; i < _p->array.size(); i++) {
|
|
if (_p->array[i] == p_value) {
|
|
amount++;
|
|
}
|
|
}
|
|
|
|
return amount;
|
|
}
|
|
|
|
bool Array::has(const Variant &p_value) const {
|
|
return _p->array.find(p_value, 0) != -1;
|
|
}
|
|
|
|
void Array::remove(int p_pos) {
|
|
_p->array.remove(p_pos);
|
|
}
|
|
|
|
void Array::set(int p_idx, const Variant &p_value) {
|
|
operator[](p_idx) = p_value;
|
|
}
|
|
|
|
const Variant &Array::get(int p_idx) const {
|
|
return operator[](p_idx);
|
|
}
|
|
|
|
Array Array::duplicate(bool p_deep) const {
|
|
Array new_arr;
|
|
int element_count = size();
|
|
new_arr.resize(element_count);
|
|
for (int i = 0; i < element_count; i++) {
|
|
new_arr[i] = p_deep ? get(i).duplicate(p_deep) : get(i);
|
|
}
|
|
|
|
return new_arr;
|
|
}
|
|
|
|
int Array::_clamp_slice_index(int p_index) const {
|
|
int arr_size = size();
|
|
int fixed_index = CLAMP(p_index, -arr_size, arr_size - 1);
|
|
if (fixed_index < 0) {
|
|
fixed_index = arr_size + fixed_index;
|
|
}
|
|
return fixed_index;
|
|
}
|
|
|
|
Array Array::slice(int p_begin, int p_end, int p_step, bool p_deep) const { // like python, but inclusive on upper bound
|
|
|
|
Array new_arr;
|
|
|
|
ERR_FAIL_COND_V_MSG(p_step == 0, new_arr, "Array slice step size cannot be zero.");
|
|
|
|
if (empty()) { // Don't try to slice empty arrays.
|
|
return new_arr;
|
|
}
|
|
if (p_step > 0) {
|
|
if (p_begin >= size() || p_end < -size()) {
|
|
return new_arr;
|
|
}
|
|
} else { // p_step < 0
|
|
if (p_begin < -size() || p_end >= size()) {
|
|
return new_arr;
|
|
}
|
|
}
|
|
|
|
int begin = _clamp_slice_index(p_begin);
|
|
int end = _clamp_slice_index(p_end);
|
|
|
|
int new_arr_size = MAX(((end - begin + p_step) / p_step), 0);
|
|
new_arr.resize(new_arr_size);
|
|
|
|
if (p_step > 0) {
|
|
int dest_idx = 0;
|
|
for (int idx = begin; idx <= end; idx += p_step) {
|
|
ERR_FAIL_COND_V_MSG(dest_idx < 0 || dest_idx >= new_arr_size, Array(), "Bug in Array slice()");
|
|
new_arr[dest_idx++] = p_deep ? get(idx).duplicate(p_deep) : get(idx);
|
|
}
|
|
} else { // p_step < 0
|
|
int dest_idx = 0;
|
|
for (int idx = begin; idx >= end; idx += p_step) {
|
|
ERR_FAIL_COND_V_MSG(dest_idx < 0 || dest_idx >= new_arr_size, Array(), "Bug in Array slice()");
|
|
new_arr[dest_idx++] = p_deep ? get(idx).duplicate(p_deep) : get(idx);
|
|
}
|
|
}
|
|
|
|
return new_arr;
|
|
}
|
|
|
|
struct _ArrayVariantSort {
|
|
_FORCE_INLINE_ bool operator()(const Variant &p_l, const Variant &p_r) const {
|
|
bool valid = false;
|
|
Variant res;
|
|
Variant::evaluate(Variant::OP_LESS, p_l, p_r, res, valid);
|
|
if (!valid) {
|
|
res = false;
|
|
}
|
|
return res;
|
|
}
|
|
};
|
|
|
|
Array &Array::sort() {
|
|
_p->array.sort_custom<_ArrayVariantSort>();
|
|
return *this;
|
|
}
|
|
|
|
struct _ArrayVariantSortCustom {
|
|
Object *obj;
|
|
|
|
_FORCE_INLINE_ bool operator()(const Variant &p_l, const Variant &p_r) const {
|
|
return obj->lt(p_l, p_r);
|
|
}
|
|
};
|
|
Array &Array::sort_custom(Object *p_obj) {
|
|
ERR_FAIL_COND_V(!p_obj, *this);
|
|
|
|
SortArray<Variant, _ArrayVariantSortCustom, true> avs;
|
|
avs.compare.obj = p_obj;
|
|
avs.sort(_p->array.ptrw(), _p->array.size());
|
|
return *this;
|
|
}
|
|
|
|
void Array::shuffle() {
|
|
const int n = _p->array.size();
|
|
if (n < 2) {
|
|
return;
|
|
}
|
|
Variant *data = _p->array.ptrw();
|
|
for (int i = n - 1; i >= 1; i--) {
|
|
const int j = Math::rand() % (i + 1);
|
|
const Variant tmp = data[j];
|
|
data[j] = data[i];
|
|
data[i] = tmp;
|
|
}
|
|
}
|
|
|
|
template <typename Less>
|
|
_FORCE_INLINE_ int bisect(const Vector<Variant> &p_array, const Variant &p_value, bool p_before, const Less &p_less) {
|
|
int lo = 0;
|
|
int hi = p_array.size();
|
|
if (p_before) {
|
|
while (lo < hi) {
|
|
const int mid = (lo + hi) / 2;
|
|
if (p_less(p_array.get(mid), p_value)) {
|
|
lo = mid + 1;
|
|
} else {
|
|
hi = mid;
|
|
}
|
|
}
|
|
} else {
|
|
while (lo < hi) {
|
|
const int mid = (lo + hi) / 2;
|
|
if (p_less(p_value, p_array.get(mid))) {
|
|
hi = mid;
|
|
} else {
|
|
lo = mid + 1;
|
|
}
|
|
}
|
|
}
|
|
return lo;
|
|
}
|
|
|
|
int Array::bsearch(const Variant &p_value, bool p_before) {
|
|
return bisect(_p->array, p_value, p_before, _ArrayVariantSort());
|
|
}
|
|
|
|
int Array::bsearch_custom(const Variant &p_value, Object *p_obj, const StringName &p_function, bool p_before) {
|
|
ERR_FAIL_COND_V(!p_obj, 0);
|
|
|
|
_ArrayVariantSortCustom less;
|
|
less.obj = p_obj;
|
|
|
|
return bisect(_p->array, p_value, p_before, less);
|
|
}
|
|
|
|
Array &Array::invert() {
|
|
_p->array.invert();
|
|
return *this;
|
|
}
|
|
|
|
void Array::push_front(const Variant &p_value) {
|
|
_p->array.insert(0, p_value);
|
|
}
|
|
|
|
Variant Array::pop_back() {
|
|
if (!_p->array.empty()) {
|
|
const int n = _p->array.size() - 1;
|
|
const Variant ret = _p->array.get(n);
|
|
_p->array.resize(n);
|
|
return ret;
|
|
}
|
|
return Variant();
|
|
}
|
|
|
|
Variant Array::pop_front() {
|
|
if (!_p->array.empty()) {
|
|
const Variant ret = _p->array.get(0);
|
|
_p->array.remove(0);
|
|
return ret;
|
|
}
|
|
return Variant();
|
|
}
|
|
|
|
Variant Array::pop_at(int p_pos) {
|
|
if (_p->array.empty()) {
|
|
// Return `null` without printing an error to mimic `pop_back()` and `pop_front()` behavior.
|
|
return Variant();
|
|
}
|
|
|
|
if (p_pos < 0) {
|
|
// Relative offset from the end
|
|
p_pos = _p->array.size() + p_pos;
|
|
}
|
|
|
|
ERR_FAIL_INDEX_V_MSG(
|
|
p_pos,
|
|
_p->array.size(),
|
|
Variant(),
|
|
vformat(
|
|
"The calculated index %s is out of bounds (the array has %s elements). Leaving the array untouched and returning `null`.",
|
|
p_pos,
|
|
_p->array.size()));
|
|
|
|
const Variant ret = _p->array.get(p_pos);
|
|
_p->array.remove(p_pos);
|
|
return ret;
|
|
}
|
|
|
|
#if defined(_WIN64) || defined(_WIN32)
|
|
// Windows...
|
|
#undef min
|
|
#undef max
|
|
#endif
|
|
|
|
Variant Array::min() const {
|
|
Variant minval;
|
|
for (int i = 0; i < size(); i++) {
|
|
if (i == 0) {
|
|
minval = get(i);
|
|
} else {
|
|
bool valid;
|
|
Variant ret;
|
|
Variant test = get(i);
|
|
Variant::evaluate(Variant::OP_LESS, test, minval, ret, valid);
|
|
if (!valid) {
|
|
return Variant(); //not a valid comparison
|
|
}
|
|
if (bool(ret)) {
|
|
//is less
|
|
minval = test;
|
|
}
|
|
}
|
|
}
|
|
return minval;
|
|
}
|
|
|
|
Variant Array::max() const {
|
|
Variant maxval;
|
|
for (int i = 0; i < size(); i++) {
|
|
if (i == 0) {
|
|
maxval = get(i);
|
|
} else {
|
|
bool valid;
|
|
Variant ret;
|
|
Variant test = get(i);
|
|
Variant::evaluate(Variant::OP_GREATER, test, maxval, ret, valid);
|
|
if (!valid) {
|
|
return Variant(); //not a valid comparison
|
|
}
|
|
if (bool(ret)) {
|
|
//is less
|
|
maxval = test;
|
|
}
|
|
}
|
|
}
|
|
return maxval;
|
|
}
|
|
|
|
const void *Array::id() const {
|
|
return _p;
|
|
}
|
|
|
|
String Array::sprintf(const String &p_format, bool *error) const {
|
|
String formatted;
|
|
CharType *self = (CharType *)p_format.get_data();
|
|
bool in_format = false;
|
|
int value_index = 0;
|
|
int min_chars = 0;
|
|
int min_decimals = 0;
|
|
bool in_decimals = false;
|
|
bool pad_with_zeros = false;
|
|
bool left_justified = false;
|
|
bool show_sign = false;
|
|
|
|
const Array &values = *this;
|
|
|
|
if (error) {
|
|
*error = true;
|
|
}
|
|
|
|
for (; *self; self++) {
|
|
const CharType c = *self;
|
|
|
|
if (in_format) { // We have % - let's see what else we get.
|
|
switch (c) {
|
|
case '%': { // Replace %% with %
|
|
formatted += p_format.chr(c);
|
|
in_format = false;
|
|
break;
|
|
}
|
|
case 'd': // Integer (signed)
|
|
case 'o': // Octal
|
|
case 'x': // Hexadecimal (lowercase)
|
|
case 'X': { // Hexadecimal (uppercase)
|
|
if (value_index >= values.size()) {
|
|
return "not enough arguments for format string";
|
|
}
|
|
|
|
if (!values[value_index].is_num()) {
|
|
return "a number is required";
|
|
}
|
|
|
|
int64_t value = values[value_index];
|
|
int base = 16;
|
|
bool capitalize = false;
|
|
switch (c) {
|
|
case 'd':
|
|
base = 10;
|
|
break;
|
|
case 'o':
|
|
base = 8;
|
|
break;
|
|
case 'x':
|
|
break;
|
|
case 'X':
|
|
base = 16;
|
|
capitalize = true;
|
|
break;
|
|
}
|
|
// Get basic number.
|
|
String str = String::num_int64(ABS(value), base, capitalize);
|
|
int number_len = str.length();
|
|
|
|
// Padding.
|
|
int pad_chars_count = (value < 0 || show_sign) ? min_chars - 1 : min_chars;
|
|
String pad_char = pad_with_zeros ? String("0") : String(" ");
|
|
if (left_justified) {
|
|
str = str.rpad(pad_chars_count, pad_char);
|
|
} else {
|
|
str = str.lpad(pad_chars_count, pad_char);
|
|
}
|
|
|
|
// Sign.
|
|
if (show_sign || value < 0) {
|
|
String sign_char = value < 0 ? "-" : "+";
|
|
if (left_justified) {
|
|
str = str.insert(0, sign_char);
|
|
} else {
|
|
str = str.insert(pad_with_zeros ? 0 : str.length() - number_len, sign_char);
|
|
}
|
|
}
|
|
|
|
formatted += str;
|
|
++value_index;
|
|
in_format = false;
|
|
|
|
break;
|
|
}
|
|
case 'f': { // Float
|
|
if (value_index >= values.size()) {
|
|
return "not enough arguments for format string";
|
|
}
|
|
|
|
if (!values[value_index].is_num()) {
|
|
return "a number is required";
|
|
}
|
|
|
|
double value = values[value_index];
|
|
bool is_negative = (value < 0);
|
|
String str = String::num(ABS(value), min_decimals);
|
|
bool not_numeric = isinf(value) || isnan(value);
|
|
|
|
// Pad decimals out.
|
|
if (!not_numeric) {
|
|
str = str.pad_decimals(min_decimals);
|
|
}
|
|
|
|
int initial_len = str.length();
|
|
|
|
// Padding. Leave room for sign later if required.
|
|
int pad_chars_count = (is_negative || show_sign) ? min_chars - 1 : min_chars;
|
|
String pad_char = (pad_with_zeros && !not_numeric) ? String("0") : String(" "); // Never pad NaN or inf with zeros
|
|
if (left_justified) {
|
|
str = str.rpad(pad_chars_count, pad_char);
|
|
} else {
|
|
str = str.lpad(pad_chars_count, pad_char);
|
|
}
|
|
|
|
// Add sign if needed.
|
|
if (show_sign || is_negative) {
|
|
String sign_char = is_negative ? "-" : "+";
|
|
if (left_justified) {
|
|
str = str.insert(0, sign_char);
|
|
} else {
|
|
str = str.insert(pad_with_zeros ? 0 : str.length() - initial_len, sign_char);
|
|
}
|
|
}
|
|
|
|
formatted += str;
|
|
++value_index;
|
|
in_format = false;
|
|
break;
|
|
}
|
|
case 's': { // String
|
|
if (value_index >= values.size()) {
|
|
return "not enough arguments for format string";
|
|
}
|
|
|
|
String str = values[value_index];
|
|
// Padding.
|
|
if (left_justified) {
|
|
str = str.rpad(min_chars);
|
|
} else {
|
|
str = str.lpad(min_chars);
|
|
}
|
|
|
|
formatted += str;
|
|
++value_index;
|
|
in_format = false;
|
|
break;
|
|
}
|
|
case 'c': {
|
|
if (value_index >= values.size()) {
|
|
return "not enough arguments for format string";
|
|
}
|
|
|
|
// Convert to character.
|
|
String str;
|
|
if (values[value_index].is_num()) {
|
|
int value = values[value_index];
|
|
if (value < 0) {
|
|
return "unsigned integer is lower than minimum";
|
|
} else if (value >= 0xd800 && value <= 0xdfff) {
|
|
return "unsigned integer is invalid Unicode character";
|
|
} else if (value > 0x10ffff) {
|
|
return "unsigned integer is greater than maximum";
|
|
}
|
|
str = p_format.chr(values[value_index]);
|
|
} else if (values[value_index].get_type() == Variant::STRING) {
|
|
str = values[value_index];
|
|
if (str.length() != 1) {
|
|
return "%c requires number or single-character string";
|
|
}
|
|
} else {
|
|
return "%c requires number or single-character string";
|
|
}
|
|
|
|
// Padding.
|
|
if (left_justified) {
|
|
str = str.rpad(min_chars);
|
|
} else {
|
|
str = str.lpad(min_chars);
|
|
}
|
|
|
|
formatted += str;
|
|
++value_index;
|
|
in_format = false;
|
|
break;
|
|
}
|
|
case '-': { // Left justify
|
|
left_justified = true;
|
|
break;
|
|
}
|
|
case '+': { // Show + if positive.
|
|
show_sign = true;
|
|
break;
|
|
}
|
|
case '0':
|
|
case '1':
|
|
case '2':
|
|
case '3':
|
|
case '4':
|
|
case '5':
|
|
case '6':
|
|
case '7':
|
|
case '8':
|
|
case '9': {
|
|
int n = c - '0';
|
|
if (in_decimals) {
|
|
min_decimals *= 10;
|
|
min_decimals += n;
|
|
} else {
|
|
if (c == '0' && min_chars == 0) {
|
|
if (left_justified) {
|
|
LOG_WARN("'0' flag ignored with '-' flag in string format");
|
|
} else {
|
|
pad_with_zeros = true;
|
|
}
|
|
} else {
|
|
min_chars *= 10;
|
|
min_chars += n;
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
case '.': { // Float separator.
|
|
if (in_decimals) {
|
|
return "too many decimal points in format";
|
|
}
|
|
in_decimals = true;
|
|
min_decimals = 0; // We want to add the value manually.
|
|
break;
|
|
}
|
|
|
|
case '*': { // Dynamic width, based on value.
|
|
if (value_index >= values.size()) {
|
|
return "not enough arguments for format string";
|
|
}
|
|
|
|
if (!values[value_index].is_num()) {
|
|
return "* wants number";
|
|
}
|
|
|
|
int size = values[value_index];
|
|
|
|
if (in_decimals) {
|
|
min_decimals = size;
|
|
} else {
|
|
min_chars = size;
|
|
}
|
|
|
|
++value_index;
|
|
break;
|
|
}
|
|
|
|
default: {
|
|
return "unsupported format character";
|
|
}
|
|
}
|
|
} else { // Not in format string.
|
|
switch (c) {
|
|
case '%':
|
|
in_format = true;
|
|
// Back to defaults:
|
|
min_chars = 0;
|
|
min_decimals = 6;
|
|
pad_with_zeros = false;
|
|
left_justified = false;
|
|
show_sign = false;
|
|
in_decimals = false;
|
|
break;
|
|
default:
|
|
formatted += p_format.chr(c);
|
|
}
|
|
}
|
|
}
|
|
|
|
if (in_format) {
|
|
return "incomplete format";
|
|
}
|
|
|
|
if (value_index != values.size()) {
|
|
return "not all arguments converted during string formatting";
|
|
}
|
|
|
|
if (error) {
|
|
*error = false;
|
|
}
|
|
return formatted;
|
|
}
|
|
|
|
Array::Array(const Array &p_from) {
|
|
_p = nullptr;
|
|
_ref(p_from);
|
|
}
|
|
|
|
Array::Array() {
|
|
_p = memnew(ArrayPrivate);
|
|
_p->refcount.init();
|
|
}
|
|
Array::~Array() {
|
|
_unref();
|
|
}
|