列表实现例子

#ifndef LIST_H_
#define LIST_H_

#include <stdbool.h>
#define TSIZE 45

typedef struct film
{
    char title[TSIZE];
    int rating;
} Item;

typedef struct node
{
    Item item;
    struct node * next;
} Node;

typedef Node * List;

void InitializeList(List * plist);

bool ListIsEmpty(const List * plist);

bool ListIsFull(const List * plist);

unsigned int ListItemCount(const List * plist);

bool AddItem(Item item, List * plist);

void Traverse(const List * plist, void (* pfun)(Item item));

void EmptyTheList(List * plist);

#endif

 

 

#include <stdio.h>
#include <stdlib.h>
#include "list.h"

void showmovie(Item item)
{
    printf("Movie: %s, rating: %d\n", item.title, item.rating);
}

int main(void)
{
    List movies;
    Item temp;

    InitializeList(&movies);

    if(ListIsFull(&movies))
    {
        fprintf(stderr, "Memory allocating failed!\n");
        exit(1);
    }

    printf("Enter first movie title: ");
    while(NULL != gets(temp.title) && '\0' != temp.title[0])
    {
        printf("your rating: ");
        scanf("%d", &temp.rating);
        while('\n' != getchar())
            continue;

        if(false == AddItem(temp, &movies))
        {
            fprintf(stderr, "Add item error!\n");
            break;
        }
        if(ListIsFull(&movies))
        {
            printf("List is full!\n");
            break;
        }
        printf("Enter next movie title: ");
    }

    if(ListIsEmpty(&movies))
        printf("No data entered!\n");
    else
    {
        printf("Here is the movies list:\n");
        Traverse(&movies, showmovie);
    }
    printf("You have enter %d movies!\n", ListItemCount(&movies));

    EmptyTheList(&movies);
    printf("Bye!\n");

    return 0;
}

 

 

#include <stdio.h>
#include <malloc.h>
#include "list.h"

void CopyToNode(Item item, Node * pnode)
{
    pnode->item = item;
}

void InitializeList(List * plist)
{
    *plist = NULL;
}

bool ListIsEmpty(const List * plist)
{
    if(NULL == *plist)
        return true;
    else
        return false;
}

bool ListIsFull(const List * plist)
{
    Node * pn = (Node *)malloc(sizeof(Node));
    bool full;

    if(NULL == pn)
        full = true;
    else
        full = false;
    free(pn);

    return full;
}

unsigned int ListItemCount(const List * plist)
{
    unsigned int count = 0;
    Node * pn = *plist;

    while(NULL != pn)
    {
        count++;
        pn = pn->next;
    }

    return count;
}

bool AddItem(Item item, List * plist)
{
    Node * pnew, * pdest = *plist;
    pnew = (Node *)malloc(sizeof(Node));

    if(NULL == pnew)
        return false;

    CopyToNode(item, pnew);
    pnew->next = NULL;

    if(NULL == pdest)
    {
        *plist = pnew;
    }
    else
    {
        while(NULL != pdest->next)
            pdest = pdest->next;

        pdest->next = pnew;
    }

    return true;
}

void Traverse(const List * plist, void (* pfun)(Item item))
{
    Node * pn = *plist;
    while(NULL != pn)
    {
        (*pfun)(pn->item);
        pn = pn->next;
    }
}

void EmptyTheList(List * plist)
{
    Node * pn;
    while(NULL != *plist)
    {
        pn = (*plist)->next;
        free(*plist);
        *plist = pn;
    }
}