Lines Matching refs:temp
133 directedLine* temp;
143 for(temp = this->next; temp != this; temp = temp->next)
146 if(temp->head()[0] != temp->tail()[0] ||
147 temp->head()[1] != temp->tail()[1])
149 if(! myequal(temp->head(), temp->tail()))
151 first = temp;
166 for(temp =first->next; temp != first; temp = tempNext)
168 tempNext = temp->getNext();
170 if(temp->head()[0] == temp->tail()[0] &&
171 temp->head()[1] == temp->tail()[1])
174 if(myequal(temp->head(), temp->tail()))
175 deleteSingleLine(temp);
182 directedLine* temp;
186 for(temp=this; temp != NULL; temp = tempNext)
188 tempNext = temp->nextPolygon;
189 temp->nextPolygon = NULL;
192 ret = retEnd = temp->deleteDegenerateLines();
197 directedLine *newPolygon = temp->deleteDegenerateLines();
200 retEnd->nextPolygon = temp->deleteDegenerateLines();
210 directedLine* temp;
215 for(temp=this; temp != NULL; temp = tempNext)
218 tempNext = temp->nextPolygon;
219 temp->nextPolygon = NULL;
223 ret = retEnd = DBG_cutIntersectionPoly(temp, eachCutOccur);
230 retEnd->nextPolygon = DBG_cutIntersectionPoly(temp, eachCutOccur);
242 directedLine *temp, *tempNext;
244 for(temp=this; temp != NULL; temp = tempNext)
246 tempNext = temp->next;
247 delete temp->sline;
248 delete temp;
254 directedLine *temp, *tempNext;
255 for(temp=this; temp != NULL; temp=tempNext)
257 tempNext = temp->nextPolygon;
258 temp->deleteSinglePolygonWithSline();
264 directedLine *temp, *tempNext;
266 for(temp=this; temp != NULL; temp = tempNext)
268 tempNext = temp->next;
269 delete temp;
275 directedLine *temp, *tempNext;
276 for(temp=this; temp != NULL; temp=tempNext)
278 tempNext = temp->nextPolygon;
279 temp->deleteSinglePolygon();
349 directedLine* temp;
353 for(temp = next; temp != this; temp = temp->next)
361 directedLine* temp;
362 for(temp=this; temp!= NULL; temp=temp->nextPolygon)
364 ret += temp->numEdges();
373 directedLine* temp;
382 for(temp=next; temp != this; temp = temp->next){
483 directedLine* temp;
485 for(temp = next; temp!=this; temp=temp->next)
486 temp->printSingle();
492 directedLine *temp;
493 for(temp = this; temp!=NULL; temp = temp->nextPolygon)
496 temp->printList();
516 directedLine* temp;
520 for(temp=this; temp != p; temp = temp->nextPolygon)
522 if(temp == NULL)
527 prev_polygon = temp;
554 directedLine *temp;
556 for(temp = next; temp != this; temp = temp->next)
558 array[index++] = temp;
573 directedLine *temp;
575 for(temp=this; temp != NULL; temp=temp->nextPolygon) {
576 index = temp->toArraySinglePolygon(ret, index);
587 directedLine* temp;
595 for(temp=this->next; temp!=this; temp = temp->next)
597 x1 = temp->head()[0];
598 y1 = temp->head()[1];
599 x2 = temp->next->head()[0];
600 y2 = temp->next->head()[1];
714 directedLine *temp;
715 for(temp = v1->next; temp != v1; temp = temp->next)
717 if(temp == v2) return 1;
725 directedLine* temp;
726 for(temp = next; temp != this; temp = temp->next)
727 if(temp -> rootBit ) return temp;
765 directedLine *temp;
768 for(temp = root->next; temp != root; temp=temp->next)
769 npoints += temp->get_npoints()-1;
778 for(temp=root->next; temp != root; temp = temp->next)
780 for(Int i=0; i<temp->get_npoints()-1; i++){
782 fprintf(fp, "%f ", temp->getVertex(i)[0]);
783 fprintf(fp, "%f ", temp->getVertex(i)[1]);