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
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
|
// Shave and a Haircut
// (c) 2019 Epic Games
// US Patent 6720962
#include <maya/MDagPath.h>
#include <maya/MFnComponent.h>
#include <maya/MFnDoubleIndexedComponent.h>
#include <maya/MFnSingleIndexedComponent.h>
#include <maya/MMatrix.h>
#include <maya/MObjectArray.h>
#include <maya/MPoint.h>
#include <maya/MPxGeometryIterator.h>
#include "shaveHairGeomIt.h"
#include "shaveHairShape.h"
#include "shaveSDKTYPES.h"
static const int mid = SHAVE_VERTS_PER_GUIDE / 2;
shaveHairGeomIt::shaveHairGeomIt(void* geom, MObjectArray& components)
: MPxGeometryIterator(geom, components)
, mComponents(components)
, mHairShape((shaveHairShape*)geom)
{
mWholeGeom = (components.length() == 0);
reset();
}
shaveHairGeomIt::shaveHairGeomIt(void* geom, MObject& components)
: MPxGeometryIterator(geom, components)
, mHairShape((shaveHairShape*)geom)
{
mWholeGeom = components.isNull();
if (!mWholeGeom) mComponents.append(components);
reset();
}
void shaveHairGeomIt::component(MObject& comp)
{
if (mIsDone)
comp = MObject::kNullObj;
else
{
MFnDoubleIndexedComponent compFn;
comp = compFn.create(shaveHairShape::kShaveGuideVertComponent);
compFn.addElement(mCurGuide, mCurVert);
}
}
int shaveHairGeomIt::index() const
{
return mIterationIndex;
}
int shaveHairGeomIt::indexUnsimplified() const
{
return mCurGuide * SHAVE_VERTS_PER_GUIDE + mCurVert;
}
int shaveHairGeomIt::iteratorCount() const
{
return mNumGuides * SHAVE_VERTS_PER_GUIDE;
}
void shaveHairGeomIt::next()
{
if (!mIsDone)
{
if (mWholeGeom)
{
if (++mCurVert >= SHAVE_VERTS_PER_GUIDE)
{
mCurVert = 0;
mIsDone = (++mCurGuide >= mNumGuides);
}
}
else
{
MFnComponent compFn(mComponents[mObjIndex]);
if (++mElementIndex >= compFn.elementCount())
{
mElementIndex = 0;
//
// I don't know if we need to worry about the
// possibility of empty component objects, but if so,
// this should take care of them.
//
while (++mObjIndex < mComponents.length())
{
compFn.setObject(mComponents[mObjIndex]);
if (compFn.elementCount() > 0) break;
}
mIsDone = (mObjIndex >= mComponents.length());
}
if (!mIsDone)
{
if (mComponents[mObjIndex].hasFn(MFn::kSingleIndexedComponent))
{
MFnSingleIndexedComponent guideComp(mComponents[mObjIndex]);
mCurGuide = guideComp.element(mElementIndex);
mCurVert = mid;
}
else
{
MFnDoubleIndexedComponent vertComp(mComponents[mObjIndex]);
vertComp.getElement(mElementIndex, mCurGuide, mCurVert);
}
}
}
mIterationIndex++;
}
}
MPoint shaveHairGeomIt::point() const
{
MPoint p;
if (!mIsDone && mHairShape)
{
//
// Load the hairShape into the Shave engine.
//
mHairShape->makeCurrent();
SOFTGUIDE guide;
if (SHAVEfetch_guide(mCurGuide, &guide) != -1)
{
VERT& vert = guide.guide[mCurVert];
p.x = (double)vert.x;
p.y = (double)vert.y;
p.z = (double)vert.z;
//
// Transform the point into local space.
//
MDagPath shapePath;
MDagPath::getAPathTo(mHairShape->thisMObject(), shapePath);
p *= shapePath.inclusiveMatrixInverse();
}
}
return p;
}
void shaveHairGeomIt::reset()
{
MPxGeometryIterator::reset();
setCurrentPoint(0);
mIterationIndex = 0;
if (mHairShape)
{
mNumGuides = (int)mHairShape->getGuideCount();
setMaxPoints(mNumGuides * SHAVE_VERTS_PER_GUIDE);
}
else
{
setMaxPoints(0);
mNumGuides = 0;
}
mCurGuide = 0;
mCurVert = 0;
if (mWholeGeom)
{
mIsDone = (mNumGuides == 0);
}
else
{
//
// I don't know if we have to worry about getting empty component
// objects, but let's check, just to be safe.
//
for (mObjIndex = 0; mObjIndex < mComponents.length(); mObjIndex++)
{
if (mComponents[mObjIndex].hasFn(MFn::kSingleIndexedComponent))
{
MFnSingleIndexedComponent compFn(mComponents[mObjIndex]);
if (compFn.elementCount() > 0)
{
mCurGuide = compFn.element(0);
mCurVert = mid;
break;
}
}
else if (mComponents[mObjIndex].hasFn(MFn::kDoubleIndexedComponent))
{
MFnDoubleIndexedComponent compFn(mComponents[mObjIndex]);
if (compFn.elementCount() > 0)
{
compFn.getElement(0, mCurGuide, mCurVert);
break;
}
}
}
mIsDone = (mObjIndex >= mComponents.length());
mElementIndex = 0;
}
}
void shaveHairGeomIt::setPoint(const MPoint& newPoint) const
{
cout << "shaveHairGeomIt::setPoint" << endl;
// %%% not yet implemented
}
int shaveHairGeomIt::setPointGetNext(MPoint& pointInOut)
{
// %%% 'set' portion not yet implemented
cout << "shaveHairGeomIt::setPointGetNext" << endl;
next();
pointInOut = point();
return index();
}
|