HomeSort by relevance Sort by last modified time
    Searched full:pqhandle (Results 1 - 7 of 7) sorted by null

  /external/skia/third_party/glu/libtess/
priorityq-heap.h 48 #define PQhandle PQHeapHandle
87 typedef long PQhandle;
90 typedef struct { PQhandle handle; } PQnode;
91 typedef struct { PQkey key; PQhandle node; } PQhandleElem;
97 PQhandle freeList;
106 PQhandle pqInsert( PriorityQ *pq, PQkey key );
108 void pqDelete( PriorityQ *pq, PQhandle handle );
priorityq-sort.h 48 #undef PQhandle
62 #define PQhandle PQSortHandle
101 typedef PQHeapHandle PQhandle;
108 PQhandle size, max;
117 PQhandle pqInsert( PriorityQ *pq, PQkey key );
119 void pqDelete( PriorityQ *pq, PQhandle handle );
priorityq.h 48 #undef PQhandle
62 #define PQhandle PQSortHandle
101 typedef PQHeapHandle PQhandle;
108 PQhandle size, max;
117 PQhandle pqInsert( PriorityQ *pq, PQkey key );
119 void pqDelete( PriorityQ *pq, PQhandle handle );
priorityq-heap.c 104 PQhandle hCurr, hChild;
134 PQhandle hCurr, hParent;
167 PQhandle pqInsert( PriorityQ *pq, PQkey keyNew )
170 PQhandle free;
219 PQhandle hMin = n[1].handle;
238 void pqDelete( PriorityQ *pq, PQhandle hCurr )
priorityq.c 180 PQhandle pqInsert( PriorityQ *pq, PQkey keyNew )
254 void pqDelete( PriorityQ *pq, PQhandle curr )
sweep.c 543 pqDelete( tess->pq, eUp->Org->pqHandle ); /* __gl_pqSortDelete */
750 eUp->Org->pqHandle = pqInsert( tess->pq, eUp->Org ); /* __gl_pqSortInsert */
751 if (eUp->Org->pqHandle == LONG_MAX) {
    [all...]
mesh.h 130 long pqHandle; /* to allow deletion from priority queue */

Completed in 52 milliseconds