src/list.c

Wed, 25 Jan 2023 19:19:29 +0100

author
Mike Becker <universe@uap-core.de>
date
Wed, 25 Jan 2023 19:19:29 +0100
changeset 640
55cc3b373c5e
parent 630
ac5e7f789048
child 641
d402fead3386
permissions
-rw-r--r--

simplify list class - fixes #236

     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 #include <string.h>
    33 void cxListDestroy(CxList *list) {
    34     switch (list->content_destructor_type) {
    35         case CX_DESTRUCTOR_SIMPLE: {
    36             CxIterator iter = cxListBegin(list);
    37             cx_foreach(void*, elem, iter) {
    38                 list->simple_destructor(elem);
    39             }
    40             break;
    41         }
    42         case CX_DESTRUCTOR_ADVANCED: {
    43             CxIterator iter = cxListBegin(list);
    44             cx_foreach(void*, elem, iter) {
    45                 list->advanced_destructor.func(list->advanced_destructor.data, elem);
    46             }
    47             break;
    48         }
    49         case CX_DESTRUCTOR_NONE:
    50             break; // nothing
    51     }
    53     list->cl->destructor(list);
    54     cxFree(list->allocator, list);
    55 }
    57 int cxListCompare(
    58         CxList const *list,
    59         CxList const *other
    60 ) {
    61     if (list->cl->compare == other->cl->compare) {
    62         // same compare function, lists are compatible
    63         return list->cl->compare(list, other);
    64     } else {
    65         // different compare functions, use iterator
    66         if (list->size == other->size) {
    67             CxIterator left = cxListBegin(list);
    68             CxIterator right = cxListBegin(other);
    69             for (size_t i = 0; i < list->size; i++) {
    70                 void *leftValue = cxIteratorCurrent(left);
    71                 void *rightValue = cxIteratorCurrent(right);
    72                 int d = list->cmpfunc(leftValue, rightValue);
    73                 if (d != 0) {
    74                     return d;
    75                 }
    76                 cxIteratorNext(left);
    77                 cxIteratorNext(right);
    78             }
    79             return 0;
    80         } else {
    81             return list->size < other->size ? -1 : 1;
    82         }
    83     }
    84 }
    86 CxMutIterator cxListMutIterator(
    87         CxList *list,
    88         size_t index
    89 ) {
    90     CxIterator it = list->cl->iterator(list, index);
    91     it.base.mutating = true;
    93     // we know the iterators share the same memory layout
    94     CxMutIterator iter;
    95     memcpy(&iter, &it, sizeof(CxMutIterator));
    96     return iter;
    97 }

mercurial