|
@@ -67,7 +67,7 @@ public:
|
|
|
if constexpr (!std::is_trivially_constructible_v<T> && !force_trivial) {
|
|
|
memnew_placement(&data[count++], T(p_elem));
|
|
|
} else {
|
|
|
- data[count++] = p_elem;
|
|
|
+ data[count++] = std::move(p_elem);
|
|
|
}
|
|
|
}
|
|
|
|
|
@@ -75,7 +75,7 @@ public:
|
|
|
ERR_FAIL_UNSIGNED_INDEX(p_index, count);
|
|
|
count--;
|
|
|
for (U i = p_index; i < count; i++) {
|
|
|
- data[i] = data[i + 1];
|
|
|
+ data[i] = std::move(data[i + 1]);
|
|
|
}
|
|
|
if constexpr (!std::is_trivially_destructible_v<T> && !force_trivial) {
|
|
|
data[count].~T();
|
|
@@ -88,7 +88,7 @@ public:
|
|
|
ERR_FAIL_INDEX(p_index, count);
|
|
|
count--;
|
|
|
if (count > p_index) {
|
|
|
- data[p_index] = data[count];
|
|
|
+ data[p_index] = std::move(data[count]);
|
|
|
}
|
|
|
if constexpr (!std::is_trivially_destructible_v<T> && !force_trivial) {
|
|
|
data[count].~T();
|
|
@@ -245,13 +245,13 @@ public:
|
|
|
void insert(U p_pos, T p_val) {
|
|
|
ERR_FAIL_UNSIGNED_INDEX(p_pos, count + 1);
|
|
|
if (p_pos == count) {
|
|
|
- push_back(p_val);
|
|
|
+ push_back(std::move(p_val));
|
|
|
} else {
|
|
|
resize(count + 1);
|
|
|
for (U i = count - 1; i > p_pos; i--) {
|
|
|
- data[i] = data[i - 1];
|
|
|
+ data[i] = std::move(data[i - 1]);
|
|
|
}
|
|
|
- data[p_pos] = p_val;
|
|
|
+ data[p_pos] = std::move(p_val);
|
|
|
}
|
|
|
}
|
|
|
|