cdi/cdi-lists.c

   1 #include <stdlib.h>
   2 #include <cdi/lists.h>
   3
   4 cdi_list_t cdi_list_create(void)
   5 {
   6     return calloc(1, sizeof(struct cdi_list));
   7 }
   8
   9 void cdi_list_destroy(cdi_list_t list)
  10 {
  11     while (list->first) {
  12         struct cdi_list_element *next = list->first->next;
  13         free(list->first);
  14         list->first = next;
  15     }
  16
  17     free(list);
  18 }
  19
  20 cdi_list_t cdi_list_push(cdi_list_t list, void *value)
  21 {
  22     struct cdi_list_element *new = calloc(1, sizeof(*new));
  23
  24     new->data = value;
  25
  26     new->next = list->first;
  27     list->first = new;
  28     list->cached_index++;
  29     list->size++;
  30
  31     return list;
  32 }
  33
  34 void *cdi_list_pop(cdi_list_t list)
  35 {
  36     struct cdi_list_element *first = list->first;
  37     if (first) {
  38         list->first = first->next;
  39     }
  40     if (list->size) {
  41         list->size--;
  42     }
  43     if (list->cached_index) {
  44         list->cached_index--;
  45     }
  46
  47     if (!first) {
  48         return NULL;
  49     }
  50
  51     void *data = first->data;
  52     free(first);
  53
  54     return data;
  55 }
  56
  57 size_t cdi_list_empty(cdi_list_t list)
  58 {
  59     return !list->size;
  60 }
  61
  62 void *cdi_list_get(cdi_list_t list, size_t index)
  63 {
  64     struct cdi_list_element *ele;
  65
  66     if (list->cached_index && index >= list->cached_index) {
  67         ele = list->cached;
  68         for (size_t i = list->cached_index; i < index && ele; i++) {
  69             ele = ele->next;
  70         }
  71     } else {
  72         ele = list->first;
  73         for (size_t i = 0; i < index && ele; i++) {
  74             ele = ele->next;
  75         }
  76     }
  77
  78     if (!ele) {
  79         return NULL;
  80     }
  81
  82     list->cached_index = index;
  83     list->cached = ele;
  84
  85     return ele->data;
  86 }
  87
  88 cdi_list_t cdi_list_insert(cdi_list_t list, size_t index, void *value)
  89 {
  90     struct cdi_list_element *new, *ele;
  91
  92     if (!index) {
  93         return cdi_list_push(list, value);
  94     }
  95
  96     new = calloc(1, sizeof(*new));
  97     new->data = value;
  98
  99     if (list->cached_index && index > list->cached_index) {
 100         ele = list->cached;
 101         for (size_t i = list->cached_index; i < index - 1 && ele; i++) {
 102             ele = ele->next;
 103         }
 104     } else {
 105         ele = list->first;
 106         for (size_t i = 0; i < index - 1 && ele; i++) {
 107             ele = ele->next;
 108         }
 109     }
 110
 111     if (!ele) {
 112         free(new);
 113         return NULL;
 114     }
 115
 116     if (index > 1) {
 117         list->cached_index = index - 1;
 118         list->cached = ele;
 119     }
 120
 121     new->next = ele->next;
 122     ele->next = new;
 123
 124     if (index == 1 && list->cached_index) {
 125         list->cached_index++;
 126     }
 127
 128     list->size++;
 129
 130     return list;
 131 }
 132
 133 void *cdi_list_remove(cdi_list_t list, size_t index)
 134 {
 135     struct cdi_list_element *ele, *old;
 136
 137     if (!index) {
 138         return cdi_list_pop(list);
 139     }
 140
 141     if (list->cached_index && index > list->cached_index) {
 142         ele = list->cached;
 143         for (size_t i = list->cached_index; i < index - 1 && ele; i++) {
 144             ele = ele->next;
 145         }
 146     } else {
 147         ele = list->first;
 148         for (size_t i = 0; i < index - 1 && ele; i++) {
 149             ele = ele->next;
 150         }
 151     }
 152
 153     if (!ele || !ele->next) {
 154         return NULL;
 155     }
 156
 157     if (index == 1) {
 158         list->cached_index--;
 159     } else {
 160         list->cached_index = index - 1;
 161         list->cached = ele;
 162     }
 163
 164     old = ele->next;
 165     ele->next = old->next;
 166
 167     list->size--;
 168
 169     void *data = old->data;
 170     free(old);
 171
 172     return data;
 173 }
 174
 175 size_t cdi_list_size(cdi_list_t list)
 176 {
 177     return list->size;
 178 }