ucx: src/list.c@55cc3b373c5e (annotated)

src/list.c@55cc3b373c5e (annotated)

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

 /*
  * 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"
 #include <string.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) {
             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;
         }
     }
 }
 CxMutIterator cxListMutIterator(
         CxList *list,
         size_t index
 ) {
     CxIterator it = list->cl->iterator(list, index);
     it.base.mutating = true;
     // we know the iterators share the same memory layout
     CxMutIterator iter;
     memcpy(&iter, &it, sizeof(CxMutIterator));
     return iter;
 }

Mercurial > hg > ucx / annotate

src/list.c@55cc3b373c5e (annotated)

src/list.c