C 实现简单list

最新推荐文章于 2024-09-06 13:50:31 发布

w22net

最新推荐文章于 2024-09-06 13:50:31 发布

阅读量360

点赞数

分类专栏： C

本文链接：https://blog.csdn.net/w22net/article/details/79114997

版权

C 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

/* list.h - */

/*
modification history
--------------------

01a 19jan18 zj added this head
*/

/*
DESCRIPTION

NULL.
*/
#ifndef __list_H__
#define __list_H__

#include "PDAtype.h"

#ifdef __cplusplus
extern "C" {
#endif

/*
typedef struct //structCard
{
  int CardNum; //short int CardNum;
  short int Count;
  // unsigned char BatAlarm;
  // unsigned char Emergency;
  union
  {
   struct
   {
    unsigned int BatAlarm : 1;     //LSB
    unsigned int Emergency : 1;
    unsigned int : 1;
    unsigned int : 1;    // CTCSSMode

    unsigned int : 1; //MSB
   } Bits;
   unsigned int StausValue;
  } CardStaus;

//char VehicleNum[10];

}TCard;
*/
#define MAX_LIST_LEN 300
typedef struct //structCard
{
int length; //
TCard arrayCard[MAX_LIST_LEN];

}TCardList;

TCard listNodeAt(int index);
TCard listGetMin();
TCard listGetMax();

#ifdef __cplusplus
}
#endif

#endif

/* list.c - */

/*
modification history
--------------------

01a 19jan18 zj added this head
*/

/*
DESCRIPTION

NULL.
*/
#include "PDAtype.h"
#include "list.h"
#include <stdio.h>

TCardList cardList;

void listInit()
{
int i;
cardList.length = 0;
for (i = 0; i < MAX_LIST_LEN; i++) {

  cardList.arrayCard[i].CardNum = 0;
  cardList.arrayCard[i].Count = 0;
  cardList.arrayCard[i].CardStaus.StausValue = 0;


}
}

void listAdd(TCard card)
{
if(cardList.length>=MAX_LIST_LEN){
cardList.length=0;
}

cardList.arrayCard[cardList.length++] = card;
}

int listIndexOf(TCard card)
{
int i;
for (i = 0; i < cardList.length; i++) {

  if (cardList.arrayCard[i].CardNum == card.CardNum)
  {
   return i;
  }
}
return -1;
}

void listInsert(int index, TCard card)
{
int i;
for (i = cardList.length - 1; i > index - 1; i--) {
cardList.arrayCard[i + 1] = cardList.arrayCard[i];

}
cardList.arrayCard[index] = card;
cardList.length++;
}

void listUpdate(int index, TCard card)
{

if (index < cardList.length) {
cardList.arrayCard[index] = card;
}

}

TCard listNodeAt(int index)
{

return cardList.arrayCard[index];

}

TCard listGetMax()
{
int i;
TCard cardMax;

cardMax = cardList.arrayCard[0];

for (i = 1; i < cardList.length; i++) {

  if (cardList.arrayCard[i].CardNum > cardMax.CardNum)
  {
   cardMax = cardList.arrayCard[i];
  }
}
return cardMax;

}

TCard listGetMin()
{
int i;
TCard cardMin;

cardMin = cardList.arrayCard[0];

for (i = 1; i < cardList.length; i++) {

  if (cardList.arrayCard[i].CardNum < cardMin.CardNum)
  {
   cardMin = cardList.arrayCard[i];
  }
}
return cardMin;

}

int listLength()
{

return cardList.length;

}

void listRemove(TCard card)
{
int indexOfRm;
int i;

indexOfRm = listIndexOf(card);

if (indexOfRm > 0) {
for (i = indexOfRm + 1; i < cardList.length; i++) {
cardList.arrayCard[i - 1] = cardList.arrayCard[i];

}
cardList.length--;
}

}

void listRemoveAll()
{
listInit();

}

void listPrint()
{
int i;
printf("cardList.length %d\r\n", cardList.length);
for (i = 0; i < cardList.length; i++)
{
printf("[%d]%d ", i, cardList.arrayCard[i].CardNum);
}
printf("\r\n");

}

void listMake()

{
TCard card;
int i;

card.CardNum = 3;
listRemoveAll();
for (i = 0; i < 30; i++)
{
  card.CardNum = 1+i;
  card.Count = 5;
  card.CardStaus.Bits.BatAlarm = 1;
  listAdd(card);
}

listPrint();

}

void listTest()
{
TCard card1, card2, card3;
TCard card4, card5, card6;

card1.CardNum = 3;
card2.CardNum = 7;
card3.CardNum = 8;

card4.CardNum = 71;
card5.CardNum = 82;
card6.CardNum = 85;

listAdd(card1);

listPrint();

listAdd(card2);
listAdd(card3);
listPrint();

listRemove(card2);

listPrint();

listInsert(1, card4);
listPrint();

listAdd(card5);
listAdd(card6);
listPrint();

printf("listIndexOf %d %d\r\n",card5.CardNum,listIndexOf(card5));

listRemoveAll();
listPrint();

listAdd(card6);
listPrint();

}