선형 테이블 - 체인식 저장 구조의 단일 체인 테이블

#ifndef LINKLIST_H
#define LINKLIST_H

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

template <typename ElemType>
class Node {
public:
    Node() : data(ElemType()), next(NULL) {}
    Node(const ElemType &_data) : data(_data), next(NULL) {}
    Node(const ElemType &_data, Node<ElemType> *_next) : data(_data), next(_next) {}
    ~Node() {}
public:
    ElemType data;
    Node<ElemType> *next;
};

template <typename ElemType>
class SingleList {
public:
    SingleList() : count(0) {
        if((head_node = new Node<ElemType>) == NULL)
            return;
        head_node->data = 0;
        head_node->next = NULL;
    }

    ~SingleList() {
        if (count != 0) {
            ClearList();
        }
        if (head_node)
        {
            delete head_node;
            head_node = NULL;
        }
    }
public:
    void InitList() {
        count = 0;
        head_node->data = 0;
        head_node->next = NULL;
    }

    bool ListEmpty() {
        return count == 0;
    }

    void ClearList() {
        Node<ElemType> *p, *q;
        p = head_node->next;
        while (p) {
            q = p->next;
            delete p;
            p = q;
        }

        head_node->next = NULL;
        count = 0;
    }

    void GetElem(uint32_t i, ElemType *e) {
        if ((i < 1) || (i > count)) {
            fprintf(stderr, "Out of list!
");
            return;
        } else {
            Node<ElemType> *p = head_node;
            for (int j = 0; j < i; ++j) {
                p = p->next;
            }
            *e = p->data;
        }
    }

    uint32_t LocateElem(ElemType e) {
        Node<ElemType> *p = head_node->next;
        for (int i = 1; i <= count; ++i) {
            if ((p != NULL) && (p->data == e)) {
                return i;
            }
            p = p->next;
        }

        fprintf(stderr, "Not in this list
");
        return -1;
    }

    void ListInsert(uint32_t i, ElemType *e) {
        if ((i < 1) || (i > count+1)) {
            fprintf(stderr, "Out of the list
");
            return;
        } else {
            Node<ElemType> *p = head_node;
            Node<ElemType> *q = new Node<ElemType>;
            q->data = *e;
            for (int j = 1; j < i; ++j) {
                p = p->next;
            }
            q->next = p->next;
            p->next = q;
        }
        ++count;
    }

    void ListDelete(uint32_t i, ElemType *e) {
        if ((i < 1) || (i > count+1)) {
            fprintf(stderr, "Out of the list
");
            return;
        }
        Node<ElemType> *p, *q;
        p = head_node;

        for (uint32_t j = 0; j < i; ++j) {
            q = p;
            p = p->next;
        }
        q->next = p->next;

        *e = p->data;
        --count;

        delete p;
    }

    uint32_t ListLength(void) {
        return count;
    }
private:
    int count;
    Node<ElemType> *head_node;
};

#endif