Lines Matching refs:Sym
81 if( eNext->Sym < eNext ) { eNext = eNext->Sym; }
84 * Note that the prev pointer is stored in Sym->next.
86 ePrev = eNext->Sym->next;
88 ePrev->Sym->next = e;
90 eNext->Sym->next = eSym;
92 e->Sym = eSym;
100 eSym->Sym = e;
122 aOnext->Sym->Lnext = b;
123 bOnext->Sym->Lnext = a;
201 /* KillEdge( eDel ) destroys an edge (the half-edges eDel and eDel->Sym),
209 if( eDel->Sym < eDel ) { eDel = eDel->Sym; }
213 ePrev = eDel->Sym->next;
214 eNext->Sym->next = ePrev;
215 ePrev->Sym->next = eNext;
299 MakeVertex( newVertex2, e->Sym, &mesh->vHead );
386 GLUhalfEdge *eDelSym = eDel->Sym;
452 eNewSym = eNew->Sym;
481 eNew = tempHalfEdge->Sym;
484 Splice( eOrg->Sym, eOrg->Sym->Oprev );
485 Splice( eOrg->Sym, eNew );
489 eNew->Dst->anEdge = eNew->Sym; /* may have pointed to eOrg->Sym */
492 eNew->Sym->winding = eOrg->Sym->winding;
515 eNewSym = eNew->Sym;
578 eSym = e->Sym;
631 e->Sym = eSym;
640 eSym->Sym = e;
680 e1->Sym->next->Sym->next = e2->next;
681 e2->next->Sym->next = e1->Sym->next;
682 e2->Sym->next->Sym->next = e1;
683 e1->Sym->next = e2->Sym->next;
728 /* One call frees both e and e->Sym (see EdgePair above) */
756 assert( e->Sym != e );
757 assert( e->Sym->Sym == e );
758 assert( e->Lnext->Onext->Sym == e );
759 assert( e->Onext->Sym->Lnext == e );
771 assert( e->Sym != e );
772 assert( e->Sym->Sym == e );
773 assert( e->Lnext->Onext->Sym == e );
774 assert( e->Onext->Sym->Lnext == e );
783 assert( e->Sym->next == ePrev->Sym );
784 assert( e->Sym != e );
785 assert( e->Sym->Sym == e );
788 assert( e->Lnext->Onext->Sym == e );
789 assert( e->Onext->Sym->Lnext == e );
791 assert( e->Sym->next == ePrev->Sym
792 && e->Sym == &mesh->eHeadSym
793 && e->Sym->Sym == e