1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
|
/*
* ccache_list.h -- definitions for CS 2270 linked list package
*
* Mark Peterson 9/91
*
* $Id: ccache_list.h,v 1.1 1999/11/03 21:40:57 golda Exp $
*
* ----------------------------------------------------------------------
* Copyright (c) 1994, 1995. All rights reserved.
*
* Mic Bowman of Transarc Corporation.
* Peter Danzig of the University of Southern California.
* Darren R. Hardy of the University of Colorado at Boulder.
* Udi Manber of the University of Arizona.
* Michael F. Schwartz of the University of Colorado at Boulder.
*
*/
#ifndef _CCACHE_LIST_H_
#define _CCACHE_LIST_H_
typedef struct list_node { /*list node type */
struct list_node *next; /*points to the following node */
struct list_node *previous; /*points to the previous node */
Datum *data; /*stores data record in list */
} List_Node;
typedef struct { /*list header node */
List_Node *first; /*points to the first node */
List_Node *last; /*points to the last node */
unsigned int count;
/*keeps count of the number of nodes in list */
int (*compare) (); /*A compare function */
} Linked_List;
/*
**The list toolkit functions:
*/
Linked_List *list_create(); /*initialize list header block */
void list_destroy(); /*destroy list header block */
List_Node *list_insert(); /*insert a new node in the list */
Datum *list_delete(); /*delete a node from the list */
List_Node *list_find(); /*find a node in the list */
Boolean list_apply(); /*apply a function to each node in the list */
/*Built in Macros */
#define list_first(head) ((head)->first) /*find the first node in the list */
#define list_next(node) ((node)->next) /*find the next node in the list */
#define list_last(head) ((head)->last) /*find the last node in the list */
#define list_previous(node) ((node)->previous)
/*find the previous node in the list */
#define list_getdata(node) ((node)->data) /*get the data from the list */
void list_putdata(); /*modify the data in the node in the list */
#define list_length(head) ((head)->count) /*find the length of the list */
#endif
|
