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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
|
/*
* 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.
*/
#pragma once
/** \file
* \ingroup fn
*
* A `GVectorArray` is a container for a fixed amount of dynamically growing arrays with a generic
* type. Its main use case is to store many small vectors with few separate allocations. Using this
* structure is generally more efficient than allocating each small vector separately.
*
* `GVectorArrayRef<T>` is a typed reference to a GVectorArray and makes it easier and safer to
* work with the class when the type is known at compile time.
*/
#include "FN_array_spans.hh"
#include "FN_cpp_type.hh"
#include "BLI_array.hh"
#include "BLI_linear_allocator.hh"
#include "BLI_utility_mixins.hh"
namespace blender::fn {
template<typename T> class GVectorArrayRef;
class GVectorArray : NonCopyable, NonMovable {
private:
const CPPType &type_;
int64_t element_size_;
Array<void *, 1> starts_;
Array<int64_t, 1> lengths_;
Array<int64_t, 1> capacities_;
LinearAllocator<> allocator_;
template<typename T> friend class GVectorArrayRef;
public:
GVectorArray() = delete;
GVectorArray(const CPPType &type, int64_t array_size)
: type_(type),
element_size_(type.size()),
starts_(array_size),
lengths_(array_size),
capacities_(array_size)
{
starts_.as_mutable_span().fill(nullptr);
lengths_.as_mutable_span().fill(0);
capacities_.as_mutable_span().fill(0);
}
~GVectorArray()
{
if (type_.is_trivially_destructible()) {
return;
}
for (int64_t i : starts_.index_range()) {
type_.destruct_n(starts_[i], lengths_[i]);
}
}
operator GVArraySpan() const
{
return GVArraySpan(type_, starts_, lengths_);
}
bool is_empty() const
{
return starts_.size() == 0;
}
int64_t size() const
{
return starts_.size();
}
const CPPType &type() const
{
return type_;
}
Span<const void *> starts() const
{
return starts_;
}
Span<int64_t> lengths() const
{
return lengths_;
}
void append(int64_t index, const void *src)
{
int64_t old_length = lengths_[index];
if (old_length == capacities_[index]) {
this->grow_at_least_one(index);
}
void *dst = POINTER_OFFSET(starts_[index], element_size_ * old_length);
type_.copy_to_uninitialized(src, dst);
lengths_[index]++;
}
void extend(int64_t index, GVSpan span)
{
BLI_assert(type_ == span.type());
for (int64_t i = 0; i < span.size(); i++) {
this->append(index, span[i]);
}
}
void extend(IndexMask mask, GVArraySpan array_span)
{
BLI_assert(type_ == array_span.type());
BLI_assert(mask.min_array_size() <= array_span.size());
for (int64_t i : mask) {
this->extend(i, array_span[i]);
}
}
GMutableSpan operator[](int64_t index)
{
BLI_assert(index < starts_.size());
return GMutableSpan(type_, starts_[index], lengths_[index]);
}
template<typename T> GVectorArrayRef<T> typed()
{
return GVectorArrayRef<T>(*this);
}
private:
void grow_at_least_one(int64_t index)
{
BLI_assert(lengths_[index] == capacities_[index]);
int64_t new_capacity = lengths_[index] * 2 + 1;
void *new_buffer = allocator_.allocate(element_size_ * new_capacity, type_.alignment());
type_.relocate_to_uninitialized_n(starts_[index], new_buffer, lengths_[index]);
starts_[index] = new_buffer;
capacities_[index] = new_capacity;
}
};
template<typename T> class GVectorArrayRef {
private:
GVectorArray *vector_array_;
public:
GVectorArrayRef(GVectorArray &vector_array) : vector_array_(&vector_array)
{
BLI_assert(vector_array.type_.is<T>());
}
void append(int64_t index, const T &value)
{
vector_array_->append(index, &value);
}
void extend(int64_t index, Span<T> values)
{
vector_array_->extend(index, values);
}
void extend(int64_t index, VSpan<T> values)
{
vector_array_->extend(index, GVSpan(values));
}
MutableSpan<T> operator[](int64_t index)
{
BLI_assert(index < vector_array_->starts_.size());
return MutableSpan<T>((T *)vector_array_->starts_[index], vector_array_->lengths_[index]);
}
int64_t size() const
{
return vector_array_->size();
}
bool is_empty() const
{
return vector_array_->is_empty();
}
};
} // namespace blender::fn
|
