Mercurial > hg > webserver / file revision

#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;
}

/* 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;
}