@@ -104,7 +104,7 @@ void NvStripifier::BuildStripifyInfo(NvFaceInfoVec &faceInfos, NvEdgeInfoVec &ed
104104
105105 // create the face info and add it to the list of faces, but only if this exact face doesn't already
106106 // exist in the list
107- NvFaceInfo *faceInfo = xr_new< NvFaceInfo> (v0, v1, v2);
107+ NvFaceInfo *faceInfo = new NvFaceInfo (v0, v1, v2);
108108 if (!AlreadyExists (faceInfo, faceInfos))
109109 {
110110 faceInfos.push_back (faceInfo);
@@ -114,7 +114,7 @@ void NvStripifier::BuildStripifyInfo(NvFaceInfoVec &faceInfos, NvEdgeInfoVec &ed
114114 if (edgeInfo01 == NULL ){
115115
116116 // create the info
117- edgeInfo01 = xr_new< NvEdgeInfo> (v0, v1);
117+ edgeInfo01 = new NvEdgeInfo (v0, v1);
118118
119119 // update the linked list on both
120120 edgeInfo01->m_nextV0 = edgeInfos[v0];
@@ -137,7 +137,7 @@ void NvStripifier::BuildStripifyInfo(NvFaceInfoVec &faceInfos, NvEdgeInfoVec &ed
137137 if (edgeInfo12 == NULL ){
138138
139139 // create the info
140- edgeInfo12 = xr_new< NvEdgeInfo> (v1, v2);
140+ edgeInfo12 = new NvEdgeInfo (v1, v2);
141141
142142 // update the linked list on both
143143 edgeInfo12->m_nextV0 = edgeInfos[v1];
@@ -160,7 +160,7 @@ void NvStripifier::BuildStripifyInfo(NvFaceInfoVec &faceInfos, NvEdgeInfoVec &ed
160160 if (edgeInfo20 == NULL ){
161161
162162 // create the info
163- edgeInfo20 = xr_new< NvEdgeInfo> (v2, v0);
163+ edgeInfo20 = new NvEdgeInfo (v2, v0);
164164
165165 // update the linked list on both
166166 edgeInfo20->m_nextV0 = edgeInfos[v2];
@@ -698,7 +698,7 @@ void NvStripifier::RemoveSmallStrips(NvStripInfoVec& allStrips, NvStripInfoVec&
698698 bool *bVisitedList = xr_alloc<bool > (tempFaceList.size ());
699699 ZeroMemory (bVisitedList, tempFaceList.size ()*sizeof (bool ));
700700
701- VertexCache* vcache = xr_new< VertexCache> (cacheSize);
701+ VertexCache* vcache = new VertexCache (cacheSize);
702702
703703 int bestNumHits = -1 ;
704704 int numHits = 0 ;
@@ -966,7 +966,7 @@ void NvStripifier::SplitUpStripsAndOptimize(NvStripInfoVec &allStrips, NvStripIn
966966 int j;
967967 for (j = 0 ; j < numTimes; j++)
968968 {
969- currentStrip = xr_new< NvStripInfo> (startInfo, 0 , -1 );
969+ currentStrip = new NvStripInfo (startInfo, 0 , -1 );
970970
971971 for (int faceCtr = j*threshold; faceCtr < threshold+(j*threshold); faceCtr++) {
972972 currentStrip->m_faces .push_back (allStrips[i]->m_faces [faceCtr]);
@@ -979,7 +979,7 @@ void NvStripifier::SplitUpStripsAndOptimize(NvStripInfoVec &allStrips, NvStripIn
979979
980980 if (numLeftover != 0 )
981981 {
982- currentStrip = xr_new< NvStripInfo> (startInfo, 0 , -1 );
982+ currentStrip = new NvStripInfo (startInfo, 0 , -1 );
983983
984984 for (int k = 0 ; k < numLeftover; k++)
985985 {
@@ -993,7 +993,7 @@ void NvStripifier::SplitUpStripsAndOptimize(NvStripInfoVec &allStrips, NvStripIn
993993 {
994994 // we're not just doing a tempStrips.push_back(allBigStrips[i]) because
995995 // this way we can _delete allBigStrips later to xr_free the memory
996- currentStrip = xr_new< NvStripInfo> (startInfo, 0 , -1 );
996+ currentStrip = new NvStripInfo (startInfo, 0 , -1 );
997997
998998 for (int j = 0 ; j < allStrips[i]->m_faces .size (); j++)
999999 currentStrip->m_faces .push_back (allStrips[i]->m_faces [j]);
@@ -1010,7 +1010,7 @@ void NvStripifier::SplitUpStripsAndOptimize(NvStripInfoVec &allStrips, NvStripIn
10101010 if (tempStrips2.size () != 0 )
10111011 {
10121012 // Optimize for the vertex cache
1013- VertexCache* vcache = xr_new< VertexCache> (cacheSize);
1013+ VertexCache* vcache = new VertexCache (cacheSize);
10141014
10151015 float bestNumHits = -1 .0f ;
10161016 float numHits = 0 ;
@@ -1264,32 +1264,32 @@ void NvStripifier::FindAllStrips(NvStripInfoVec &allStrips,
12641264
12651265 // build the strip off of this face's 0-1 edge
12661266 NvEdgeInfo *edge01 = FindEdgeInfo (allEdgeInfos, nextFace->m_v0 , nextFace->m_v1 );
1267- NvStripInfo *strip01 = xr_new< NvStripInfo> (NvStripStartInfo (nextFace, edge01, true ), stripId++, experimentId++);
1267+ NvStripInfo *strip01 = new NvStripInfo (NvStripStartInfo (nextFace, edge01, true ), stripId++, experimentId++);
12681268 experiments[experimentIndex++].push_back (strip01);
12691269
12701270 // build the strip off of this face's 1-0 edge
12711271 NvEdgeInfo *edge10 = FindEdgeInfo (allEdgeInfos, nextFace->m_v0 , nextFace->m_v1 );
1272- NvStripInfo *strip10 = xr_new< NvStripInfo> (NvStripStartInfo (nextFace, edge10, false ), stripId++, experimentId++);
1272+ NvStripInfo *strip10 = new NvStripInfo (NvStripStartInfo (nextFace, edge10, false ), stripId++, experimentId++);
12731273 experiments[experimentIndex++].push_back (strip10);
12741274
12751275 // build the strip off of this face's 1-2 edge
12761276 NvEdgeInfo *edge12 = FindEdgeInfo (allEdgeInfos, nextFace->m_v1 , nextFace->m_v2 );
1277- NvStripInfo *strip12 = xr_new< NvStripInfo> (NvStripStartInfo (nextFace, edge12, true ), stripId++, experimentId++);
1277+ NvStripInfo *strip12 = new NvStripInfo (NvStripStartInfo (nextFace, edge12, true ), stripId++, experimentId++);
12781278 experiments[experimentIndex++].push_back (strip12);
12791279
12801280 // build the strip off of this face's 2-1 edge
12811281 NvEdgeInfo *edge21 = FindEdgeInfo (allEdgeInfos, nextFace->m_v1 , nextFace->m_v2 );
1282- NvStripInfo *strip21 = xr_new< NvStripInfo> (NvStripStartInfo (nextFace, edge21, false ), stripId++, experimentId++);
1282+ NvStripInfo *strip21 = new NvStripInfo (NvStripStartInfo (nextFace, edge21, false ), stripId++, experimentId++);
12831283 experiments[experimentIndex++].push_back (strip21);
12841284
12851285 // build the strip off of this face's 2-0 edge
12861286 NvEdgeInfo *edge20 = FindEdgeInfo (allEdgeInfos, nextFace->m_v2 , nextFace->m_v0 );
1287- NvStripInfo *strip20 = xr_new< NvStripInfo> (NvStripStartInfo (nextFace, edge20, true ), stripId++, experimentId++);
1287+ NvStripInfo *strip20 = new NvStripInfo (NvStripStartInfo (nextFace, edge20, true ), stripId++, experimentId++);
12881288 experiments[experimentIndex++].push_back (strip20);
12891289
12901290 // build the strip off of this face's 0-2 edge
12911291 NvEdgeInfo *edge02 = FindEdgeInfo (allEdgeInfos, nextFace->m_v2 , nextFace->m_v0 );
1292- NvStripInfo *strip02 = xr_new< NvStripInfo> (NvStripStartInfo (nextFace, edge02, false ), stripId++, experimentId++);
1292+ NvStripInfo *strip02 = new NvStripInfo (NvStripStartInfo (nextFace, edge02, false ), stripId++, experimentId++);
12931293 experiments[experimentIndex++].push_back (strip02);
12941294 }
12951295
@@ -1312,7 +1312,7 @@ void NvStripifier::FindAllStrips(NvStripInfoVec &allStrips,
13121312 while (FindTraversal (allFaceInfos, allEdgeInfos, stripIter, startInfo)){
13131313
13141314 // create the _new strip info
1315- stripIter = xr_new< NvStripInfo> (startInfo, stripId++, experimentId);
1315+ stripIter = new NvStripInfo (startInfo, stripId++, experimentId);
13161316
13171317 // build the next strip
13181318 stripIter->Build (allEdgeInfos, allFaceInfos);
0 commit comments