SequenceList.c

#include <stdio.h>
#include "SequenceList.h"

int main()
{
    int ret;
    List list;
    int i, p;
    DataType e;

    ret = InitSequence(&list);
    if (SUCCESS == ret)
    {
        printf("InitSuccess!\n");
    }
    else
    {
        printf("InitFailure!\n");
    }


    ret = EmptySequence(list);
    if(SUCCESS == ret)
    {
        printf("SequenceEmpty!\n");
    }
    else
    {
        printf("Sequence notEmpty\n");
    }


    for(i = 0; i < 5; i++)
    {
        ret = InsertSequence(&list, i+ 1, i + 1);
        if(FAILURE == ret)
        {
            printf("Insert %dFailure!\n",i + 1);
        }
        else
        {
            printf("Insert %dSUCCESS!\n",i + 1);
        }
    }

    ret = TraverseSequence(list);
    if(SUCCESS == ret)
    {
        printf("TraverseSuccess!\n");
    }
    else
    {
        printf("TraverseFailure!\n");
    }

    p = 3;
    ret = GetElem(list, p, &e);
    if(SUCCESS == ret)
    {
        printf("The %dth is%d\n",p ,e);
    }
    else
    {
        printf("The %dth is notexist!");
    }

    printf("The Sequence Length is%d\n",LengthSequence(list));

    e = 3;
    ret = LocateSequence(list ,e);
    if(FAILURE == ret)
    {
        printf("The Element %d is'texist \n",e);
    }
    else
    {
        printf("Element %d is%dth!\n", e, ret);
    }
    for(i = 0; i < 3; i++)
    {
        ret = DeleteSequence(&list, 1,&e);
        if(SUCCESS == ret)
        {
            printf("Delete %dSuccess!\n",e);
        }
        else
        {
            printf("DeleteFailure!\n");
        }
    }


    ret = TraverseSequence(list);
    if(SUCCESS == ret)
    {
        printf("TraverseSuccess!\n");
    }
    else
    {
        printf("TraverseFailure!\n");
    }


    ret = ClearSequence(&list);
    if(FAILURE == ret)
    {
        printf("ClearFailure!\n");
    }
    else
    {
        printf("ClearSuccess!\n");
    }

    ret = DestorySequence(&list);
    if(FAILURE == ret)
    {
        printf("DestoryFailure!\n");
    }
    else
    {
        printf("DestorySuccess!\n");
    }

    return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值