Cleanup: comments (long lines) in bmesh
This commit is contained in:
@@ -151,14 +151,17 @@ static void bm_rotate_edges_shared(
|
||||
if (ok) {
|
||||
float cost = bm_edge_calc_rotate_cost(e);
|
||||
if (pass_type == PASS_TYPE_BOUNDARY) {
|
||||
/* Trick to ensure once started, non boundaries are handled before other boundary edges.
|
||||
/* Trick to ensure once started,
|
||||
* non boundaries are handled before other boundary edges.
|
||||
* This means the first longest boundary defines the starting point which is rotated
|
||||
* until all its connected edges are exhausted and the next boundary is popped off the heap.
|
||||
* until all its connected edges are exhausted
|
||||
* and the next boundary is popped off the heap.
|
||||
*
|
||||
* Without this we may rotate from different starting points and meet in the middle
|
||||
* with obviously uneven topology.
|
||||
*
|
||||
* Move from negative to positive value, inverting so large values are still handled first.
|
||||
* Move from negative to positive value,
|
||||
* inverting so large values are still handled first.
|
||||
*/
|
||||
cost = cost != 0.0f ? -1.0f / cost : FLT_MAX;
|
||||
}
|
||||
@@ -190,10 +193,12 @@ static void bm_rotate_edges_shared(
|
||||
|
||||
/* Note: we could validate all edges which have not been rotated
|
||||
* (not just previously degenerate edges).
|
||||
* However there is no real need - they can be left until they're popped off the queue. */
|
||||
* However there is no real need -
|
||||
* they can be left until they're popped off the queue. */
|
||||
|
||||
/* We don't know the exact topology after rotating the edge,
|
||||
* so loop over all faces attached to the new edge, typically this will only be two faces. */
|
||||
* so loop over all faces attached to the new edge,
|
||||
* typically this will only be two faces. */
|
||||
BMLoop *l_radial_iter = e_rotate->l;
|
||||
do {
|
||||
/* Skip this edge. */
|
||||
|
||||
Reference in New Issue
Block a user