Searched refs:LEQ (Results 1 - 2 of 2) sorted by relevance
| /xsrc/external/mit/glu/dist/src/libtess/ |
| H A D | priorityq-heap.c | 50 #define LEQ(x,y) (*pq->leq)(x,y) macro
54 #define LEQ(x,y) VertLeq((GLUvertex *)x, (GLUvertex *)y) macro
106 if( child < pq->size && LEQ( h[n[child+1].handle].key,
114 if( child > pq->size || LEQ( h[hCurr].key, h[hChild].key )) {
137 if( parent == 0 || LEQ( h[hParent].key, h[hCurr].key )) {
247 if( curr <= 1 || LEQ( h[n[curr>>1].handle].key, h[n[curr].handle].key )) {
|
| H A D | priorityq.c | 87 #define LT(x,y) (! LEQ(y,x))
88 #define GT(x,y) (! LEQ(x,y))
165 assert( LEQ( **(i+1), **i ));
213 if( LEQ( heapMin, sortMin )) {
234 if( LEQ( heapMin, sortMin )) {
|
Completed in 2 milliseconds