diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2013-08-03 20:37:23 +0400 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2013-08-03 20:37:23 +0400 |
| commit | 4770848871c9b19caf113f250a0346b4954a8c2e (patch) | |
| tree | e61129948234f91acb31bc0f50b16ba552a34307 /source/blender/bmesh/intern/bmesh_structure.h | |
| parent | 31761f5e5b06a394a4165ddc2eca27e644b1282a (diff) | |
code cleanup: bmesh use 'const' for query functions.
Diffstat (limited to 'source/blender/bmesh/intern/bmesh_structure.h')
| -rw-r--r-- | source/blender/bmesh/intern/bmesh_structure.h | 22 |
1 files changed, 11 insertions, 11 deletions
diff --git a/source/blender/bmesh/intern/bmesh_structure.h b/source/blender/bmesh/intern/bmesh_structure.h index 82bf10fe0ef..f64fb911ab4 100644 --- a/source/blender/bmesh/intern/bmesh_structure.h +++ b/source/blender/bmesh/intern/bmesh_structure.h @@ -47,11 +47,11 @@ bool bmesh_loop_validate(BMFace *f); /* DISK CYCLE MANAGMENT */ void bmesh_disk_edge_append(BMEdge *e, BMVert *v); void bmesh_disk_edge_remove(BMEdge *e, BMVert *v); -BMEdge *bmesh_disk_edge_next(BMEdge *e, BMVert *v); -BMEdge *bmesh_disk_edge_prev(BMEdge *e, BMVert *v); -int bmesh_disk_facevert_count(BMVert *v); -BMEdge *bmesh_disk_faceedge_find_first(BMEdge *e, BMVert *v); -BMEdge *bmesh_disk_faceedge_find_next(BMEdge *e, BMVert *v); +BMEdge *bmesh_disk_edge_next(const BMEdge *e, const BMVert *v); +BMEdge *bmesh_disk_edge_prev(const BMEdge *e, const BMVert *v); +int bmesh_disk_facevert_count(const BMVert *v); +BMEdge *bmesh_disk_faceedge_find_first(const BMEdge *e, const BMVert *v); +BMEdge *bmesh_disk_faceedge_find_next(const BMEdge *e, const BMVert *v); /* RADIAL CYCLE MANAGMENT */ void bmesh_radial_append(BMEdge *e, BMLoop *l); @@ -60,18 +60,18 @@ void bmesh_radial_loop_remove(BMLoop *l, BMEdge *e); * bmesh_radial_loop_next(BMLoop *l) / prev. * just use member access l->radial_next, l->radial_prev now */ -int bmesh_radial_facevert_count(BMLoop *l, BMVert *v); -BMLoop *bmesh_radial_faceloop_find_first(BMLoop *l, BMVert *v); -BMLoop *bmesh_radial_faceloop_find_next(BMLoop *l, BMVert *v); -BMLoop *bmesh_radial_faceloop_find_vert(BMFace *f, BMVert *v); +int bmesh_radial_facevert_count(const BMLoop *l, const BMVert *v); +BMLoop *bmesh_radial_faceloop_find_first(const BMLoop *l, const BMVert *v); +BMLoop *bmesh_radial_faceloop_find_next(const BMLoop *l, const BMVert *v); +BMLoop *bmesh_radial_faceloop_find_vert(const BMFace *f, const BMVert *v); bool bmesh_radial_validate(int radlen, BMLoop *l); /* EDGE UTILITIES */ bool bmesh_vert_in_edge(const BMEdge *e, const BMVert *v); -bool bmesh_verts_in_edge(BMVert *v1, BMVert *v2, BMEdge *e); +bool bmesh_verts_in_edge(const BMVert *v1, const BMVert *v2, const BMEdge *e); bool bmesh_edge_swapverts(BMEdge *e, BMVert *orig, BMVert *newv); /* relink edge */ BMVert *bmesh_edge_other_vert_get(BMEdge *e, BMVert *v); -BMEdge *bmesh_disk_edge_exists(BMVert *v1, BMVert *v2); +BMEdge *bmesh_disk_edge_exists(const BMVert *v1, const BMVert *v2); bool bmesh_disk_validate(int len, BMEdge *e, BMVert *v); #endif /* __BMESH_STRUCTURE_H__ */ |