ucx: src/list.c@6c81ee4f11ad

     1 /*

     2  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.

     3  *

     4  * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved.

     5  *

     6  * Redistribution and use in source and binary forms, with or without

     7  * modification, are permitted provided that the following conditions are met:

     8  *

     9  *   1. Redistributions of source code must retain the above copyright

    10  *      notice, this list of conditions and the following disclaimer.

    11  *

    12  *   2. Redistributions in binary form must reproduce the above copyright

    13  *      notice, this list of conditions and the following disclaimer in the

    14  *      documentation and/or other materials provided with the distribution.

    15  *

    16  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"

    17  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE

    18  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE

    19  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE

    20  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR

    21  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF

    22  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS

    23  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN

    24  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)

    25  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE

    26  * POSSIBILITY OF SUCH DAMAGE.

    27  */

    29 #include "cx/list.h"

    31 void cxListDestroy(CxList *list) {

    32     switch (list->content_destructor_type) {

    33         case CX_DESTRUCTOR_SIMPLE: {

    34             CxIterator iter = cxListBegin(list);

    35             cx_foreach(void*, elem, iter) {

    36                 list->simple_destructor(elem);

    37             }

    38             break;

    39         }

    40         case CX_DESTRUCTOR_ADVANCED: {

    41             CxIterator iter = cxListBegin(list);

    42             cx_foreach(void*, elem, iter) {

    43                 list->advanced_destructor.func(list->advanced_destructor.data, elem);

    44             }

    45             break;

    46         }

    47         case CX_DESTRUCTOR_NONE:

    48             break; // nothing

    49     }

    51     list->cl->destructor(list);

    52     cxFree(list->allocator, list);

    53 }

    55 int cxListCompare(

    56         CxList const *list,

    57         CxList const *other

    58 ) {

    59     if (list->cl->compare == other->cl->compare) {

    60         // same compare function, lists are compatible

    61         return list->cl->compare(list, other);

    62     } else {

    63         // different compare functions, use iterator

    64         if (list->size == other->size) {

    65             // TODO: we would need a const iterator

    66             CxIterator left = cxListBegin(list);

    67             CxIterator right = cxListBegin(other);

    68             for (size_t i = 0; i < list->size; i++) {

    69                 void *leftValue = cxIteratorCurrent(&left);

    70                 void *rightValue = cxIteratorCurrent(&right);

    71                 int d = list->cmpfunc(leftValue, rightValue);

    72                 if (d != 0) {

    73                     return d;

    74                 }

    75                 cxIteratorNext(&left);

    76                 cxIteratorNext(&right);

    77             }

    78             return 0;

    79         } else {

    80             return list->size < other->size ? -1 : 1;

    81         }

    82     }

    83 }

Mercurial > hg > ucx / file revision