guicast/arraylist.h

   1 #ifndef ARRAYLIST_H
   2 #define ARRAYLIST_H
   3
   4 #include <stdio.h>
   5
   6 // designed for lists of track numbers
   7
   8 #include <stdio.h>
   9
  10
  11 template<class TYPE>
  12 class ArrayList
  13 {
  14 public:
  15         ArrayList();
  16         virtual ~ArrayList();
  17
  18         TYPE append(TYPE value);
  19         TYPE append();
  20         TYPE insert(TYPE value, int number);
  21
  22 // allocate
  23         void allocate(int total);
  24 // remove last pointer from end
  25         void remove();
  26 // remove last pointer and object from end
  27         void remove_object();
  28 // remove pointer to object from list
  29         void remove(TYPE value);
  30 // remove object and pointer to it from list
  31         void remove_object(TYPE value);
  32 // remove object and pointer to it from list
  33         void remove_object_number(int number);
  34 // remove pointer to item numbered
  35         void remove_number(int number);
  36 // Return number of first object matching argument
  37         int number_of(TYPE object);
  38         void remove_all();
  39 // Remove pointer and objects for each array entry
  40         void remove_all_objects();
  41         TYPE last();
  42         void set_array_delete();
  43
  44         void sort();
  45
  46         TYPE* values;
  47         int total;
  48
  49 private:
  50         int available;
  51         int array_delete;
  52 };
  53
  54 template<class TYPE>
  55 ArrayList<TYPE>::ArrayList()
  56 {
  57         total = 0;
  58         available = 16;
  59         array_delete = 0;
  60         values = new TYPE[available];
  61 }
  62
  63
  64 template<class TYPE>
  65 ArrayList<TYPE>::~ArrayList()
  66 {
  67 // Just remove the pointer
  68         delete [] values;
  69         values = 0;
  70 }
  71
  72 template<class TYPE>
  73 void ArrayList<TYPE>::set_array_delete()
  74 {
  75     array_delete = 1;
  76 }
  77
  78
  79 template<class TYPE>
  80 void ArrayList<TYPE>::allocate(int total)
  81 {
  82         if(total > available)
  83         {
  84                 available = total;
  85                 TYPE* newvalues = new TYPE[available];
  86                 for(int i = 0; i < total; i++) newvalues[i] = values[i];
  87                 delete [] values;
  88                 values = newvalues;
  89         }
  90 }
  91
  92 template<class TYPE>
  93 TYPE ArrayList<TYPE>::append(TYPE value)            // add to end of list
  94 {
  95         if(total + 1 > available)
  96         {
  97                 available *= 2;
  98                 TYPE* newvalues = new TYPE[available];
  99                 for(int i = 0; i < total; i++) newvalues[i] = values[i];
 100                 delete [] values;
 101                 values = newvalues;
 102         }
 103
 104         values[total++] = value;
 105         return value;
 106 }
 107
 108 template<class TYPE>
 109 TYPE ArrayList<TYPE>::append()            // add to end of list
 110 {
 111         if(total + 1 > available)
 112         {
 113                 available *= 2;
 114                 TYPE* newvalues = new TYPE[available];
 115                 for(int i = 0; i < total; i++) newvalues[i] = values[i];
 116                 delete [] values;
 117                 values = newvalues;
 118         }
 119         total++;
 120
 121         return values[total - 1];
 122 }
 123
 124 template<class TYPE>
 125 TYPE ArrayList<TYPE>::insert(TYPE value, int number)
 126 {
 127         append(0);
 128         for(int i = total - 1; i > number; i--)
 129         {
 130                 values[i] = values[i - 1];
 131         }
 132         values[number] = value;
 133 }
 134
 135 template<class TYPE>
 136 void ArrayList<TYPE>::remove(TYPE value)                   // remove value from anywhere in list
 137 {
 138         int in, out;
 139
 140         for(in = 0, out = 0; in < total;)
 141         {
 142                 if(values[in] != value) values[out++] = values[in++];
 143                 else
 144                 {
 145                         in++;
 146                 }
 147         }
 148         total = out;
 149 }
 150
 151 template<class TYPE>
 152 TYPE ArrayList<TYPE>::last()                   // last element in list
 153 {
 154         return values[total - 1];
 155 }
 156
 157
 158
 159 template<class TYPE>
 160 void ArrayList<TYPE>::remove_object(TYPE value)                   // remove value from anywhere in list
 161 {
 162         remove(value);
 163         if (array_delete)
 164                 delete [] value;
 165         else
 166                 delete value;
 167 }
 168
 169 template<class TYPE>
 170 void ArrayList<TYPE>::remove_object_number(int number)
 171 {
 172         if(number < total)
 173         {
 174                 if (array_delete)
 175                         delete [] values[number];
 176                 else
 177                         delete values[number];
 178                 remove_number(number);
 179         }
 180         else
 181                 fprintf(stderr, "ArrayList<TYPE>::remove_object_number: number %d out of range %s.\n", number, total);
 182 }
 183
 184
 185 template<class TYPE>
 186 void ArrayList<TYPE>::remove_object()                   // remove value from anywhere in list
 187 {
 188         if(total)
 189         {
 190                 if (array_delete)
 191                         delete [] values[total - 1];
 192                 else
 193                         delete values[total - 1];
 194                 remove();
 195         }
 196         else
 197                 fprintf(stderr, "ArrayList<TYPE>::remove_object: array is 0 length.\n");
 198 }
 199
 200
 201
 202 template<class TYPE>
 203 void ArrayList<TYPE>::remove()
 204 {
 205         total--;
 206 }
 207
 208 // remove pointer from anywhere in list
 209 template<class TYPE>
 210 void ArrayList<TYPE>::remove_number(int number)
 211 {
 212         int in, out;
 213         for(in = 0, out = 0; in < total;)
 214         {
 215                 if(in != number)
 216                         values[out++] = values[in++];
 217                 else
 218 // need to delete it here
 219                         in++;
 220         }
 221         total = out;
 222 }
 223
 224 template<class TYPE>
 225 void ArrayList<TYPE>::remove_all_objects()
 226 {
 227 //printf("ArrayList<TYPE>::remove_all_objects 1 %d\n", total);
 228         for(int i = 0; i < total; i++)
 229         {
 230                 if(array_delete)
 231                         delete [] values[i];
 232                 else
 233                         delete values[i];
 234         }
 235         total = 0;
 236 }
 237
 238 template<class TYPE>
 239 void ArrayList<TYPE>::remove_all()
 240 {
 241         total = 0;
 242 }
 243
 244 // sort from least to greatest value
 245 template<class TYPE>
 246 void ArrayList<TYPE>::sort()
 247 {
 248         int result = 1;
 249         TYPE temp;
 250
 251         while(result)
 252         {
 253                 result = 0;
 254                 for(int i = 0, j = 1; j < total; i++, j++)
 255                 {
 256                         if(values[j] < values[i])
 257                         {
 258                                 temp = values[i];
 259                                 values[i] = values[j];
 260                                 values[j] = temp;
 261                                 result = 1;
 262                         }
 263                 }
 264         }
 265 }
 266
 267 template<class TYPE>
 268 int ArrayList<TYPE>::number_of(TYPE object)
 269 {
 270         for(int i = 0; i < total; i++)
 271         {
 272                 if(values[i] == object) return i;
 273         }
 274         return 0;
 275 }
 276
 277
 278 #endif