235 bool keep_existing_edges,
236 const bool select_new_edges,
240 if (
mesh.edges_num == 0 &&
mesh.corners_num == 0) {
245 if (
mesh.corners_num == 0 && !keep_existing_edges) {
248 mesh.tag_loose_edges_none();
254 return edge.x != edge.y;
265 Array<int> original_edge_maps_prefix_size(edge_maps.
size() + 1, 0);
266 if (keep_existing_edges) {
271 const int original_unique_edge_num = original_edge_maps_prefix.
total_size();
272 const bool original_edges_are_distinct = original_unique_edge_num ==
mesh.edges_num;
274 if (
mesh.corners_num == 0 && keep_existing_edges && original_edges_are_distinct) {
282 const bool no_new_edges = edge_offsets.
total_size() == original_unique_edge_num;
288 corner_edges.fill(-1);
291 const int result_edges_num = edge_offsets.
total_size();
296 if (keep_existing_edges && original_edges_are_distinct && no_new_edges) {
300 faces, corner_verts, edge_maps, parallel_mask, edge_offsets, corner_edges);
302 Array<int> edge_map_to_result_index(result_edges_num);
307 original_edges, edge_maps, parallel_mask, edge_offsets, edge_map_to_result_index);
322 edge_verts.fill(
int2(-1));
325 if (keep_existing_edges) {
328 if (original_edges_are_distinct) {
329 src_to_dst_mask =
IndexRange(original_unique_edge_num);
342 original_edges, src_to_dst_mask, edge_verts.take_front(original_unique_edge_num));
346 Array<int> edge_map_to_result_index(result_edges_num);
351 if (original_edges_are_distinct) {
358 edge_map_to_result_index);
362 [&](
const int src_index,
const int dst_index) {
363 const OrderedEdge edge = original_edges[src_index];
365 const int edge_index = edge_maps[map_i].index_of(edge);
366 edge_map_to_result_index[edge_offsets[map_i][edge_index]] = dst_index;
375 const int new_edges_start = original_unique_edge_num;
377 const IndexRange map_edges = edge_offsets[map_i];
378 const IndexRange prefix_edges = original_edge_maps_prefix[map_i];
381 const int new_edges_start_pos = map_edges.
start() - prefix_edges.
start();
382 const int map_new_edges_start = new_edges_start + new_edges_start_pos;
385 map_new_edges_start);
391 faces, corner_verts, edge_maps, parallel_mask, edge_offsets, corner_edges);
397 original_edge_maps_prefix,
398 edge_verts.drop_front(original_unique_edge_num));
401 if (
mesh.edges_num != 0) {
404 const OrderedEdge edge = original_edges[edge_i];
405 const int map_i = calc_edges::edge_to_hash_map_i(edge, parallel_mask);
406 return edge_maps[map_i].contains(edge);
409 original_edges, original_corner_edges, edge_maps, parallel_mask, edge_offsets, memory);
411 const int old_corner_edges_num = src_to_dst_mask.
size();
417 edge_map_to_result_index.
reinitialize(result_edges_num);
419 src_to_dst_mask.
foreach_index([&](
const int original_edge_i) {
420 const OrderedEdge edge = original_edges[original_edge_i];
422 const int edge_index = edge_maps[edge_map].index_of(edge);
423 edge_map_to_result_index[edge_offsets[edge_map][edge_index]] = 0;
427 old_corner_edges_num);
429 src_to_dst_mask.
foreach_index([&](
const int original_edge_i,
const int dst_edge_i) {
430 const OrderedEdge edge = original_edges[original_edge_i];
432 const int edge_index = edge_maps[edge_map].index_of(edge);
433 edge_map_to_result_index[edge_offsets[edge_map][edge_index]] = dst_edge_i;
437 original_edges, src_to_dst_mask, edge_verts.take_front(old_corner_edges_num));
440 const int task_index = &edge_map - edge_maps.
data();
441 if (edge_offsets[task_index].is_empty()) {
447 edge_map_to_result_index.
as_span().slice(edge_offsets[task_index]),
452 faces, corner_verts, edge_maps, parallel_mask, edge_offsets, corner_edges);
455 edge_map_to_result_index.
as_span(), corner_edges.as_span(), corner_edges);
459 faces, corner_verts, edge_maps, parallel_mask, edge_offsets, corner_edges);
461 edge_maps, edge_offsets, original_edge_maps_prefix, edge_verts);
465 back_range_of_new_edges =
IndexRange(result_edges_num);
468 faces, corner_verts, edge_maps, parallel_mask, edge_offsets, corner_edges);
470 edge_maps, edge_offsets, original_edge_maps_prefix, edge_verts);
475 edge_verts.begin(), edge_verts.end(), [&](
const int2 edge) { return edge.x != edge.y; }));
480 BLI_assert(src_to_dst_mask.
size() + back_range_of_new_edges.
size() == result_edges_num);
502 mesh.attribute_storage.wrap().remove(
".edge_verts");
507 switch (attr.storage_type()) {
513 const auto &src_data = std::get<bke::Attribute::ArrayData>(attr.data());
515 const GSpan src(type, src_data.data,
mesh.edges_num);
516 GMutableSpan dst(type, dst_data.data, result_edges_num);
519 dst.
slice(back_range_of_new_edges).
data(),
520 dst.
slice(back_range_of_new_edges).
size());
521 attr.assign_data(std::move(dst_data));
529 if (orig_index_layer != -1) {
531 const int *src_data =
static_cast<const int *
>(
layer.data);
535 if (src_data !=
nullptr) {
536 const Span src(src_data,
mesh.edges_num);
539 dst.
slice(back_range_of_new_edges).
fill(-1);
540 layer.sharing_info->remove_user_and_delete_if_last();
541 layer.data = dst_data;
546 mesh.edges_num = result_edges_num;
550 edge_verts_data->remove_user_and_delete_if_last();
552 if (select_new_edges) {
553 dst_attributes.
remove(
".select_edge");
554 if (
ELEM(back_range_of_new_edges.
size(), 0,
mesh.edges_num)) {
555 const bool fill_value = back_range_of_new_edges.
size() ==
mesh.edges_num;
561 select_edge.
span.drop_back(back_range_of_new_edges.
size()).fill(
false);
562 select_edge.
span.take_back(back_range_of_new_edges.
size()).fill(
true);
567 if (!keep_existing_edges) {
569 mesh.tag_loose_edges_none();