1 /* 2 ** License Applicability. Except to the extent portions of this file are 3 ** made subject to an alternative license as permitted in the SGI Free 4 ** Software License B, Version 1.1 (the "License"), the contents of this 5 ** file are subject only to the provisions of the License. You may not use 6 ** this file except in compliance with the License. You may obtain a copy 7 ** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600 8 ** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at: 9 ** 10 ** http://oss.sgi.com/projects/FreeB 11 ** 12 ** Note that, as provided in the License, the Software is distributed on an 13 ** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS 14 ** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND 15 ** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A 16 ** PARTICULAR PURPOSE, AND NON-INFRINGEMENT. 17 ** 18 ** Original Code. The Original Code is: OpenGL Sample Implementation, 19 ** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics, 20 ** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc. 21 ** Copyright in any portions created by third parties is as indicated 22 ** elsewhere herein. All Rights Reserved. 23 ** 24 ** Additional Notice Provisions: The application programming interfaces 25 ** established by SGI in conjunction with the Original Code are The 26 ** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released 27 ** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version 28 ** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X 29 ** Window System(R) (Version 1.3), released October 19, 1998. This software 30 ** was created using the OpenGL(R) version 1.2.1 Sample Implementation 31 ** published by SGI, but has not been independently verified as being 32 ** compliant with the OpenGL(R) version 1.2.1 Specification. 33 ** 34 */ 35 /* 36 ** Author: Eric Veach, July 1994. 37 ** 38 ** $Date$ $Revision$ 39 ** $Header: //depot/main/gfx/lib/glu/libtess/priorityq.h#5 $ 40 */ 41 42 #ifndef __priorityq_sort_h_ 43 #define __priorityq_sort_h_ 44 45 #include "priorityq-heap.h" 46 47 #undef PQkey 48 #undef PQhandle 49 #undef PriorityQ 50 #undef pqNewPriorityQ 51 #undef pqDeletePriorityQ 52 #undef pqInit 53 #undef pqInsert 54 #undef pqMinimum 55 #undef pqExtractMin 56 #undef pqDelete 57 #undef pqIsEmpty 58 59 /* Use #define's so that another heap implementation can use this one */ 60 61 #define PQkey PQSortKey 62 #define PQhandle PQSortHandle 63 #define PriorityQ PriorityQSort 64 65 #define pqNewPriorityQ(leq) __gl_pqSortNewPriorityQ(leq) 66 #define pqDeletePriorityQ(pq) __gl_pqSortDeletePriorityQ(pq) 67 68 /* The basic operations are insertion of a new key (pqInsert), 69 * and examination/extraction of a key whose value is minimum 70 * (pqMinimum/pqExtractMin). Deletion is also allowed (pqDelete); 71 * for this purpose pqInsert returns a "handle" which is supplied 72 * as the argument. 73 * 74 * An initial heap may be created efficiently by calling pqInsert 75 * repeatedly, then calling pqInit. In any case pqInit must be called 76 * before any operations other than pqInsert are used. 77 * 78 * If the heap is empty, pqMinimum/pqExtractMin will return a NULL key. 79 * This may also be tested with pqIsEmpty. 80 */ 81 #define pqInit(pq) __gl_pqSortInit(pq) 82 #define pqInsert(pq,key) __gl_pqSortInsert(pq,key) 83 #define pqMinimum(pq) __gl_pqSortMinimum(pq) 84 #define pqExtractMin(pq) __gl_pqSortExtractMin(pq) 85 #define pqDelete(pq,handle) __gl_pqSortDelete(pq,handle) 86 #define pqIsEmpty(pq) __gl_pqSortIsEmpty(pq) 87 88 89 /* Since we support deletion the data structure is a little more 90 * complicated than an ordinary heap. "nodes" is the heap itself; 91 * active nodes are stored in the range 1..pq->size. When the 92 * heap exceeds its allocated size (pq->max), its size doubles. 93 * The children of node i are nodes 2i and 2i+1. 94 * 95 * Each node stores an index into an array "handles". Each handle 96 * stores a key, plus a pointer back to the node which currently 97 * represents that key (ie. nodes[handles[i].node].handle == i). 98 */ 99 100 typedef PQHeapKey PQkey; 101 typedef PQHeapHandle PQhandle; 102 typedef struct PriorityQ PriorityQ; 103 104 struct PriorityQ { 105 PriorityQHeap *heap; 106 PQkey *keys; 107 PQkey **order; 108 PQhandle size, max; 109 int initialized; 110 int (*leq)(PQkey key1, PQkey key2); 111 }; 112 113 PriorityQ *pqNewPriorityQ( int (*leq)(PQkey key1, PQkey key2) ); 114 void pqDeletePriorityQ( PriorityQ *pq ); 115 116 int pqInit( PriorityQ *pq ); 117 PQhandle pqInsert( PriorityQ *pq, PQkey key ); 118 PQkey pqExtractMin( PriorityQ *pq ); 119 void pqDelete( PriorityQ *pq, PQhandle handle ); 120 121 PQkey pqMinimum( PriorityQ *pq ); 122 int pqIsEmpty( PriorityQ *pq ); 123 124 #endif 125
