线性表实现——自动扩容实现

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

#define OK 1
#define ERROR 0

typedef struct {
    int x;
    int y;
}Point;

typedef struct {
    Point *pt;
    int length;
    int size;
}AutoArrList;

 //声明线性表所具有的方法
AutoArrList *CreateArrList(int nLength)      //创建长为 nArrLength 的线性表
{
    AutoArrList * l=(AutoArrList*)malloc(sizeof(AutoArrList));
    if (l == NULL)
        return NULL;
    Point * p= (Point*)calloc(nLength,sizeof(Point));
    if (p == NULL)
    {
        free(l);
        return NULL;
    }
        
    l->pt = p;
    l->length = 0;
    l->size = nLength;

    return l;
}
void DestroyArrList(AutoArrList *pArrList)    //销毁线性表 pArrList
{
    if (pArrList == NULL)
        return;
    free(pArrList->pt);
    free(pArrList);
    return;
}
void ClearArrList(AutoArrList *pArrList)      //置空线性表 pArrList
{
    //if (pArrList == NULL)
    //    return;
    //pArrList->pt = NULL;
    pArrList->length = 0;
    return;
}
int IsEmptyArrList(AutoArrList *pArrList)     //检测线性表是否为空
{
    if (pArrList->length == 0)
        return 1;
    return 0;
}
int GetArrListLength(AutoArrList *pArrList)   //获取线性表长度
{
    return pArrList->length;
}
int GetArrListSize(AutoArrList *pArrList)    //获取线性表总容量
{
    return pArrList->size;
}
int GetArrListElement(AutoArrList *pArrList, int n, Point *pt)  //获取线性表中第n个元素
{
    if ((pArrList->length == 0) || (n < 1) || (n > pArrList->length))
        return ERROR;
    pt->x = pArrList->pt[n - 1].x;
    pt->y = pArrList->pt[n - 1].y;

    return OK;
}
int FindElement(AutoArrList *pArrList, int nPos, Point *pt)      //从 nPos 起查找 pt 第一次出现的位置
{
    if ((pArrList->length == 0) || (nPos < 1) || (nPos > pArrList->length))
        return ERROR;
    int i;
    for (i = nPos - 1; i < pArrList->length; i++)
    {
        if ((pArrList->pt[i].x == pt->x) && (pArrList->pt[i].y == pt->y))
            return i + 1;
    }
    return ERROR;
}
int GetPriorElement(AutoArrList *pArrList, Point *pt, Point *prior_pt)   //获取 pt 的前驱节点到 prior_pt
{
    if (pArrList->length == 0)
        return ERROR;
    int i;
    for (i = 1; i < pArrList->length; i++)
    {
        if ((pArrList->pt[i].x == pt->x) && (pArrList->pt[i].y == pt->y))
        {
            prior_pt->x = pArrList->pt[i].x;
            prior_pt->y = pArrList->pt[i].y;
            return OK;
        }            
    }
    return ERROR;
}
int GetNextElement(AutoArrList *pArrList, Point *pt, Point *next_pt)    //获取 pt 的后继节点到 next_pt
{
    if (pArrList->length == 0)
        return ERROR;
    int i;
    for (i = 0; i < pArrList->length-1; i++)
    {
        if ((pArrList->pt[i].x == pt->x) && (pArrList->pt[i].y == pt->y))
        {
            next_pt->x = pArrList->pt[i].x;
            next_pt->y = pArrList->pt[i].y;
            return OK;
        }
    }
    return ERROR;
}
int AppendToArrList(AutoArrList *pArrList, Point *pt)           //将 pt 添加到线性表末尾处
{
    if (pArrList->length == pArrList->size)
    {
        Point *p = (Point *)calloc(pArrList->length * 2, sizeof(Point));
        memcpy(p, pArrList->pt, pArrList->length);
        pArrList->size = pArrList->length * 2;
        free(pArrList->pt);
        pArrList->pt = p;
    }
    pArrList->pt[pArrList->length].x = pt->x;
    pArrList->pt[pArrList->length].y = pt->y;
    pArrList->length++;
    return OK;
}
int InsertToArrList(AutoArrList *pArrList, int nPos, Point *pt) //将 pt 插入到 nPos 处
{
    int i;
    if ((pArrList->length == 0) || (nPos < 1) || (nPos > pArrList->length))
        return ERROR;
    if (pArrList->length == pArrList->size)
    {
        Point *p = (Point *)calloc(pArrList->length * 2, sizeof(Point));
        memcpy(p, pArrList->pt, pArrList->length);
        pArrList->size = pArrList->length * 2;
        free(pArrList->pt);
        pArrList->pt = p;
    }
    if (nPos <= pArrList->length)
    {
        for (i = pArrList->length; i > nPos - 1; i--)
        {
            pArrList->pt[i].x = pArrList->pt[i - 1].x;
            pArrList->pt[i].y = pArrList->pt[i - 1].y;
        }
    }
    pArrList->pt[nPos-1].x = pt->x;
    pArrList->pt[nPos-1].y = pt->y;
    pArrList->length++;
    return OK;
}
int DeleteFromArrList(AutoArrList *pArrList, int nPos)            //删除线性表上位置为 nPos 的元素
{
    int i;
    if ((pArrList->length == 0) || (nPos < 1) || (nPos > pArrList->length))
        return ERROR;
    if (nPos < pArrList->length)
    {
        for (i = nPos - 1; i < pArrList->length - 1; i++)
        {
            pArrList->pt[i].x = pArrList->pt[i + 1].x;
            pArrList->pt[i].y = pArrList->pt[i + 1].y;
        }
    }
    pArrList->length--;
    return OK;
}
void ForEachArrList(AutoArrList *pArrList, void(*func)(Point *pt))             //对线性表中每个元素执行 func 函数
{
    if (pArrList->length == 0)
        return ;
    int i;
    for (i = 0; i < pArrList->length; i++)
    {
        func(&pArrList->pt[i]);
    }
}
int ArrListCpy(AutoArrList *pArrListDest, AutoArrList *pArrListSrc)    //将线性表 pArrListSrc 复制到 pArrListDest
{
    if (pArrListSrc->length == 0)
        return ERROR;
    if (pArrListSrc->length > pArrListDest->size)
    {
        free(pArrListDest->pt);
        Point *p = (Point *)malloc(pArrListSrc->length *sizeof(Point));
        pArrListDest->pt = p;
        pArrListDest->size = pArrListSrc->length;
    }
    memcpy(pArrListDest->pt, pArrListSrc->pt, pArrListSrc->length * sizeof(Point));
    pArrListDest->length = pArrListSrc->length;
    return OK;
}
int ArrListCat(AutoArrList *pArrListDest, AutoArrList *pArrListSrc)    //将线性表 pArrListSrc 连接到 pArrListDest 的末尾
{
    if (pArrListSrc->length == 0)
        return OK;
    if (pArrListDest->size < (pArrListDest->length + pArrListSrc->length))
    {
        int len = pArrListDest->length + pArrListSrc->length;
        Point *p = (Point *)calloc(len ,sizeof(Point));
        memcpy(p, pArrListDest->pt, pArrListDest->length * sizeof(Point));
        free(pArrListDest->pt);
        pArrListDest->pt = p;
        pArrListDest->size = len;
    }
    memcpy(pArrListDest + pArrListDest->length, pArrListSrc->pt, pArrListSrc->length * sizeof(Point));
    pArrListDest->length += pArrListSrc->length;
    return OK;
}
void display(Point *pt)
{
       printf("(%d,%d) ", pt->x, pt->y);
}