Welcome to mirror list, hosted at ThFree Co, Russian Federation.

git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
Diffstat (limited to 'source/blender/bmesh/operators/bmo_rotate_edges.c')
-rw-r--r--source/blender/bmesh/operators/bmo_rotate_edges.c15
1 files changed, 10 insertions, 5 deletions
diff --git a/source/blender/bmesh/operators/bmo_rotate_edges.c b/source/blender/bmesh/operators/bmo_rotate_edges.c
index b999e942d10..56eaac03970 100644
--- a/source/blender/bmesh/operators/bmo_rotate_edges.c
+++ b/source/blender/bmesh/operators/bmo_rotate_edges.c
@@ -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. */