124 |
|
return(l); |
125 |
|
} |
126 |
|
|
127 |
– |
/* Pushes data element d at the top of the list- returns pointer |
128 |
– |
to new top of list |
129 |
– |
*/ |
130 |
– |
LIST |
131 |
– |
*push_data(l,d) |
132 |
– |
LIST *l; |
133 |
– |
int d; |
134 |
– |
{ |
135 |
– |
LIST * list; |
136 |
– |
|
137 |
– |
list = new_list(); |
138 |
– |
SET_LIST_DATA(list,d); |
139 |
– |
SET_LIST_NEXT(list,l); |
140 |
– |
return(list); |
141 |
– |
} |
127 |
|
|
128 |
+ |
|
129 |
|
/* frees the list */ |
130 |
|
LIST |
131 |
|
*free_list(l) |
139 |
|
return(NULL); |
140 |
|
} |
141 |
|
|
142 |
+ |
/* Pushes data element d at the top of the list- returns pointer |
143 |
+ |
to new top of list |
144 |
+ |
*/ |
145 |
+ |
LIST |
146 |
+ |
*push_data(l,d) |
147 |
+ |
LIST *l; |
148 |
+ |
int d; |
149 |
+ |
{ |
150 |
+ |
LIST *list; |
151 |
+ |
|
152 |
+ |
list = new_list(); |
153 |
+ |
SET_LIST_DATA(list,d); |
154 |
+ |
SET_LIST_NEXT(list,l); |
155 |
+ |
return(list); |
156 |
+ |
} |
157 |
|
/* Returns data element d at the top of the list- returns pointer |
158 |
|
to new top of list |
159 |
|
*/ |