36 &
mesh.vert_data,
mesh.verts_num,
mesh.verts_num + new_to_old_verts_map.
size());
37 mesh.verts_num += new_to_old_verts_map.
size();
42 vertex_group_names.
add(group.
name);
44 if (!vertex_group_names.
is_empty() && !
mesh.deform_verts().is_empty()) {
47 dverts, new_to_old_verts_map, dverts.
take_back(new_to_old_verts_map.
size()));
80 if (
int *orig_indices =
static_cast<int *
>(
93 mesh.edges_num += new_to_old_edge_map.
size();
107 if (iter.
name ==
".edge_verts") {
120 if (
int *orig_indices =
static_cast<int *
>(
142 if (corner_verts[corner] == vert) {
172 for (
const int start_corner : connected_corners) {
175 while (!corner_stack.is_empty()) {
176 const int corner = corner_stack.pop_last();
177 const int i = connected_corners.
first_index(corner);
178 if (used_corners[i]) {
181 used_corners[i].set();
183 const int face = corner_to_face_map[corner];
186 for (
const int edge : {corner_edges[corner], corner_edges[prev_corner]}) {
190 for (
const int other_corner : edge_to_corner_map[edge]) {
191 const int other_face = corner_to_face_map[other_corner];
192 if (other_face == face) {
197 corner_verts, other_corner, faces[other_face], vert);
198 corner_stack.append(neighbor_corner);
203 groups.
append(std::move(group));
226 [&](
const int vert,
const int mask) {
227 new (&corner_groups[
mask])
234 vert_to_corner_map[vert],
238 return corner_groups;
254 for (
const int edge : vert_to_edge_map[vert]) {
255 if (loose_edges[edge]) {
290 new_verts_nums.slice(range).fill(-1);
291 for (const int i : range) {
292 new_verts_nums[i] += corner_groups[i].size();
295 if (!loose_edges.is_empty()) {
296 affected_verts.foreach_index(
297 [&](
const int vert,
const int mask) {
300 new_verts_nums[
mask] += info.selected.size();
301 if (corner_groups[
mask].is_empty()) {
303 new_verts_nums[
mask] += info.unselected.size() > 0;
322 for (const int new_vert : range) {
323 const Span<CornerGroup> groups = corner_groups[new_vert];
324 const IndexRange new_verts = new_verts_by_affected_vert[new_vert];
325 for (const int group : groups.index_range().drop_back(1)) {
326 const int new_vert = orig_verts_num + new_verts[group];
327 new_corner_verts.fill_indices(groups[group].as_span(), new_vert);
338 const int face = corner_to_face_map[corner];
340 return OrderedEdge(corner_verts[corner], corner_verts[corner_next]);
361 [&](
const int edge,
const int mask) {
362 r_new_edge_offsets[
mask] = std::max<int>(edge_to_corner_map[edge].size() - 1, 0);
371 std::atomic<bool> found_duplicate =
false;
381 [&](
const int edge,
const int mask) {
382 if (edge_to_corner_map[edge].is_empty()) {
384 num_edges_per_edge_merged[
mask] = 0;
388 const int new_edges_start = offsets[
mask].start();
390 for (
const int corner : edge_to_corner_map[edge]) {
392 faces, corner_verts, corner_to_face_map, corner);
394 if (
index != -1) [[unlikely]] {
395 found_duplicate.store(
true, std::memory_order_relaxed);
402 is_reused[corner] =
true;
405 corner_edges[corner] = edges.
size() + new_edges_start +
index - 1;
409 const int new_edges_num = deduplication.
size() - 1;
411 edges[edge] =
int2(deduplication.
first().v_low, deduplication.
first().v_high);
413 .slice(new_edges_start, new_edges_num)
414 .copy_from(deduplication.
as_span().drop_front(1).cast<
int2>());
416 num_edges_per_edge_merged[
mask] = new_edges_num;
420 if (!found_duplicate) {
427 num_edges_per_edge_merged);
429 [&](
const int edge,
const int mask) {
430 const int difference = offsets[
mask].start() - offsets_merged[
mask].start();
431 for (
const int corner : edge_to_corner_map[edge]) {
432 if (!is_reused[corner]) {
433 corner_edges[corner] -= difference;
442 for (const int i : range) {
443 new_edges_merged.as_mutable_span()
444 .slice(offsets_merged[i])
445 .copy_from(new_edges.as_span().slice(offsets[i].start(), offsets_merged[i].size()));
449 r_new_edge_offsets.copy_from(num_edges_per_edge_merged);
450 return new_edges_merged;
461 [&](
const int edge) {
462 const Span<int> edge_corners = edge_to_corner_map[edge];
466 const int corner = edge_corners.
first();
468 faces, corner_verts, corner_to_face_map, corner);
476 if (edge[0] == old_vert) {
479 else if (edge[1] == old_vert) {
499 [&](
const int vert,
const int mask) {
505 int new_vert_i = std::max<int>(corner_groups[
mask].size() - 1, 0);
506 if (new_vert_i == new_verts.
size()) {
511 for (
const int edge : vert_info.
selected) {
512 const int new_vert = orig_verts_num + new_verts[new_vert_i];
515 if (new_vert_i == new_verts.size()) {
519 const int new_vert = orig_verts_num + new_verts[new_vert_i];
520 for (
const int orig_edge : vert_info.
unselected) {
544 const int orig_verts_num =
mesh.verts_num;
550 orig_edges, selected_edges, orig_verts_num, memory);
552 selected_edges.
to_bits(selection_bits);
557 loose_edges.
to_bits(loose_edge_bits);
565 mesh.corner_edges(), orig_edges.
size(), edge_to_corner_offsets, edge_to_corner_indices);
572 orig_edges, orig_verts_num, vert_to_edge_offsets, vert_to_edge_indices);
593 vert_new_vert_offset_data);
596 update_corner_verts(orig_verts_num, corner_groups, new_verts_by_affected_vert, corner_verts);
604 mesh.edges_for_write(),
605 mesh.corner_edges_for_write(),
613 mesh.edges_for_write());
622 new_verts_by_affected_vert,
623 mesh.edges_for_write());
628 mesh.edges_for_write().take_back(new_edges.
size()).copy_from(new_edges);
633 mesh.tag_edges_split();
CustomData interface, see also DNA_customdata_types.h.
Object is a sort of wrapper for general info.
Span< T > as_span() const
MutableSpan< T > as_mutable_span()
void reinitialize(const int64_t new_size)
constexpr int64_t size() const
constexpr int64_t size() const
constexpr MutableSpan take_back(const int64_t n) const
bool contains(const Key &key) const
constexpr const T & first() const
constexpr int64_t first_index(const T &search_value) const
constexpr int64_t size() const
constexpr IndexRange index_range() const
constexpr bool is_empty() const
int64_t append_and_get_index(const T &value)
void append(const T &value)
Span< T > as_span() const
int64_t first_index_of_try(const T &value) const
void resize(const int64_t new_size_in_bits, const bool value=false)
void foreach_attribute(const FunctionRef< void(const AttributeIter &)> fn) const
std::optional< AttrStorageType > storage_type
GSpanAttributeWriter lookup_for_write_span(StringRef name)
void foreach_index_optimized(Fn &&fn, Mode mode=exec_mode::serial) const
IndexRange index_range() const
void foreach_index(Fn &&fn, Mode mode=exec_mode::serial) const
void to_bits(MutableBitSpan r_bits, int64_t offset=0) const
IndexMask complement(const IndexMask &universe, LinearAllocator<> &memory) const
IndexRange index_range() const
void gather(const GVArray &src, const IndexMask &indices, GMutableSpan dst, exec_mode::Mode mode=exec_mode::parallel)
void gather(GSpan src, Span< int > map, GMutableSpan dst)
GroupedSpan< int > build_edge_to_corner_map(Span< int > corner_edges, int edges_num, Array< int > &r_offsets, Array< int > &r_indices)
int face_corner_prev(const IndexRange face, const int corner)
int face_corner_next(const IndexRange face, const int corner)
GroupedSpan< int > build_vert_to_edge_map(Span< int2 > edges, int verts_num, Array< int > &r_offsets, Array< int > &r_indices)
void gather_deform_verts(Span< MDeformVert > src, Span< int > indices, MutableSpan< MDeformVert > dst)
constexpr ParallelGrainSize grain_size(int grain_size)
void debug_randomize_edge_order(Mesh *mesh)
static Array< int > offsets_to_map(const IndexMask &mask, const OffsetIndices< int > offsets)
static Vector< CornerGroup > calc_corner_groups_for_vertex(const OffsetIndices< int > faces, const Span< int > corner_verts, const Span< int > corner_edges, const GroupedSpan< int > edge_to_corner_map, const Span< int > corner_to_face_map, const BitSpan split_edges, const Span< int > connected_corners, const int vert)
static void reassign_loose_edge_verts(const int orig_verts_num, const IndexMask &affected_verts, const GroupedSpan< int > vert_to_edge_map, const BitSpan loose_edges, const BitSpan split_edges, const Span< Vector< CornerGroup > > corner_groups, const OffsetIndices< int > new_verts_by_affected_vert, MutableSpan< int2 > edges)
static Array< int2 > calc_new_edges(const OffsetIndices< int > faces, const Span< int > corner_verts, const GroupedSpan< int > edge_to_corner_map, const Span< int > corner_to_face_map, const IndexMask &selected_edges, MutableSpan< int2 > edges, MutableSpan< int > corner_edges, MutableSpan< int > r_new_edge_offsets)
static void propagate_vert_attributes(Mesh &mesh, const Span< int > new_to_old_verts_map)
Vector< int > CornerGroup
static OrderedEdge edge_from_corner(const OffsetIndices< int > faces, const Span< int > corner_verts, const Span< int > corner_to_face_map, const int corner)
static BLI_NOINLINE Array< Vector< CornerGroup > > calc_all_corner_groups(const OffsetIndices< int > faces, const Span< int > corner_verts, const Span< int > corner_edges, const GroupedSpan< int > vert_to_corner_map, const GroupedSpan< int > edge_to_corner_map, const Span< int > corner_to_face_map, const BitSpan split_edges, const IndexMask &affected_verts)
static OffsetIndices< int > calc_vert_ranges_per_old_vert(const IndexMask &affected_verts, const Span< Vector< CornerGroup > > corner_groups, const GroupedSpan< int > vert_to_edge_map, const BitSpan loose_edges, const BitSpan split_edges, Array< int > &offset_data)
void debug_randomize_vert_order(Mesh *mesh)
static VertLooseEdges calc_vert_loose_edges(const GroupedSpan< int > vert_to_edge_map, const BitSpan loose_edges, const BitSpan split_edges, const int vert)
static void swap_edge_vert(int2 &edge, const int old_vert, const int new_vert)
void split_edges(Mesh &mesh, const IndexMask &selected_edges, const bke::AttributeFilter &attribute_filter={})
static int corner_on_edge_connected_to_vert(const Span< int > corner_verts, const int corner, const IndexRange face, const int vert)
static void update_unselected_edges(const OffsetIndices< int > faces, const Span< int > corner_verts, const GroupedSpan< int > edge_to_corner_map, const Span< int > corner_to_face_map, const IndexMask &unselected_edges, MutableSpan< int2 > edges)
static void propagate_edge_attributes(Mesh &mesh, const Span< int > new_to_old_edge_map)
IndexMask vert_selection_from_edge(Span< int2 > edges, const IndexMask &edge_mask, int verts_num, IndexMaskMemory &memory)
static void update_corner_verts(const int orig_verts_num, const Span< Vector< CornerGroup > > corner_groups, const OffsetIndices< int > new_verts_by_affected_vert, MutableSpan< int > new_corner_verts)
OffsetIndices< int > accumulate_counts_to_offsets(MutableSpan< int > counts_to_offsets, int start_offset=0)
void parallel_for(const IndexRange range, const int64_t grain_size, const Function &function, const TaskSizeHints &size_hints=detail::TaskSizeHints_Static(1))
BLI_assert(slot->slot_subtype.map==BMO_OP_SLOT_SUBTYPE_MAP_FLT)
bool CustomData_free_layers(CustomData *data, eCustomDataType type)
void CustomData_realloc(CustomData *data, int old_size, int new_size, eCDAllocType alloctype=CD_CONSTRUCT)
VecBase< int32_t, 2 > int2
void * CustomData_get_layer_for_write(CustomData *data, eCustomDataType type, int totelem)
VecBase< float, 3 > float3