glants_mech/win32/glAntsV05/plist.cpp

   1 //
   2 // similar to plist.cpp, except uses
   3 //
   4
   5 // Note: the direction, trail stack is defined in bot.cpp
   6
   7 #include <stdio.h>
   8 #include <stdlib.h>
   9
  10 #include "plist.h"
  11
  12 int isempty(PtrList *list)
  13 {
  14
  15  if (list->head == NULL)
  16         return 1;               /* first pointer null, list is empty */
  17  else
  18         return 0;
  19
  20 } /* end of the fcuntion */
  21
  22 //
  23 // CreatePtrNode
  24 //
  25 PtrNode *CreatePtrNode(void *data) {
  26
  27     PtrNode *h = (PtrNode *) malloc(sizeof(PtrNode));
  28
  29     h->ptr = data;
  30     h->next = NULL;
  31
  32     return h;
  33
  34 } // end of the function
  35
  36 //
  37 // DestroyPtrNode
  38 //
  39 void DestroyPtrNode(PtrNode *node) {
  40
  41     free(node);
  42
  43 } // end of the functino
  44
  45 //
  46 // Create PtrList
  47 //
  48 PtrList *CreatePtrList() {
  49
  50     PtrList *result = (PtrList *) malloc(sizeof(PtrList));
  51
  52     result->head = NULL;
  53         result->items = 0;
  54
  55         return result;
  56
  57 } // end of the function
  58
  59
  60 //
  61 // DestroyPtrList
  62 //
  63 void DestroyPtrList(PtrList *list) {
  64
  65     PtrNode *pos, *next;
  66     pos = list->head;
  67
  68     while(pos != NULL) {
  69         next = pos->next;
  70
  71         free(pos);
  72
  73         pos = next;
  74     } // end of the while
  75
  76     free(list);
  77
  78 } // end of the function
  79
  80
  81 //
  82 // Delete Ptr
  83 //
  84 void DeletePtrNode(PtrList *list, void *val)
  85 {
  86     PtrNode *current = list->head;
  87     PtrNode *previous = NULL;
  88
  89     while (current != NULL ) {
  90
  91         if( current->ptr != val) {
  92
  93             previous = current;
  94             current = previous->next;
  95
  96         } else {
  97
  98             if (previous != NULL ) {
  99
 100                 previous->next = current->next;
 101
 102             } // end of the if
 103
 104                         list->items--;
 105
 106             free(current);
 107             break;
 108
 109         } // end of the if - else
 110
 111     } // end of the while
 112
 113 } // end of the function
 114
 115
 116 //
 117 // Insert Front
 118 void InsertFront(PtrList *list, void *data) {
 119
 120         PtrNode *new_node = NULL;
 121
 122         new_node = CreatePtrNode(data);
 123
 124         if (isempty(list))
 125
 126                 list->head = new_node;
 127
 128         else {
 129
 130                 new_node->next = list->head;
 131                 list->head = new_node;
 132
 133         } // end if
 134
 135         list->items++;
 136
 137 } // end of the function
 138
 139 //
 140 // Remove Front
 141 //
 142 void *RemoveFront(PtrList *list)
 143 {
 144
 145   PtrNode *temp_ptr = NULL;
 146   void *res = NULL;
 147
 148   if (isempty(list))
 149         return NULL;
 150   else {
 151         temp_ptr = list->head;
 152         if (list->head->next == NULL)
 153                 list->head = NULL; /* reset */
 154         else
 155                 list->head = list->head->next;
 156
 157         res = temp_ptr->ptr;    // remove from list, but keep ptr
 158
 159         free(temp_ptr);
 160         list->items--;
 161
 162         return res;
 163
 164   } // end of the if-else
 165
 166  return NULL;           // we should never get here
 167
 168 } // end of the function
 169
 170
 171 //
 172 // PrintTest
 173 //
 174 void PrintPtrList(PtrList *list)
 175 {
 176  PtrNode *current_ptr;
 177  int *x;
 178
 179  if (isempty(list))
 180         return;
 181
 182  current_ptr = list->head;
 183
 184  while(current_ptr != NULL)
 185  {
 186         // interesting
 187         x = (int *)current_ptr->ptr;
 188
 189         printf("<%d>\n", (int &)*x);
 190         current_ptr = current_ptr->next;
 191  } // end of while
 192
 193 } // end of the function
 194
 195 //
 196 // PrintList
 197 //
 198 void PrintPtrListf(PtrList *list)
 199 {
 200  PtrNode *current_ptr;
 201  float *x;
 202
 203  if (isempty(list))
 204         return;
 205
 206  current_ptr = list->head;
 207
 208  while(current_ptr != NULL)
 209  {
 210         // interesting
 211         x = (float *)current_ptr->ptr;
 212
 213         printf("<%0.2f>\n", (float &)*x);
 214         current_ptr = current_ptr->next;
 215  } // end of while
 216
 217 } // end of the function
 218
 219
 220 //
 221 // PtrListTest
 222 //
 223 void PtrLinkTest(void)
 224 {
 225         PtrList *list;
 226         int *x = (int *)malloc(sizeof(int));
 227         int *y = (int *)malloc(sizeof(int));
 228         int *z = (int *)malloc(sizeof(int));
 229         int *res;
 230
 231         *x = 9;
 232         *y = 3;
 233         *z = 4;
 234
 235         //list =  CreatePtrList();
 236         list = CREATE_STACK;
 237
 238         //InsertFront(list, (int *)x);
 239         PUSH_STACK(list, (int *)x);
 240         printf("%d PUSHED\n", *x);
 241
 242         //InsertFront(list, (int *)y);
 243         PUSH_STACK(list, (int *)y);
 244         printf("%d PUSHED\n", *y);
 245
 246         InsertFront(list, (int *)z);
 247         printf("%d PUSHED\n", *z);
 248
 249         //PrintPtrList(list);
 250
 251         // Delete a node pointer
 252         //DeletePtrNode(list, y);
 253         //res = (int *)RemoveFront(list);
 254         res = (int *)POP_STACK(list);
 255         printf("%d POPPED %d\n", *res, list->items);
 256
 257         res = (int *)RemoveFront(list);
 258         printf("%d POPPED %d\n", *res, list->items);
 259
 260         printf("\n\n New List %d\n", list->items);
 261         PrintPtrList(list);
 262
 263         InsertFront(list, (int *)y);
 264         printf("%d PUSHED %d\n", *y, list->items);
 265
 266         printf("\n\n New with Added\n");
 267         PrintPtrList(list);
 268
 269         DestroyPtrList(list);
 270
 271         free(x);
 272         free(y);
 273         free(z);
 274
 275 } // end of the function
 276
 277
 278
 279
 280