1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
|
/*
* ***** 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
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
* Contributor(s): Lukas Toenne.
*
* ***** END GPL LICENSE BLOCK *****
*/
/** \file blender/bmesh/intern/bmesh_strands.c
* \ingroup bmesh
*/
#include "MEM_guardedalloc.h"
#include "BLI_utildefines.h"
#include "BLI_math.h"
#include "BLI_mempool.h"
#include "bmesh.h"
#include "bmesh_private.h"
/*
* STRANDS OF MESH CALLBACKS
*/
void bmstranditer__strands_of_mesh_begin(struct BMIter__elem_of_mesh *iter)
{
BLI_mempool_iternew(iter->pooliter.pool, &iter->pooliter);
}
void *bmstranditer__strands_of_mesh_step(struct BMIter__elem_of_mesh *iter)
{
BMVert *v;
do {
v = BLI_mempool_iterstep(&iter->pooliter);
} while (v && !BM_strands_vert_is_root(v));
return v;
}
/*
* VERTS OF STRAND CALLBACKS
*/
/* BMIter__vert_of_strand is not included in the union in BMIter, just make sure it is big enough */
BLI_STATIC_ASSERT(sizeof(BMIter__vert_of_strand) <= sizeof(BMIter), "BMIter must be at least as large as BMIter__vert_of_strand")
void bmstranditer__verts_of_strand_begin(struct BMIter__vert_of_strand *iter)
{
iter->e_next = iter->v_next->e;
}
void *bmstranditer__verts_of_strand_step(struct BMIter__vert_of_strand *iter)
{
BMVert *v_curr = iter->v_next;
if (iter->e_next) {
BMEdge *e_first = iter->e_next;
/* select the other vertex of the current edge */
iter->v_next = (iter->v_next == iter->e_next->v1 ? iter->e_next->v2 : iter->e_next->v1);
/* select the next edge of the current vertex */
iter->e_next = bmesh_disk_edge_next(iter->e_next, iter->v_next);
if (iter->e_next == e_first) {
/* only one edge means the last segment, terminate */
iter->e_next = NULL;
}
}
else
iter->v_next = NULL; /* last vertex, terminate */
return v_curr;
}
/* ------------------------------------------------------------------------- */
int BM_strands_count(BMesh *bm)
{
BMVert *v;
BMIter iter;
int count = 0;
BM_ITER_STRANDS(v, &iter, bm, BM_STRANDS_OF_MESH) {
++count;
}
return count;
}
int BM_strands_keys_count(BMVert *root)
{
BMVert *v;
BMIter iter;
int count = 0;
BM_ITER_STRANDS_ELEM(v, &iter, root, BM_VERTS_OF_STRAND) {
++count;
}
return count;
}
/* ------------------------------------------------------------------------- */
/* Create a new strand */
BMVert *BM_strands_create(BMesh *bm, int len, bool set_defaults)
{
float co[3] = {0.0f, 0.0f, 0.0f};
BMVert *root, *v = NULL, *vprev;
int k;
for (k = 0; k < len; ++k) {
vprev = v;
v = BM_vert_create(bm, co, NULL, set_defaults ? BM_CREATE_NOP : BM_CREATE_SKIP_CD);
zero_v3(v->no);
/* root */
if (k == 0) {
root = v;
}
else {
/*BMEdge *e =*/ BM_edge_create(bm, vprev, v, NULL, set_defaults ? BM_CREATE_NOP : BM_CREATE_SKIP_CD);
}
}
return root;
}
|
