Mercurial > hg > ucx / file revision

/*
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
 *
 * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 *   1. Redistributions of source code must retain the above copyright
 *      notice, this list of conditions and the following disclaimer.
 *
 *   2. Redistributions in binary form must reproduce the above copyright
 *      notice, this list of conditions and the following disclaimer in the
 *      documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

#include "cx/list.h"

void cxListDestroy(CxList *list) {
    switch (list->content_destructor_type) {
        case CX_DESTRUCTOR_SIMPLE: {
            CxIterator iter = cxListBegin(list);
            cx_foreach(void*, elem, iter) {
                list->simple_destructor(elem);
            }
            break;
        }
        case CX_DESTRUCTOR_ADVANCED: {
            CxIterator iter = cxListBegin(list);
            cx_foreach(void*, elem, iter) {
                list->advanced_destructor.func(list->advanced_destructor.data, elem);
            }
            break;
        }
        case CX_DESTRUCTOR_NONE:
            break; // nothing
    }

    list->cl->destructor(list);
    cxFree(list->allocator, list);
}

int cxListCompare(
        CxList const *list,
        CxList const *other
) {
    if (list->cl->compare == other->cl->compare) {
        /* same compare function, lists are compatible */
        return list->cl->compare(list, other);
    } else {
        /* different compare functions, use iterator */
        if (list->size == other->size) {
            // TODO: we would need a const iterator
            CxIterator left = cxListBegin(list);
            CxIterator right = cxListBegin(other);
            for (size_t i = 0; i < list->size; i++) {
                void *leftValue = cxIteratorCurrent(&left);
                void *rightValue = cxIteratorCurrent(&right);
                int d = list->cmpfunc(leftValue, rightValue);
                if (d != 0) {
                    return d;
                }
                cxIteratorNext(&left);
                cxIteratorNext(&right);
            }
            return 0;
        } else {
            return list->size < other->size ? -1 : 1;
        }
    }
}