lists.h

mpi 结合vc编程用模拟退火法算一个最小路径的值

#ifndef _LISTS_H_
#define _LISTS_H_

#include <stdlib.h>

typedef struct xpand_list_Strings_ {
  char **list;
  int nused;
  int size;
} xpand_list_Strings;

typedef struct xpand_list_Int_ {
  int *list;
  int nused;
  int size;
} xpand_list_Int;


typedef struct xpand_list_String_ {
  char *list;
  int nused;
  int size;
} xpand_list_String;

xpand_list_Strings *Strings_CreateList (int initialLen);

xpand_list_String *String_CreateList (int initialLen);

xpand_list_Int *Int_CreateList (int initialLen);

#define ListItem( listPtr, idx ) ( (listPtr)->list[(idx)] )

#define ListHeadPtr( listPtr ) ( (listPtr)->list )

#define ListDestroy( listPtr ) \
  {free( listPtr->list ); free( listPtr );}

#define ListSize( listPtr ) ( (listPtr)->nused )

#define ListClose( listPtr, headPtr, nitems ) { \
  headPtr = ListHeadPtr( listPtr ); \
  nitems = ListSize( listPtr ); \
  free( listPtr ); \
}

#define ListClear( listPtr ) {(listPtr)->nused=0;}

int String_AddItem(xpand_list_String *listPtr, char newItem);
int Int_AddItem(xpand_list_Int *listPtr, int newItem);
int Strings_AddItem(xpand_list_Strings *listPtr, char *newItem);

#endif
/* _LISTS_H_ */