Searched refs:pqInsert (Results 1 - 6 of 6) sorted by relevance

/xsrc/external/mit/glu/dist/src/libtess/
H A Dpriorityq-sort.h46 #undef pqInsert
61 /* The basic operations are insertion of a new key (pqInsert),
64 * for this purpose pqInsert returns a "handle" which is supplied
67 * An initial heap may be created efficiently by calling pqInsert
69 * before any operations other than pqInsert are used.
75 #define pqInsert(pq,key) __gl_pqSortInsert(pq,key) macro
110 PQhandle pqInsert( PriorityQ *pq, PQkey key );
H A Dpriorityq.h46 #undef pqInsert
61 /* The basic operations are insertion of a new key (pqInsert),
64 * for this purpose pqInsert returns a "handle" which is supplied
67 * An initial heap may be created efficiently by calling pqInsert
69 * before any operations other than pqInsert are used.
75 #define pqInsert(pq,key) __gl_pqSortInsert(pq,key) macro
110 PQhandle pqInsert( PriorityQ *pq, PQkey key );
H A Dpriorityq-heap.h47 /* The basic operations are insertion of a new key (pqInsert),
50 * for this purpose pqInsert returns a "handle" which is supplied
53 * An initial heap may be created efficiently by calling pqInsert
55 * before any operations other than pqInsert are used.
61 #define pqInsert(pq,key) __gl_pqHeapInsert(pq,key) macro
99 PQhandle pqInsert( PriorityQ *pq, PQkey key );
H A Dpriorityq-heap.c163 PQhandle pqInsert( PriorityQ *pq, PQkey keyNew ) function in typeref:typename:PQhandle
H A Dpriorityq.c174 PQhandle pqInsert( PriorityQ *pq, PQkey keyNew ) function in typeref:typename:PQhandle
H A Dsweep.c755 eUp->Org->pqHandle = pqInsert( tess->pq, eUp->Org ); /* __gl_pqSortInsert */
1256 v->pqHandle = pqInsert( pq, v ); /* __gl_pqSortInsert */

Completed in 8 milliseconds