src/list.c

changeset 503
a89857072ace
child 519
79d14e821b3a
     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/src/list.c	Tue Feb 15 19:41:48 2022 +0100
     1.3 @@ -0,0 +1,59 @@
     1.4 +/*
     1.5 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
     1.6 + *
     1.7 + * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved.
     1.8 + *
     1.9 + * Redistribution and use in source and binary forms, with or without
    1.10 + * modification, are permitted provided that the following conditions are met:
    1.11 + *
    1.12 + *   1. Redistributions of source code must retain the above copyright
    1.13 + *      notice, this list of conditions and the following disclaimer.
    1.14 + *
    1.15 + *   2. Redistributions in binary form must reproduce the above copyright
    1.16 + *      notice, this list of conditions and the following disclaimer in the
    1.17 + *      documentation and/or other materials provided with the distribution.
    1.18 + *
    1.19 + * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
    1.20 + * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
    1.21 + * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
    1.22 + * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
    1.23 + * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
    1.24 + * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
    1.25 + * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
    1.26 + * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
    1.27 + * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
    1.28 + * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
    1.29 + * POSSIBILITY OF SUCH DAMAGE.
    1.30 + */
    1.31 +
    1.32 +#include "cx/list.h"
    1.33 +
    1.34 +CxList *cxListDestroy(CxList *list) {
    1.35 +    if (list->content_destructor == NULL) {
    1.36 +        if (list->autofree_contents) {
    1.37 +            CxIterator iter = cxListBegin(list);
    1.38 +            cx_foreach(void*, elem, iter) {
    1.39 +                cxFree(list->allocator, elem);
    1.40 +            }
    1.41 +        }
    1.42 +    } else {
    1.43 +        // avoid checking this condition every loop iteration
    1.44 +        if (list->autofree_contents) {
    1.45 +            CxIterator iter = cxListBegin(list);
    1.46 +            cx_foreach(void*, elem, iter) {
    1.47 +                cxFree(list->allocator, list->content_destructor(elem));
    1.48 +            }
    1.49 +        } else {
    1.50 +            CxIterator iter = cxListBegin(list);
    1.51 +            cx_foreach(void*, elem, iter) {
    1.52 +                elem = list->content_destructor(elem);
    1.53 +            }
    1.54 +        }
    1.55 +    }
    1.56 +    if (list->autofree) {
    1.57 +        cxFree(list->allocator, list->list_destructor(list));
    1.58 +        return NULL;
    1.59 +    } else {
    1.60 +        return list->list_destructor(list);
    1.61 +    }
    1.62 +}

mercurial