hvirtual/guicast/arraylist.h

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