diff options
author | Campbell Barton <ideasman42@gmail.com> | 2012-03-04 00:19:11 +0400 |
---|---|---|
committer | Campbell Barton <ideasman42@gmail.com> | 2012-03-04 00:19:11 +0400 |
commit | 95670e03a01d30cda5a0f685974f28790be6809d (patch) | |
tree | e6d5756cbe51edb083cda2fceff087bda35c361a /source/blender/bmesh/operators/bmo_utils.c | |
parent | a2c182e9233333fc3b8ff40d352113ec95e7e30c (diff) |
style cleanup / comment formatting for bli/bke/bmesh
Diffstat (limited to 'source/blender/bmesh/operators/bmo_utils.c')
-rw-r--r-- | source/blender/bmesh/operators/bmo_utils.c | 64 |
1 files changed, 32 insertions, 32 deletions
diff --git a/source/blender/bmesh/operators/bmo_utils.c b/source/blender/bmesh/operators/bmo_utils.c index 0486c21b847..8e75d7880ee 100644 --- a/source/blender/bmesh/operators/bmo_utils.c +++ b/source/blender/bmesh/operators/bmo_utils.c @@ -551,12 +551,12 @@ void bmo_similarfaces_exec(BMesh *bm, BMOperator *op) num_total = BM_mesh_elem_count(bm, BM_FACE); /* - ** The first thing to do is to iterate through all the the selected items and mark them since - ** they will be in the selection anyway. - ** This will increase performance, (especially when the number of originaly selected faces is high) - ** so the overall complexity will be less than $O(mn)$ where is the total number of selected faces, - ** and n is the total number of faces - */ + * The first thing to do is to iterate through all the the selected items and mark them since + * they will be in the selection anyway. + * This will increase performance, (especially when the number of originaly selected faces is high) + * so the overall complexity will be less than $O(mn)$ where is the total number of selected faces, + * and n is the total number of faces + */ BMO_ITER(fs, &fs_iter, bm, op, "faces", BM_FACE) { if (!BMO_elem_flag_test(bm, fs, FACE_MARK)) { /* is this really needed ? */ BMO_elem_flag_enable(bm, fs, FACE_MARK); @@ -579,9 +579,9 @@ void bmo_similarfaces_exec(BMesh *bm, BMOperator *op) } /* - ** Save us some computation burden: In case of perimeter/area/coplanar selection we compute - ** only once. - */ + * Save us some computation burden: In case of perimeter/area/coplanar selection we compute + * only once. + */ if (type == SIMFACE_PERIMETER || type == SIMFACE_AREA || type == SIMFACE_COPLANAR || type == SIMFACE_IMAGE) { for (i = 0; i < num_total; i++) { switch (type) { @@ -682,9 +682,9 @@ void bmo_similarfaces_exec(BMesh *bm, BMOperator *op) BMO_slot_buffer_from_flag(bm, op, "faceout", FACE_MARK, BM_FACE); } -/****************************************************************************** -** Similar Edges -**************************************************************************** */ +/**************************************************************************** * + * Similar Edges + **************************************************************************** */ #define EDGE_MARK 1 /* @@ -879,9 +879,9 @@ void bmo_similaredges_exec(BMesh *bm, BMOperator *op) BMO_slot_buffer_from_flag(bm, op, "edgeout", EDGE_MARK, BM_EDGE); } -/****************************************************************************** -** Similar Vertices -**************************************************************************** */ +/**************************************************************************** * + * Similar Vertices + **************************************************************************** */ #define VERT_MARK 1 typedef struct SimSel_VertExt { @@ -995,9 +995,9 @@ void bmo_similarverts_exec(BMesh *bm, BMOperator *op) BMO_slot_buffer_from_flag(bm, op, "vertout", VERT_MARK, BM_VERT); } -/****************************************************************************** -** Cycle UVs for a face -**************************************************************************** */ +/**************************************************************************** * + * Cycle UVs for a face + **************************************************************************** */ void bmo_face_rotateuvs_exec(BMesh *bm, BMOperator *op) { @@ -1062,9 +1062,9 @@ void bmo_face_rotateuvs_exec(BMesh *bm, BMOperator *op) } -/****************************************************************************** -** Reverse UVs for a face -**************************************************************************** */ +/**************************************************************************** * + * Reverse UVs for a face + **************************************************************************** */ void bmo_face_reverseuvs_exec(BMesh *bm, BMOperator *op) { @@ -1105,9 +1105,9 @@ void bmo_face_reverseuvs_exec(BMesh *bm, BMOperator *op) BLI_array_free(uvs); } -/****************************************************************************** -** Cycle colors for a face -**************************************************************************** */ +/**************************************************************************** * + * Cycle colors for a face + **************************************************************************** */ void bmo_rotatecolors_exec(BMesh *bm, BMOperator *op) { @@ -1171,9 +1171,9 @@ void bmo_rotatecolors_exec(BMesh *bm, BMOperator *op) } } -/****************************************************************************** -** Reverse colors for a face -**************************************************************************** */ +/*************************************************************************** * + * Reverse colors for a face + *************************************************************************** */ void bmo_face_reversecolors_exec(BMesh *bm, BMOperator *op) { @@ -1213,9 +1213,9 @@ void bmo_face_reversecolors_exec(BMesh *bm, BMOperator *op) } -/****************************************************************************** -** shortest vertex path select -**************************************************************************** */ +/*************************************************************************** * + * shortest vertex path select + *************************************************************************** */ typedef struct ElemNode { BMVert *v; /* vertex */ @@ -1262,8 +1262,8 @@ void bmo_vertexshortestpath_exec(BMesh *bm, BMOperator *op) bm->elem_index_dirty &= ~BM_VERT; /* - ** we now have everything we need, start Dijkstra path finding algorithm - */ + * we now have everything we need, start Dijkstra path finding algorithm + */ /* set the distance/weight of the start vertex to 0 */ vert_list[BM_elem_index_get(sv)].weight = 0.0f; |