c_kitap

C ve Sistem Programcıları Derneği - C Ders Notları - Necati Ergin
Aşağıdaki programda bir tekli bağlı liste oluşturuluyor.
/********** datelist.h **************************/
#include "date.h"
typedef struct tagNode {
Date date;
struct tagNode *pnext;
}Node;
typedef struct {
Node *pstart;
Node *pend;
size_t size;
}*ListHandle;
ListHandle openlist(void);
void closelist(ListHandle);
void push_front(ListHandle handle);
void push_back(ListHandle handle);
void display_list(ListHandle handle);
void pop_front(ListHandle handle);
void pop_back(ListHandle handle);
void remove_date(const Date *);
void clear_list(ListHandle handle);
size_t get_size(ListHandle handle);
/********** datelist.c **************************/
PRIVATE Node *create_node(void);
PRIVATE void free_nodes(Node *p);
/*************************************************************************/
PRIVATE void free_nodes(Node *p)
{
Node *temp;
while (p) {
temp = p;
p = p->pnext;
free(temp);
}
}
/*************************************************************************/
PRIVATE Node *create_node(void)
{
Node *pd = (Node *)malloc(sizeof(Node));
if (!pd) {
printf("cannot allocate memory!\n");
exit(EXIT_FAILURE);
}
return pd;
}
/*************************************************************************/
PUBLIC ListHandle openlist(void)
{
ListHandle pd = (ListHandle)malloc(sizeof(*pd));
if (!pd) {
printf("cannot allocate memory!\n");
exit(EXIT_FAILURE);
}
pd->pstart = pd->pend = NULL;
pd->size = 0;
407