• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
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/dict.h#5 $
40 */
41 
42 #ifndef __dict_list_h_
43 #define __dict_list_h_
44 
45 #include <sk_glu.h>
46 
47 /* Use #define's so that another heap implementation can use this one */
48 
49 #define DictKey		DictListKey
50 #define Dict		DictList
51 #define DictNode	DictListNode
52 
53 #define dictNewDict(frame,leq)		__gl_dictListNewDict(frame,leq)
54 #define dictDeleteDict(dict)		__gl_dictListDeleteDict(dict)
55 
56 #define dictSearch(dict,key)		__gl_dictListSearch(dict,key)
57 #define dictInsert(dict,key)		__gl_dictListInsert(dict,key)
58 #define dictInsertBefore(dict,node,key)	__gl_dictListInsertBefore(dict,node,key)
59 #define dictDelete(dict,node)		__gl_dictListDelete(dict,node)
60 
61 #define dictKey(n)			__gl_dictListKey(n)
62 #define dictSucc(n)			__gl_dictListSucc(n)
63 #define dictPred(n)			__gl_dictListPred(n)
64 #define dictMin(d)			__gl_dictListMin(d)
65 #define dictMax(d)			__gl_dictListMax(d)
66 
67 
68 
69 typedef void *DictKey;
70 typedef struct Dict Dict;
71 typedef struct DictNode DictNode;
72 
73 Dict		*dictNewDict(
74 			void *frame,
75 			int (*leq)(void *frame, DictKey key1, DictKey key2) );
76 
77 void		dictDeleteDict( Dict *dict );
78 
79 /* Search returns the node with the smallest key greater than or equal
80  * to the given key.  If there is no such key, returns a node whose
81  * key is NULL.  Similarly, Succ(Max(d)) has a NULL key, etc.
82  */
83 DictNode	*dictSearch( Dict *dict, DictKey key );
84 DictNode	*dictInsertBefore( Dict *dict, DictNode *node, DictKey key );
85 void		dictDelete( Dict *dict, DictNode *node );
86 
87 #define		__gl_dictListKey(n)	((n)->key)
88 #define		__gl_dictListSucc(n)	((n)->next)
89 #define		__gl_dictListPred(n)	((n)->prev)
90 #define		__gl_dictListMin(d)	((d)->head.next)
91 #define		__gl_dictListMax(d)	((d)->head.prev)
92 #define	       __gl_dictListInsert(d,k) (dictInsertBefore((d),&(d)->head,(k)))
93 
94 
95 /*** Private data structures ***/
96 
97 struct DictNode {
98   DictKey	key;
99   DictNode	*next;
100   DictNode	*prev;
101 };
102 
103 struct Dict {
104   DictNode	head;
105   void		*frame;
106   int		(*leq)(void *frame, DictKey key1, DictKey key2);
107 };
108 
109 #endif
110