diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2019-03-19 16:46:33 +0300 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2019-03-19 16:48:51 +0300 |
| commit | 109cbdf2e1b609e93270100239906a8e17c64ab5 (patch) | |
| tree | 821504319da91e5a5dea1ebaf64978560468288e /source/blender/bmesh/operators | |
| parent | e8777a729013d04dcb854b0b9f327e9b90191747 (diff) | |
Cleanup: use BLI_kdtree_3d prefix
Use prefix now there isn't only the 3d version.
Diffstat (limited to 'source/blender/bmesh/operators')
| -rw-r--r-- | source/blender/bmesh/operators/bmo_removedoubles.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/source/blender/bmesh/operators/bmo_removedoubles.c b/source/blender/bmesh/operators/bmo_removedoubles.c index 1432e15185e..eba8c37f1e0 100644 --- a/source/blender/bmesh/operators/bmo_removedoubles.c +++ b/source/blender/bmesh/operators/bmo_removedoubles.c @@ -634,9 +634,9 @@ static void bmesh_find_doubles_common( int *duplicates = MEM_mallocN(sizeof(int) * verts_len, __func__); { - KDTree *tree = BLI_kdtree_new(verts_len); + KDTree_3d *tree = BLI_kdtree_3d_new(verts_len); for (int i = 0; i < verts_len; i++) { - BLI_kdtree_insert(tree, i, verts[i]->co); + BLI_kdtree_3d_insert(tree, i, verts[i]->co); if (has_keep_vert && BMO_vert_flag_test(bm, verts[i], VERT_KEEP)) { duplicates[i] = i; } @@ -645,9 +645,9 @@ static void bmesh_find_doubles_common( } } - BLI_kdtree_balance(tree); - found_duplicates = BLI_kdtree_calc_duplicates_fast(tree, dist, false, duplicates) != 0; - BLI_kdtree_free(tree); + BLI_kdtree_3d_balance(tree); + found_duplicates = BLI_kdtree_3d_calc_duplicates_fast(tree, dist, false, duplicates) != 0; + BLI_kdtree_3d_free(tree); } if (found_duplicates) { |