29#define KD_THRESH 0.00002f
39 const bool use_em = (!mesh_eval && em);
62 const Span<float3> positions = mesh_eval ? mesh_eval->vert_positions() :
63 mesh->vert_positions();
64 for (
int i = 0; i < totvert; i++) {
141 const bool is_editmode =
bm !=
nullptr;
150 totvert =
mesh->verts_num;
151 totedge =
mesh->edges_num;
166 const bool skip_bm_vert_array_init)
171 const bool is_editmode = (
bm !=
nullptr);
178 int totvert, totedge;
179 int tot_unique = -1, tot_unique_prev = -1;
180 int tot_unique_edges = 0, tot_unique_edges_prev;
195 totvert =
mesh->verts_num;
211 totedge =
mesh->edges_num;
212 for (
const int2 &edge :
mesh->edges()) {
213 topo_hash[edge[0]]++;
214 topo_hash[edge[1]]++;
220 tot_unique_prev = -1;
221 tot_unique_edges_prev = -1;
225 tot_unique_edges = 0;
231 topo_hash[i1] += topo_hash_prev[i2] * topo_pass;
232 topo_hash[i2] += topo_hash_prev[i1] * topo_pass;
233 tot_unique_edges += (topo_hash[i1] != topo_hash[i2]);
237 for (
const int2 &edge :
mesh->edges()) {
238 const int i1 = edge[0], i2 = edge[1];
239 topo_hash[i1] += topo_hash_prev[i2] * topo_pass;
240 topo_hash[i2] += topo_hash_prev[i1] * topo_pass;
241 tot_unique_edges += (topo_hash[i1] != topo_hash[i2]);
244 memcpy(topo_hash_prev, topo_hash,
sizeof(
MirrTopoHash_t) * totvert);
250 for (a = 1; a < totvert; a++) {
251 if (topo_hash_prev[a - 1] != topo_hash_prev[a]) {
256 if ((tot_unique <= tot_unique_prev) && (tot_unique_edges <= tot_unique_edges_prev)) {
261 tot_unique_prev = tot_unique;
262 tot_unique_edges_prev = tot_unique_edges;
264 memcpy(topo_hash_prev, topo_hash,
sizeof(
MirrTopoHash_t) * totvert);
276 if (skip_bm_vert_array_init ==
false) {
281 for (a = 0; a < totvert; a++) {
282 topo_pairs[a].
hash = topo_hash[a];
286 index_lookup[a] = -1;
298 for (a = 1; a <= totvert; a++) {
301 if ((a == totvert) || (topo_pairs[a - 1].
hash != topo_pairs[a].
hash)) {
302 const int match_count = a - last;
303 if (match_count == 2) {
304 const int j = topo_pairs[a - 1].
v_index, k = topo_pairs[a - 2].
v_index;
305 index_lookup[j] =
intptr_t(vtable[k]);
306 index_lookup[k] =
intptr_t(vtable[j]);
308 else if (match_count == 1) {
310 const int j = topo_pairs[a - 1].
v_index;
311 index_lookup[j] =
intptr_t(vtable[j]);
319 for (a = 1; a <= totvert; a++) {
320 if ((a == totvert) || (topo_pairs[a - 1].
hash != topo_pairs[a].
hash)) {
321 const int match_count = a - last;
322 if (match_count == 2) {
323 const int j = topo_pairs[a - 1].
v_index, k = topo_pairs[a - 2].
v_index;
327 else if (match_count == 1) {
329 const int j = topo_pairs[a - 1].
v_index;
337 MEM_delete(topo_pairs);
338 topo_pairs =
nullptr;
340 MEM_delete(topo_hash);
341 MEM_delete(topo_hash_prev);
367 if (!ob || !ob->
data) {
374 if (!em || !
bm ||
mesh->symmetry == 0) {
377 return EditMeshSymmetryHelper(ob, htype);
380EditMeshSymmetryHelper::EditMeshSymmetryHelper(
Object *ob,
uchar htype)
394 for (
int axis = 0; axis < 3; axis++) {
402 use_topology_mirror_);
407 if (processed_verts.
contains(v_curr)) {
411 if (v_mirr && v_mirr != v_curr) {
413 if (v_mirr_check == v_curr) {
414 vert_to_mirror_map_.lookup_or_add(v_curr, {}).append(v_mirr);
415 vert_to_mirror_map_.lookup_or_add(v_mirr, {}).append(v_curr);
416 processed_verts.
add(v_curr);
417 processed_verts.
add(v_mirr);
426 if (processed_edges.
contains(e_curr)) {
430 if (e_mirr && e_mirr != e_curr) {
432 if (e_mirr_check == e_curr) {
433 edge_to_mirror_map_.lookup_or_add(e_curr, {}).append(e_mirr);
434 edge_to_mirror_map_.lookup_or_add(e_mirr, {}).append(e_curr);
435 processed_edges.
add(e_curr);
436 processed_edges.
add(e_mirr);
445 if (processed_faces.
contains(f_curr)) {
449 if (f_mirr && f_mirr != f_curr) {
451 if (f_mirr_check == f_curr) {
452 face_to_mirror_map_.lookup_or_add(f_curr, {}).append(f_mirr);
453 face_to_mirror_map_.lookup_or_add(f_mirr, {}).append(f_curr);
454 processed_faces.
add(f_curr);
455 processed_faces.
add(f_mirr);
470 for (
BMVert *v_mirr : *mirrors) {
481 for (
BMEdge *e_mirr : *mirrors) {
492 for (
BMFace *f_mirr : *mirrors) {
503 for (
BMVert *v_mirr : *mirrors) {
517 for (
BMEdge *e_mirr : *mirrors) {
531 for (
BMFace *f_mirr : *mirrors) {
542 const bool value)
const
557 const bool value)
const
572 const bool value)
const
A KD-tree for nearest neighbor search.
Object is a sort of wrapper for general info.
Read Blender memory allocation and freeing.
#define BM_elem_index_get(ele)
#define BM_elem_flag_set(ele, hflag, val)
#define BM_elem_flag_test(ele, hflag)
#define BM_ITER_MESH(ele, iter, bm, itype)
#define BM_ITER_MESH_INDEX(ele, iter, bm, itype, indexvar)
void set_hflag_on_mirror_faces(BMFace *f, char hflag, bool value) const
void set_hflag_on_mirror_edges(BMEdge *e, char hflag, bool value) const
bool any_mirror_face_selected(BMFace *f, char hflag) const
bool any_mirror_vert_selected(BMVert *v, char hflag) const
void apply_on_mirror_edges(BMEdge *e, FunctionRef< void(BMEdge *)> op) const
void apply_on_mirror_verts(BMVert *v, FunctionRef< void(BMVert *)> op) const
void apply_on_mirror_faces(BMFace *f, FunctionRef< void(BMFace *)> op) const
void set_hflag_on_mirror_verts(BMVert *v, char hflag, bool value) const
static std::optional< EditMeshSymmetryHelper > create_if_needed(Object *ob, uchar htype)
bool any_mirror_edge_selected(BMEdge *e, char hflag) const
bool contains(const Key &key) const
BLI_assert(slot->slot_subtype.map==BMO_OP_SLOT_SUBTYPE_MAP_FLT)
void kdtree_balance(KDTree< CoordT > *tree)
void BM_mesh_elem_index_ensure(BMesh *bm, const char htype)
void ED_mesh_mirrtopo_init(BMesh *bm, Mesh *mesh, MirrTopoStore_t *mesh_topo_store, bool skip_bm_vert_array_init)
BMesh * BKE_editmesh_bmesh_get_for_write(Mesh *mesh)
void * MEM_new_array_uninitialized(size_t len, size_t size, const char *str) ATTR_WARN_UNUSED_RESULT ATTR_ALLOC_SIZE(1
int ED_mesh_mirror_spatial_table_lookup(Object *ob, Mesh *mesh_eval, const float co[3])
void BM_mesh_elem_table_ensure(BMesh *bm, const char htype)
BMVert * EDBM_verts_mirror_get(BMEditMesh *em, BMesh *bm, BMVert *v)
BMEdge * EDBM_verts_mirror_get_edge(BMEditMesh *em, BMesh *bm, BMEdge *e)
static int mirrtopo_vert_sort(const void *v1, const void *v2)
void ED_mesh_mirror_spatial_table_end(Object *ob)
bool ED_mesh_mirrtopo_recalc_check(BMesh *bm, Mesh *mesh, MirrTopoStore_t *mesh_topo_store)
ATTR_WARN_UNUSED_RESULT const BMVert * v
void EDBM_verts_mirror_cache_begin(BMEditMesh *em, BMesh *bm, int axis, bool use_self, bool use_select, bool respecthide, bool use_topology)
KDTree< CoordT > * kdtree_new(uint nodes_len_capacity)
VecBase< int32_t, 2 > int2
BMesh const char void * data
BMFace * EDBM_verts_mirror_get_face(BMEditMesh *em, BMesh *bm, BMFace *f)
void ED_mesh_mirrtopo_free(MirrTopoStore_t *mesh_topo_store)
void kdtree_insert(KDTree< CoordT > *tree, int index, const CoordT &co)
void BM_face_select_set(BMesh *bm, BMFace *f, const bool select)
Select Face.
static struct blender::@264141273311030207060347213277130021246260340122 MirrKdStore
int kdtree_find_nearest(const KDTree< CoordT > *tree, const CoordT &co, KDTreeNearest< CoordT > *r_nearest)
void BM_vert_select_set(BMesh *bm, BMVert *v, const bool select)
Select Vert.
BMEditMesh * BKE_editmesh_from_object(Object *ob)
Return the BMEditMesh for a given object.
void kdtree_free(KDTree< CoordT > *tree)
void EDBM_verts_mirror_cache_end(BMEditMesh *em)
ATTR_WARN_UNUSED_RESULT const BMVert * v2
void ED_mesh_mirror_spatial_table_begin(Object *ob, Mesh *mesh_eval)
static int mirrtopo_hash_sort(const void *l1, const void *l2)
ATTR_WARN_UNUSED_RESULT const BMVert const BMEdge * e
void * MEM_new_array_zeroed(size_t len, size_t size, const char *str) ATTR_WARN_UNUSED_RESULT ATTR_ALLOC_SIZE(1
void BM_edge_select_set(BMesh *bm, BMEdge *e, const bool select)
Select Edge.
eMeshSymmetryType symmetry