ucx: ucx/dlist.c@fdabd1240b69 (annotated)

ucx/dlist.c@fdabd1240b69 (annotated)

ucx/dlist.c

Wed, 15 Aug 2012 19:32:29 +0200

author: Mike Becker <universe@uap-core.de>
date: Wed, 15 Aug 2012 19:32:29 +0200
changeset 35: fdabd1240b69
parent 31: 91ac86557290
child 36: a9d656e4f7ce
permissions: -rw-r--r--

added mkdir for build directory to makefile + added qsort for list and dlist

 #include "dlist.h"
 UcxDlist *ucx_dlist_clone(UcxDlist *l, copy_func fnc, void *data) {
     UcxDlist *ret = NULL;
     while (l != NULL) {
         if (fnc != NULL) {
             ret = ucx_dlist_append(ret, fnc(l->data, data));
         } else {
             ret = ucx_dlist_append(ret, l->data);
         }
         l = l->next;
     }
     return ret;
 }
 int ucx_dlist_equals(UcxDlist *l1, UcxDlist *l2, cmp_func fnc, void* data) {
     if (l1 == l2) return 1;
     while (l1 != NULL && l2 != NULL) {
         if (fnc == NULL) {
             if (l1->data != l2->data) return 0;
         } else {
             if (fnc(l1->data, l2->data, data) != 0) return 0;
         }
         l1 = l1->next;
         l2 = l2->next;
     }
     return (l1 == NULL && l2 == NULL);
 }
 void ucx_dlist_free(UcxDlist *l) {
     UcxDlist *e = l, *f;
     while (e != NULL) {
         f = e;
         e = e->next;
         free(f);
     }
 }
 UcxDlist *ucx_dlist_append(UcxDlist *l, void *data)  {
     UcxDlist *nl = (UcxDlist*) malloc(sizeof(UcxDlist));
     if (nl == NULL) return NULL;
     nl->data = data;
     nl->next = NULL;
     if (l == NULL) {
         nl->prev = NULL;
         return nl;
     } else {
         UcxDlist *t = ucx_dlist_last(l);
         t->next = nl;
         nl->prev = t;
         return l;
     }
 }
 UcxDlist *ucx_dlist_prepend(UcxDlist *l, void *data) {
     UcxDlist *nl = ucx_dlist_append(NULL, data);
     if (nl == NULL) return NULL;
     if (l != NULL) {
         nl->next = l;
         l->prev = nl;
     }
     return nl;
 }
 UcxDlist *ucx_dlist_concat(UcxDlist *l1, UcxDlist *l2) {
     if (l1 == NULL) {
         return l2;
     } else {
         UcxDlist *last = ucx_dlist_last(l1);
         last->next = l2;
         l2->prev = last;
         return l1;
     }
 }
 UcxDlist *ucx_dlist_last(UcxDlist *l) {
     if (l == NULL) return NULL;
     UcxDlist *e = l;
     while (e->next != NULL) {
         e = e->next;
     }
     return e;
 }
 UcxDlist *ucx_dlist_get(UcxDlist *l, int index) {
     if (l == NULL) return NULL;
     UcxDlist *e = l;
     while (e->next != NULL && index > 0) {
         e = e->next;
         index--;
     }
     return index == 0 ? e : NULL;
 }
 size_t ucx_dlist_size(UcxDlist *l) {
     if (l == NULL) return 0;
     UcxDlist *e = l;
     size_t s = 1;
     while (e->next != NULL) {
         e = e->next;
         s++;
     }
     return s;
 }
 int ucx_dlist_qsort_devide(UcxDlist** list, int l, int r, cmp_func f, void* d) {
     int i = l;
     int j = r - 1;
     void *p = list[r]->data;
     UcxDlist *b;
     do {
         while (i < r && f(list[i]->data, p, d) <= 0) i++;
         while (j > l && f(list[j]->data, p, d) >= 0) j--;
         if (i < j) {
             b = list[i];
             list[i] = list[j];
             list[j] = b;
         }
     } while (i < j);
     if (f(list[i]->data, p, d) > 0) {
         b = list[r];
         list[r] = list[i];
         list[i] = b;
     }
     return i;
 }
 void ucx_dlist_qsort_sort(UcxDlist** list, int l, int r, cmp_func f, void* d) {
     if (l < r) {
         int m = ucx_dlist_qsort_devide(list, l, r, f, d);
         ucx_dlist_qsort_sort(list, l, m-1, f, d);
         ucx_dlist_qsort_sort(list, m+1, r, f, d);
     }
 }
 UcxDlist *ucx_dlist_qsort(UcxDlist *l, cmp_func fnc, void *data) {
     if (l == NULL) {
         return NULL;
     }
     size_t n = ucx_dlist_size(l);
     if (n == 1) {
         return l;
     }
     UcxDlist *entries[n];
     entries[0] = l;
     for (int i = 1 ; i < n ; i++) {
       entries[i] = entries[i-1]->next;
     }
     ucx_dlist_qsort_sort(entries, 0, n-1, fnc, data);
     entries[0]->prev = NULL;
     for (int i = 0 ; i < n-1 ; i++) {
       entries[i]->next = entries[i+1];
       entries[i+1]->prev = entries[i];
     }
     entries[n-1]->next = NULL;
     return entries[0];
 }
 /* dlist specific functions */
 UcxDlist *ucx_dlist_first(UcxDlist *l) {
     if (l == NULL) return NULL;
     UcxDlist *e = l;
     while (e->prev != NULL) {
         e = e->prev;
     }
     return e;
 }
 UcxDlist *ucx_dlist_remove(UcxDlist *l, UcxDlist *e) {
     if (e->prev == NULL) {
         if(e->next != NULL) {
             e->next->prev = NULL;
             l = e->next;
         } else {
             l = NULL;
         }
     } else {
         e->prev->next = e->next;
         e->next->prev = e->prev;
     }
     free(e);
     return l;
 }

Mercurial > hg > ucx / annotate

ucx/dlist.c@fdabd1240b69 (annotated)

ucx/dlist.c