diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2012-02-23 13:26:53 +0400 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2012-02-23 13:26:53 +0400 |
| commit | 09ee59c669dfa51bab22fe2552d619763a8c98a3 (patch) | |
| tree | bb656638c2f686ef43166e26ed2a48351f8a543d /source/blender/bmesh/intern/bmesh_structure.h | |
| parent | bc02db27c5461a8228ea8d06325a2170998dbb72 (diff) | |
bmesh minor api refactor
* BM_vert_in_face now loops over a vert's faces rather then every vert in the face.
* rename bmesh_radial_find_first_facevert --> bmesh_radial_find_first_faceloop
* rename bmesh_radial_find_next_facevert --> bmesh_radial_find_next_faceloop
* rename BM_vert_collapse_edges --> BM_vert_collapse_edge (only collapses one)
Diffstat (limited to 'source/blender/bmesh/intern/bmesh_structure.h')
| -rw-r--r-- | source/blender/bmesh/intern/bmesh_structure.h | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/source/blender/bmesh/intern/bmesh_structure.h b/source/blender/bmesh/intern/bmesh_structure.h index 74da6cc3c58..4be577ca476 100644 --- a/source/blender/bmesh/intern/bmesh_structure.h +++ b/source/blender/bmesh/intern/bmesh_structure.h @@ -43,7 +43,7 @@ struct ListBase; void remove_loop_radial_link(BMLoop *l); -/*DOUBLE CIRCULAR LINKED LIST FUNCTIONS*/ +/* DOUBLE CIRCULAR LINKED LIST FUNCTIONS */ void bmesh_cycle_append(void *h, void *nt); int bmesh_cycle_remove(void *h, void *remn); int bmesh_cycle_validate(int len, void *h); @@ -52,7 +52,7 @@ int bmesh_cycle_length(void *h); /* LOOP CYCLE MANAGEMENT */ int bmesh_loop_validate(BMFace *f); -/*DISK CYCLE MANAGMENT*/ +/* DISK CYCLE MANAGMENT */ int bmesh_disk_append_edge(struct BMEdge *e, struct BMVert *v); void bmesh_disk_remove_edge(struct BMEdge *e, struct BMVert *v); struct BMEdge *bmesh_disk_nextedge(struct BMEdge *e, struct BMVert *v); @@ -61,17 +61,17 @@ int bmesh_disk_count_facevert(struct BMVert *v); struct BMEdge *bmesh_disk_find_first_faceedge(struct BMEdge *e, struct BMVert *v); struct BMEdge *bmesh_disk_find_next_faceedge(struct BMEdge *e, struct BMVert *v); -/*RADIAL CYCLE MANAGMENT*/ +/* RADIAL CYCLE MANAGMENT */ void bmesh_radial_append(struct BMEdge *e, struct BMLoop *l); void bmesh_radial_remove_loop(struct BMLoop *l, struct BMEdge *e); int bmesh_radial_find_face(struct BMEdge *e, struct BMFace *f); struct BMLoop *bmesh_radial_nextloop(struct BMLoop *l); int bmesh_radial_count_facevert(struct BMLoop *l, struct BMVert *v); -struct BMLoop *bmesh_radial_find_first_facevert(struct BMLoop *l, struct BMVert *v); -struct BMLoop *bmesh_radial_find_next_facevert(struct BMLoop *l, struct BMVert *v); +struct BMLoop *bmesh_radial_find_first_faceloop(struct BMLoop *l, struct BMVert *v); +struct BMLoop *bmesh_radial_find_next_faceloop(struct BMLoop *l, struct BMVert *v); int bmesh_radial_validate(int radlen, struct BMLoop *l); -/*EDGE UTILITIES*/ +/* EDGE UTILITIES */ int bmesh_vert_in_edge(struct BMEdge *e, struct BMVert *v); int bmesh_verts_in_edge(struct BMVert *v1, struct BMVert *v2, struct BMEdge *e); int bmesh_edge_swapverts(struct BMEdge *e, struct BMVert *orig, struct BMVert *newv); /*relink edge*/ |