e955c94ed3
Listing the "Blender Foundation" as copyright holder implied the Blender Foundation holds copyright to files which may include work from many developers. While keeping copyright on headers makes sense for isolated libraries, Blender's own code may be refactored or moved between files in a way that makes the per file copyright holders less meaningful. Copyright references to the "Blender Foundation" have been replaced with "Blender Authors", with the exception of `./extern/` since these this contains libraries which are more isolated, any changed to license headers there can be handled on a case-by-case basis. Some directories in `./intern/` have also been excluded: - `./intern/cycles/` it's own `AUTHORS` file is planned. - `./intern/opensubdiv/`. An "AUTHORS" file has been added, using the chromium projects authors file as a template. Design task: #110784 Ref !110783.
99 lines
2.5 KiB
C++
99 lines
2.5 KiB
C++
/* SPDX-FileCopyrightText: 2023 Blender Authors
|
|
*
|
|
* SPDX-License-Identifier: GPL-2.0-or-later */
|
|
|
|
#include "BLI_generic_vector_array.hh"
|
|
|
|
namespace blender {
|
|
|
|
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(const IndexMask &mask, const GVVectorArray &values)
|
|
{
|
|
mask.foreach_index([&](const int64_t i) {
|
|
GVArray_For_GVVectorArrayIndex array{values, i};
|
|
this->extend(i, GVArray(&array));
|
|
});
|
|
}
|
|
|
|
void GVectorArray::extend(const IndexMask &mask, const GVectorArray &values)
|
|
{
|
|
GVVectorArray_For_GVectorArray virtual_values{values};
|
|
this->extend(mask, virtual_values);
|
|
}
|
|
|
|
void GVectorArray::clear(const IndexMask &mask)
|
|
{
|
|
mask.foreach_index([&](const int64_t i) {
|
|
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
|