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.
89 lines
3.2 KiB
C++
89 lines
3.2 KiB
C++
/* SPDX-FileCopyrightText: 2023 Blender Authors
|
|
*
|
|
* SPDX-License-Identifier: GPL-2.0-or-later */
|
|
|
|
/** \file
|
|
* \ingroup bke
|
|
*/
|
|
|
|
#include "BKE_curves_utils.hh"
|
|
|
|
namespace blender::bke::curves {
|
|
|
|
void copy_point_data(const OffsetIndices<int> src_points_by_curve,
|
|
const OffsetIndices<int> dst_points_by_curve,
|
|
const IndexMask &src_curve_selection,
|
|
const GSpan src,
|
|
GMutableSpan dst)
|
|
{
|
|
src_curve_selection.foreach_index(GrainSize(512), [&](const int i) {
|
|
const IndexRange src_points = src_points_by_curve[i];
|
|
const IndexRange dst_points = dst_points_by_curve[i];
|
|
/* The arrays might be large, so a threaded copy might make sense here too. */
|
|
dst.slice(dst_points).copy_from(src.slice(src_points));
|
|
});
|
|
}
|
|
|
|
void fill_points(const OffsetIndices<int> points_by_curve,
|
|
const IndexMask &curve_selection,
|
|
const GPointer value,
|
|
GMutableSpan dst)
|
|
{
|
|
BLI_assert(*value.type() == dst.type());
|
|
const CPPType &type = dst.type();
|
|
curve_selection.foreach_index(GrainSize(512), [&](const int i) {
|
|
const IndexRange points = points_by_curve[i];
|
|
type.fill_assign_n(value.get(), dst.slice(points).data(), points.size());
|
|
});
|
|
}
|
|
|
|
bke::CurvesGeometry copy_only_curve_domain(const bke::CurvesGeometry &src_curves)
|
|
{
|
|
bke::CurvesGeometry dst_curves(0, src_curves.curves_num());
|
|
CustomData_copy(
|
|
&src_curves.curve_data, &dst_curves.curve_data, CD_MASK_ALL, src_curves.curves_num());
|
|
dst_curves.runtime->type_counts = src_curves.runtime->type_counts;
|
|
return dst_curves;
|
|
}
|
|
|
|
IndexMask indices_for_type(const VArray<int8_t> &types,
|
|
const std::array<int, CURVE_TYPES_NUM> &type_counts,
|
|
const CurveType type,
|
|
const IndexMask &selection,
|
|
IndexMaskMemory &memory)
|
|
{
|
|
if (type_counts[type] == types.size()) {
|
|
return selection;
|
|
}
|
|
if (types.is_single()) {
|
|
return types.get_internal_single() == type ? IndexMask(types.size()) : IndexMask(0);
|
|
}
|
|
Span<int8_t> types_span = types.get_internal_span();
|
|
return IndexMask::from_predicate(selection, GrainSize(4096), memory, [&](const int index) {
|
|
return types_span[index] == type;
|
|
});
|
|
}
|
|
|
|
void foreach_curve_by_type(const VArray<int8_t> &types,
|
|
const std::array<int, CURVE_TYPES_NUM> &counts,
|
|
const IndexMask &selection,
|
|
FunctionRef<void(IndexMask)> catmull_rom_fn,
|
|
FunctionRef<void(IndexMask)> poly_fn,
|
|
FunctionRef<void(IndexMask)> bezier_fn,
|
|
FunctionRef<void(IndexMask)> nurbs_fn)
|
|
{
|
|
auto call_if_not_empty = [&](const CurveType type, FunctionRef<void(IndexMask)> fn) {
|
|
IndexMaskMemory memory;
|
|
const IndexMask mask = indices_for_type(types, counts, type, selection, memory);
|
|
if (!mask.is_empty()) {
|
|
fn(mask);
|
|
}
|
|
};
|
|
call_if_not_empty(CURVE_TYPE_CATMULL_ROM, catmull_rom_fn);
|
|
call_if_not_empty(CURVE_TYPE_POLY, poly_fn);
|
|
call_if_not_empty(CURVE_TYPE_BEZIER, bezier_fn);
|
|
call_if_not_empty(CURVE_TYPE_NURBS, nurbs_fn);
|
|
}
|
|
|
|
} // namespace blender::bke::curves
|