diff options
Diffstat (limited to 'source/blender/bmesh/intern/bmesh_edgeloop.c')
| -rw-r--r-- | source/blender/bmesh/intern/bmesh_edgeloop.c | 13 |
1 files changed, 0 insertions, 13 deletions
diff --git a/source/blender/bmesh/intern/bmesh_edgeloop.c b/source/blender/bmesh/intern/bmesh_edgeloop.c index ab14ec23fad..3c79d2bce04 100644 --- a/source/blender/bmesh/intern/bmesh_edgeloop.c +++ b/source/blender/bmesh/intern/bmesh_edgeloop.c @@ -121,9 +121,6 @@ static bool bm_loop_build(BMEdgeLoopStore *el_store, BMVert *v_prev, BMVert *v, return true; } -/** - * \return listbase of listbases, each linking to a vertex. - */ int BM_mesh_edgeloops_find(BMesh *bm, ListBase *r_eloops, bool (*test_fn)(BMEdge *, void *user_data), @@ -506,7 +503,6 @@ void BM_mesh_edgeloops_calc_order(BMesh *UNUSED(bm), ListBase *eloops, const boo /* -------------------------------------------------------------------- */ /* BM_edgeloop_*** functions */ -/* return new edgeloops */ BMEdgeLoopStore *BM_edgeloop_copy(BMEdgeLoopStore *el_store) { BMEdgeLoopStore *el_store_copy = MEM_mallocN(sizeof(*el_store), __func__); @@ -565,9 +561,6 @@ const float *BM_edgeloop_center_get(struct BMEdgeLoopStore *el_store) #define NODE_AS_V(n) ((BMVert *)((LinkData *)n)->data) #define NODE_AS_CO(n) ((BMVert *)((LinkData *)n)->data)->co -/** - * edges are assigned to one vert -> the next. - */ void BM_edgeloop_edges_get(struct BMEdgeLoopStore *el_store, BMEdge **e_arr) { LinkData *node; @@ -653,12 +646,6 @@ bool BM_edgeloop_calc_normal(BMesh *UNUSED(bm), BMEdgeLoopStore *el_store) return true; } -/** - * For open loops that are straight lines, - * calculating the normal as if it were a polygon is meaningless. - * - * Instead use an alignment vector and calculate the normal based on that. - */ bool BM_edgeloop_calc_normal_aligned(BMesh *UNUSED(bm), BMEdgeLoopStore *el_store, const float no_align[3]) |