Cross Reference: /xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/monoChain.cc

Lines Matching refs:temp
100   directedLine* temp;
104   for(temp=chainHead; temp!=cTail; temp = temp->getNext())
106       if(temp->head()[0] < minX)
107 	minX = temp->head()[0];
108       if(temp->head()[0] > maxX)
109 	maxX = temp->head()[0];
111       if(temp->head()[1] < minY)
112 	minY = temp->head()[1];
113       if(temp->head()[1] > maxY)
114 	maxY = temp->head()[1];
144   monoChain *temp, *tempNext;
146   for(temp=this; temp != NULL; temp = tempNext)
148       tempNext = temp->next;
149       delete temp;
155   monoChain *temp, *tempNext;
156   for(temp=this; temp != NULL; temp = tempNext)
158       tempNext = temp->nextPolygon;
159       temp->deleteLoop();
165   monoChain *temp;
167   for(temp = next; temp != this; temp = temp->next)
169       array[index++] = temp;
179   monoChain *temp;
181   for(temp = this; temp != NULL; temp=temp->nextPolygon){
182     index = temp->toArraySingleLoop(ret, index);
190   monoChain* temp;
193   for(temp=next; temp != this; temp = temp->next)
201   monoChain *temp;
202   for(temp =this; temp != NULL; temp = temp->nextPolygon)
203     ret += temp->numChainsSingleLoop();
210   directedLine* temp;
213       for(temp= current; temp != chainTail; temp = temp->getNext())
215 	  if(temp->head()[1] > y)
218       current = temp->getPrev();
222       for(temp = current; temp != chainHead; temp = temp->getPrev())
224 	  if(temp->head()[1] > y)
227       current = temp->getNext();
234   directedLine *temp;
245       for(temp = loop->getNext(); temp != loop; temp = temp->getNext())
246 	if(isCusp(temp))
248       prevCusp = temp;
253   for(temp = prevCusp->getNext(); temp != loop; temp = temp->getNext())
255       if(isCusp(temp))
257 //printf("the cusp is (%f,%f), (%f,%f), (%f,%f)\n", temp->getPrev()->head()[0], temp->getPrev()->head()[1], temp->head()[0], temp->head()[1], temp->tail()[0], temp->tail()[1]);
260 	      ret = new monoChain(prevCusp, temp);
263 	    ret->insert(new monoChain(prevCusp, temp));
264 	  prevCusp = temp;	  
275   directedLine* temp;
280   for(temp = list->getNextPolygon(); temp != NULL; temp = temp->getNextPolygon())
282       monoChain *newLoop = directedLineLoopToMonoChainLoop(temp);
396   directedLine *temp;
401       for(temp=current; temp!=chainTail; temp = temp->getNext())
403 	  if(temp->head()[1] > y)
406       current = temp->getPrev();
411       for(temp=current; temp != chainHead; temp = temp->getPrev())
413 	  if(temp->head()[1] > y)
416       current = temp->getNext();
417       ret = temp;
424   directedLine* temp;
425   for(temp = chainHead; temp != chainTail; temp = temp->getNext())
427       printf("(%f,%f) ", temp->head()[0], temp->head()[1]);
434   monoChain* temp;
436   for(temp = next; temp != this; temp = temp->next)
438       temp->printOneChain();
445   monoChain* temp;
446   for(temp=this; temp != NULL; temp = temp->nextPolygon)
447     temp->printChainLoop();