1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
|
/*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include "FN_generic_vector_array.hh"
#include "FN_multi_function_params.hh"
#include "FN_multi_function_signature.hh"
namespace blender::fn {
GVectorArray::GVectorArray(const CPPType &type, const int64_t array_size)
: type_(type), element_size_(type.size()), items_(array_size)
{
}
GVectorArray::~GVectorArray()
{
if (type_.is_trivially_destructible()) {
return;
}
for (Item &item : items_) {
type_.destruct_n(item.start, item.length);
}
}
void GVectorArray::append(const int64_t index, const void *value)
{
Item &item = items_[index];
if (item.length == item.capacity) {
this->realloc_to_at_least(item, item.capacity + 1);
}
void *dst = POINTER_OFFSET(item.start, element_size_ * item.length);
type_.copy_construct(value, dst);
item.length++;
}
void GVectorArray::extend(const int64_t index, const GVArray &values)
{
BLI_assert(values.type() == type_);
for (const int i : IndexRange(values.size())) {
BUFFER_FOR_CPP_TYPE_VALUE(type_, buffer);
values.get(i, buffer);
this->append(index, buffer);
type_.destruct(buffer);
}
}
void GVectorArray::extend(const int64_t index, const GSpan values)
{
this->extend(index, GVArray::ForSpan(values));
}
void GVectorArray::extend(IndexMask mask, const GVVectorArray &values)
{
for (const int i : mask) {
GVArray_For_GVVectorArrayIndex array{values, i};
this->extend(i, GVArray(&array));
}
}
void GVectorArray::extend(IndexMask mask, const GVectorArray &values)
{
GVVectorArray_For_GVectorArray virtual_values{values};
this->extend(mask, virtual_values);
}
void GVectorArray::clear(IndexMask mask)
{
for (const int64_t i : mask) {
Item &item = items_[i];
type_.destruct_n(item.start, item.length);
item.length = 0;
}
}
GMutableSpan GVectorArray::operator[](const int64_t index)
{
Item &item = items_[index];
return GMutableSpan{type_, item.start, item.length};
}
GSpan GVectorArray::operator[](const int64_t index) const
{
const Item &item = items_[index];
return GSpan{type_, item.start, item.length};
}
void GVectorArray::realloc_to_at_least(Item &item, int64_t min_capacity)
{
const int64_t new_capacity = std::max(min_capacity, item.length * 2);
void *new_buffer = allocator_.allocate(element_size_ * new_capacity, type_.alignment());
type_.relocate_assign_n(item.start, new_buffer, item.length);
item.start = new_buffer;
item.capacity = new_capacity;
}
} // namespace blender::fn
|
