diff options
Diffstat (limited to 'source/blender/bmesh/intern/bmesh_structure.c')
-rw-r--r-- | source/blender/bmesh/intern/bmesh_structure.c | 16 |
1 files changed, 0 insertions, 16 deletions
diff --git a/source/blender/bmesh/intern/bmesh_structure.c b/source/blender/bmesh/intern/bmesh_structure.c index 8f9b4274336..811b83805c4 100644 --- a/source/blender/bmesh/intern/bmesh_structure.c +++ b/source/blender/bmesh/intern/bmesh_structure.c @@ -1,6 +1,4 @@ /* - * ***** BEGIN GPL LICENSE BLOCK ***** - * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version 2 @@ -17,12 +15,6 @@ * * The Original Code is Copyright (C) 2007 Blender Foundation. * All rights reserved. - * - * The Original Code is: all of this file. - * - * Contributor(s): Geoffrey Bantle. - * - * ***** END GPL LICENSE BLOCK ***** */ /** \file blender/bmesh/intern/bmesh_structure.c @@ -108,8 +100,6 @@ void bmesh_disk_vert_replace(BMEdge *e, BMVert *v_dst, BMVert *v_src) * modification of specific cycle types. * * The three cycles explicitly stored in the BM data structure are as follows: - * - * * 1: The Disk Cycle - A circle of edges around a vertex * Base: vertex->edge pointer. * @@ -133,8 +123,6 @@ void bmesh_disk_vert_replace(BMEdge *e, BMVert *v_dst, BMVert *v_src) * - #bmesh_disk_facevert_count * - #bmesh_disk_faceedge_find_first * - #bmesh_disk_faceedge_find_next - * - * * 2: The Radial Cycle - A circle of face edges (bmesh_Loop) around an edge * Base: edge->l->radial structure. * @@ -150,8 +138,6 @@ void bmesh_disk_vert_replace(BMEdge *e, BMVert *v_dst, BMVert *v_src) * - #bmesh_radial_faceloop_find_first * - #bmesh_radial_faceloop_find_next * - #bmesh_radial_validate - * - * * 3: The Loop Cycle - A circle of face edges around a polygon. * Base: polygon->lbase. * @@ -161,8 +147,6 @@ void bmesh_disk_vert_replace(BMEdge *e, BMVert *v_dst, BMVert *v_src) * * Functions relating to this cycle: * - bmesh_cycle_XXX family of functions. - * - * * \note the order of elements in all cycles except the loop cycle is undefined. This * leads to slightly increased seek time for deriving some adjacency relations, however the * advantage is that no intrinsic properties of the data structures are dependent upon the |