src/hd/sm_list.h

/* Copyright (c) 1998 Silicon Graphics, Inc. */

/* SCCSid "$SunId$ SGI" */

/*
 *  list.h
 *  Linked list data structure and routines 
 */

#ifndef TRUE
#define TRUE 1
#define FALSE 0
#endif

typedef struct _LIST {
    int d;
    struct _LIST *next;
}LIST;


#define LIST_NEXT(l) ((l)->next)
#define LIST_DATA(l) ((l)->d)
#define SET_LIST_NEXT(l,d) ((l)->next = (d))
#define SET_LIST_DATA(l,id) ((l)->d = (int)(id))
/*
LIST *new_list(void);
LIST *free_list(LIST *l);
LIST *append_list(LIST *a, LIST *b);
LIST *push_data(LIST *l,int d);
int pop_data(LIST **l);
LIST *add_data_to_circular_list(LIST *l,LIST **end,int d)
int remove_from_list(int d,LIST **list)
*/
LIST *new_list();
LIST *free_list();
LIST *append_list();
LIST *push_data();
int  pop_data();
LIST *add_data_to_circular_list();
int remove_from_list();
LIST *add_data();


Revision:	3.3
Committed:	Mon Dec 28 18:07:35 1998 UTC (25 years, 4 months ago) by gwlarson
Content type:	text/plain
Branch:	MAIN
Changes since 3.2:	+1 -1 lines
Log Message:	New insertion routine New Culling routine based on insertion algorithm Adapted old insertion code: now used by picking Point location code returns on-vertex,on-edge, or in-triangle Added on_edge case for subdivision Implemented unordered sets Removed deletion from quadtree- added set compression to replace functionality
#	User	Rev	Content
1	gwlarson	3.1	/* Copyright (c) 1998 Silicon Graphics, Inc. */
2
3			/* SCCSid "$SunId$ SGI" */
4
5			/*
6			* list.h
7			* Linked list data structure and routines
8			*/
9
10			#ifndef TRUE
11			#define TRUE 1
12			#define FALSE 0
13			#endif
14
15			typedef struct _LIST {
16			int d;
17			struct _LIST *next;
18			}LIST;
19
20
21			#define LIST_NEXT(l) ((l)->next)
22			#define LIST_DATA(l) ((l)->d)
23			#define SET_LIST_NEXT(l,d) ((l)->next = (d))
24			#define SET_LIST_DATA(l,id) ((l)->d = (int)(id))
25			/*
26			LIST *new_list(void);
27			LIST free_list(LIST l);
28			LIST append_list(LIST a, LIST *b);
29			LIST push_data(LIST l,int d);
30			int pop_data(LIST **l);
31			LIST add_data_to_circular_list(LIST l,LIST **end,int d)
32			int remove_from_list(int d,LIST **list)
33			*/
34			LIST *new_list();
35			LIST *free_list();
36			LIST *append_list();
37			LIST *push_data();
38			int pop_data();
39			LIST *add_data_to_circular_list();
40			int remove_from_list();
41	gwlarson	3.3	LIST *add_data();
42	gwlarson	3.1
43
44
45