diff options
| author | Howard Trickey <howard.trickey@gmail.com> | 2020-08-26 13:59:58 +0300 |
|---|---|---|
| committer | Howard Trickey <howard.trickey@gmail.com> | 2020-08-26 13:59:58 +0300 |
| commit | 77242de80e483d89fd72fac1cc5a80aa9fc0ab05 (patch) | |
| tree | 6d36f2b86b9a2c8ba3418db6ac224ab9087c92cf /source/blender/bmesh/tools/bmesh_boolean.cc | |
| parent | 4909e599e8a84b10f93cd1111dcd118de6ff069e (diff) | |
Refactor to defer building Plane for Faces until later.
This is a precursor to a big speed optimization in the "finding clusters"
code. Right now there is no speedup, maybe even a bit of a slowdown,
but following commits should lead to nice speed increases.
Diffstat (limited to 'source/blender/bmesh/tools/bmesh_boolean.cc')
| -rw-r--r-- | source/blender/bmesh/tools/bmesh_boolean.cc | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/source/blender/bmesh/tools/bmesh_boolean.cc b/source/blender/bmesh/tools/bmesh_boolean.cc index 17ed581927a..91459e676c1 100644 --- a/source/blender/bmesh/tools/bmesh_boolean.cc +++ b/source/blender/bmesh/tools/bmesh_boolean.cc @@ -60,7 +60,7 @@ static IMesh mesh_from_bm(BMesh *bm, BMVert *bmv = BM_vert_at_index(bm, v); vert[v] = arena->add_or_find_vert(mpq3(bmv->co[0], bmv->co[1], bmv->co[2]), v); } - Array<const Face *> face(bm->totface); + Array<Face *> face(bm->totface); constexpr int estimated_max_facelen = 100; Vector<const Vert *, estimated_max_facelen> face_vert; Vector<int, estimated_max_facelen> face_edge_orig; @@ -84,7 +84,7 @@ static IMesh mesh_from_bm(BMesh *bm, * but their next and e pointers are not correct for the loops * that start added-diagonal edges. */ - Array<const Face *> tri_face(looptris_tot); + Array<Face *> tri_face(looptris_tot); face_vert.resize(3); face_edge_orig.resize(3); for (int i = 0; i < looptris_tot; ++i) { |