堆栈——数组实现

#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>

typedef int Item;
typedef struct stack_type* Stack;

struct stack_type
{
    Item* contents;
    int top;
    int size;
};

static void terminate(const char* message);
Stack create(int size);
void destroy(Stack s);
void make_empty(Stack s);
bool is_empty(Stack s);
bool is_full(Stack s);
void push(Stack s, Item i);
Item pop(Stack s);

static void terminate(const char* message)
{
    printf("%s\n", message);
    exit(EXIT_FAILURE);
}

Stack create(int size)
{
    Stack s = malloc(sizeof(struct stack_type));
    if (s == NULL)
    {
        terminate("Error in create: stack could not be created.");
    }
    s->contents = malloc(size * sizeof(Item));
    if (s->contents == NULL)
    {
        free(s);
        terminate("Error in create: stack could not be created.");
    }
    s->top = 0;
    s->size = size;
    return s;
}

void destroy(Stack s)
{
    free(s->contents);
    free(s);
}

void make_empty(Stack s)
{
    s->top = 0;
}

bool is_empty(Stack s)
{
    if (s->top == 0)
    {
        return true;
    }
    else
    {
        return false;
    }
}

bool is_full(Stack s)
{
    if (s->top == s->size)
    {
        return true;
    }
    else
    {
        return false;
    }
}

void push(Stack s, Item i)
{
    if (is_full(s) == true)
    {
        terminate("Error in push: stack is full.");
    }
    s->contents[s->top] = i;
    s->top++;
}

Item pop(Stack s)
{
    if (is_empty(s) == true)
    {
        terminate("Error in pop: stack is empty.");
    }
    s->top--;
    return s->contents[s->top];
}