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

Ported: Optimize String.repeat()

Browse Source 
This backports the optimization done in `master`.
- Calinou, MewPurPur
3b31ff9008
This commit is contained in:
Relintai 2022-09-16 22:08:51 +02:00
parent bce30062a5
commit dbcca5d26d
1 changed files with 12 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
core/string/ustring.cpp
View File

@ -34,8 +34,8 @@
#include "ustring.h" #include "ustring.h"
#include "core/math/color.h"
#include "core/crypto/crypto_core.h" #include "core/crypto/crypto_core.h"
#include "core/math/color.h"
#include "core/math/math_funcs.h" #include "core/math/math_funcs.h"
#include "core/os/memory.h" #include "core/os/memory.h"
#include "core/string/print_string.h" #include "core/string/print_string.h"
@ -1537,17 +1537,19 @@ String String::newline_to_br() const {
String String::repeat(int p_count) const { String String::repeat(int p_count) const {
ERR_FAIL_COND_V_MSG(p_count < 0, "", "Parameter count should be a positive number."); ERR_FAIL_COND_V_MSG(p_count < 0, "", "Parameter count should be a positive number.");
String new_string; int len = length();
const CharType *src = this->get_data(); String new_string = *this;
new_string.resize(p_count * len + 1);
new_string.resize(length() * p_count + 1); CharType *dst = new_string.ptrw();
new_string[length() * p_count] = 0; int offset = 1;
int stride = 1;
for (int i = 0; i < p_count; i++) { while (offset < p_count) {
for (int j = 0; j < length(); j++) { memcpy(dst + offset * len, dst, stride * len * sizeof(CharType));
new_string[i * length() + j] = src[j]; offset += stride;
} stride = MIN(stride * 2, p_count - offset);
} }
dst[p_count * len] = _null;
return new_string; return new_string;
} }