HomeSort by relevance Sort by last modified time
    Searched refs:VertLeq (Results 1 - 5 of 5) sorted by null

  /external/skia/third_party/glu/libtess/
geom.c 51 return VertLeq( u, v );
56 /* Given three vertices u,v,w such that VertLeq(u,v) && VertLeq(v,w),
68 assert( VertLeq( u, v ) && VertLeq( v, w ));
92 assert( VertLeq( u, v ) && VertLeq( v, w ));
223 * Strategy: find the two middle vertices in the VertLeq ordering,
228 if( ! VertLeq( o1, d1 )) { Swap( o1, d1 ); }
229 if( ! VertLeq( o2, d2 )) { Swap( o2, d2 );
    [all...]
geom.h 53 #define VertLeq(u,v) (((u)->s < (v)->s) | \
57 #define VertLeq(u,v) (((u)->s < (v)->s) || \
64 /* Versions of VertLeq, EdgeSign, EdgeEval with s and t transposed. */
72 #define EdgeGoesLeft(e) VertLeq( (e)->Dst, (e)->Org )
73 #define EdgeGoesRight(e) VertLeq( (e)->Org, (e)->Dst )
tessmono.c 91 for( ; VertLeq( up->Dst, up->Org ); up = up->Lprev )
93 for( ; VertLeq( up->Org, up->Dst ); up = up->Lnext )
98 if( VertLeq( up->Dst, lo->Org )) {
sweep.c 72 * - each edge e satisfies VertLeq(e->Dst,event) && VertLeq(event,e->Org)
82 * of monotonically increasing vertices according to VertLeq(v1,v2)
134 if( VertLeq( e1->Org, e2->Org )) {
362 assert( VertLeq( e->Org, e->Dst ));
531 if( VertLeq( eUp->Org, eLo->Org )) {
584 if( VertLeq( eUp->Dst, eLo->Dst )) {
641 if( VertLeq( orgUp, orgLo )) {
657 if( VertLeq( &isect, tess->event )) {
673 orgMin = VertLeq( orgUp, orgLo ) ? orgUp : orgLo
    [all...]
priorityq-heap.c 58 #define LEQ(x,y) VertLeq((GLUvertex *)x, (GLUvertex *)y)

Completed in 221 milliseconds