inta.c

   1 #include <stdlib.h>
   2 #include <stdio.h>
   3 #include <string.h>
   4 #include "inta.h"
   5
   6 #define NDEBUG
   7 #include <assert.h>
   8
   9 enum {
  10     max_init = 8
  11 };
  12
  13 void inta_init(inta_ptr a)
  14 {
  15     a->max = max_init;
  16     a->count = 0;
  17     a->item = malloc(sizeof(int) * a->max);
  18 }
  19
  20 void inta_init_n(inta_ptr a, int n)
  21 {
  22     a->max = n;
  23     a->count = 0;
  24     a->item = malloc(sizeof(int) * a->max);
  25 }
  26
  27 inta_ptr inta_new()
  28 {
  29     inta_ptr res = malloc(sizeof(inta_t));
  30     inta_init(res);
  31     return res;
  32 }
  33
  34 void inta_remove_all(inta_ptr a)
  35 {
  36     a->max = max_init;
  37     a->count = 0;
  38     free(a->item);
  39     a->item = malloc(sizeof(int) * a->max);
  40 }
  41
  42 int inta_remove_last(inta_ptr a)
  43 {
  44     assert(a->count > 0);
  45     a->count--;
  46     return(a->item[a->count]);
  47 }
  48
  49 void inta_realloc(inta_ptr a, int size)
  50 {
  51     a->max = size;
  52     a->item = realloc(a->item, sizeof(int) * a->max);
  53 }
  54
  55 void inta_append(inta_ptr a, int p)
  56 {
  57     if (a->count == a->max) {
  58         if (!a->max) a->max = max_init;
  59         else a->max *= 2;
  60         a->item = realloc(a->item, sizeof(int) * a->max);
  61     }
  62     a->item[a->count] = p;
  63     a->count++;
  64 }
  65
  66 int inta_index_of(inta_ptr a, int p)
  67 {
  68     int i;
  69     for (i=0; i<a->count; i++) {
  70         if (a->item[i] == p) return i;
  71     }
  72     return -1;
  73 }
  74
  75 void inta_clear(inta_t a)
  76 {
  77     free(a->item);
  78     a->max = 0;
  79     a->count = 0;
  80 }
  81
  82 void inta_remove_index(inta_ptr a, int n)
  83 {
  84     assert(a->count >= n-1);
  85     a->count--;
  86     memmove(a->item + n, a->item + n + 1, sizeof(int) * (a->count - n));
  87 }
  88
  89 void inta_remove(inta_ptr a, int p)
  90 {
  91     int i;
  92     for (i=0; i<a->count; i++) {
  93         if (a->item[i] == p) {
  94             inta_remove_index(a, i);
  95             return;
  96         }
  97     }
  98     assert(0);
  99 }
 100
 101 int inta_index_of_test(inta_ptr a, int (*test)(int))
 102 {
 103     int i;
 104     for (i = 0; i < a->count; i++) if (test(a->item[i])) return i;
 105     return -1;
 106 }
 107
 108 int inta_at_test(inta_ptr a, int (*test)(int))
 109 {
 110     int i;
 111     for (i = 0; i < a->count; i++) {
 112         int p = a->item[i];
 113         if (test(p)) return p;
 114     }
 115     return 0;
 116 }
 117
 118 void inta_remove_test(inta_ptr a, int (*test)(int))
 119 {
 120     int i;
 121     while ((i = inta_index_of_test(a, test) >= 0)) {
 122         inta_remove_index(a, i);
 123     }
 124 }
 125
 126 void inta_swap(inta_ptr a, int i, int j)
 127 {
 128     int tmp = a->item[j];
 129     a->item[j] = a->item[i];
 130     a->item[i] = tmp;
 131 }
 132
 133 void inta_copy(inta_ptr dst, inta_ptr src)
 134 {
 135     inta_realloc(dst, src->count);
 136     memcpy(dst->item, src->item, src->count * sizeof(int));
 137     dst->count = src->count;
 138 }
 139
 140 void inta_forall(inta_t a, void (*func)(int))
 141 {
 142   int *item = a->item;
 143   const int *end = item + a->count;
 144   while (item != end) {
 145     func(*item);
 146     item++;
 147   }
 148 }
 149
 150 void inta_qsort(inta_t a, int (*compar)(const void *, const void *)) {
 151     qsort(a->item, a->count, sizeof(void *), compar);
 152 }