Searched refs:PQkey (Results 1 - 6 of 6) sorted by relevance
| /xsrc/external/mit/glu/dist/src/libtess/ |
| H A D | priorityq-sort.h | 40 #undef PQkey
54 #define PQkey PQSortKey macro
93 typedef PQHeapKey PQkey; typedef in typeref:typename:PQHeapKey
99 PQkey *keys;
100 PQkey **order;
103 int (*leq)(PQkey key1, PQkey key2);
106 PriorityQ *pqNewPriorityQ( int (*leq)(PQkey key1, PQkey key2) );
110 PQhandle pqInsert( PriorityQ *pq, PQkey ke
[all...] |
| H A D | priorityq.h | 40 #undef PQkey
54 #define PQkey PQSortKey macro
93 typedef PQHeapKey PQkey; typedef in typeref:typename:PQHeapKey
99 PQkey *keys;
100 PQkey **order;
103 int (*leq)(PQkey key1, PQkey key2);
106 PriorityQ *pqNewPriorityQ( int (*leq)(PQkey key1, PQkey key2) );
110 PQhandle pqInsert( PriorityQ *pq, PQkey ke
[all...] |
| H A D | priorityq-heap.h | 40 #define PQkey PQHeapKey macro
79 typedef void *PQkey; typedef in typeref:typename:void *
84 typedef struct { PQkey key; PQhandle node; } PQhandleElem;
92 int (*leq)(PQkey key1, PQkey key2);
95 PriorityQ *pqNewPriorityQ( int (*leq)(PQkey key1, PQkey key2) );
99 PQhandle pqInsert( PriorityQ *pq, PQkey key );
100 PQkey pqExtractMin( PriorityQ *pq );
|
| H A D | priorityq.c | 50 PriorityQ *pqNewPriorityQ( int (*leq)(PQkey key1, PQkey key2) )
89 #define Swap(a,b) do{PQkey *tmp = *a; *a = *b; *b = tmp;}while(0)
94 PQkey **p, **r, **i, **j, *piv;
95 struct { PQkey **p, **r; } Stack[50], *top = Stack;
174 PQhandle pqInsert( PriorityQ *pq, PQkey keyNew )
183 PQkey *saveKey= pq->keys;
203 PQkey pqExtractMin( PriorityQ *pq )
205 PQkey sortMin, heapMin;
224 PQkey pqMinimu
[all...] |
| H A D | priorityq-heap.c | 58 PriorityQ *pqNewPriorityQ( int (*leq)(PQkey key1, PQkey key2) )
163 PQhandle pqInsert( PriorityQ *pq, PQkey keyNew )
211 PQkey pqExtractMin( PriorityQ *pq )
216 PQkey min = h[hMin].key;
|
| H A D | sweep.c | 1251 pq = tess->pq = pqNewPriorityQ( (int (*)(PQkey, PQkey)) __gl_vertLeq );
|
Completed in 5 milliseconds