Mon, 25 Jul 2022 14:01:45 +0200
fix putc tests to make more sense of the bitwise or
universe@503 | 1 | /* |
universe@503 | 2 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. |
universe@503 | 3 | * |
universe@503 | 4 | * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved. |
universe@503 | 5 | * |
universe@503 | 6 | * Redistribution and use in source and binary forms, with or without |
universe@503 | 7 | * modification, are permitted provided that the following conditions are met: |
universe@503 | 8 | * |
universe@503 | 9 | * 1. Redistributions of source code must retain the above copyright |
universe@503 | 10 | * notice, this list of conditions and the following disclaimer. |
universe@503 | 11 | * |
universe@503 | 12 | * 2. Redistributions in binary form must reproduce the above copyright |
universe@503 | 13 | * notice, this list of conditions and the following disclaimer in the |
universe@503 | 14 | * documentation and/or other materials provided with the distribution. |
universe@503 | 15 | * |
universe@503 | 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
universe@503 | 17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
universe@503 | 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
universe@503 | 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
universe@503 | 20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
universe@503 | 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
universe@503 | 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
universe@503 | 23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
universe@503 | 24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
universe@503 | 25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
universe@503 | 26 | * POSSIBILITY OF SUCH DAMAGE. |
universe@503 | 27 | */ |
universe@503 | 28 | |
universe@503 | 29 | #include "cx/list.h" |
universe@503 | 30 | |
universe@528 | 31 | void cxListDestroy(CxList *list) { |
universe@528 | 32 | switch (list->content_destructor_type) { |
universe@528 | 33 | case CX_DESTRUCTOR_SIMPLE: { |
universe@528 | 34 | CxIterator iter = cxListBegin(list); |
universe@528 | 35 | cx_foreach(void*, elem, iter) { |
universe@528 | 36 | list->simple_destructor(elem); |
universe@528 | 37 | } |
universe@528 | 38 | break; |
universe@503 | 39 | } |
universe@528 | 40 | case CX_DESTRUCTOR_ADVANCED: { |
universe@528 | 41 | CxIterator iter = cxListBegin(list); |
universe@528 | 42 | cx_foreach(void*, elem, iter) { |
universe@528 | 43 | list->advanced_destructor.func(list->advanced_destructor.data, elem); |
universe@528 | 44 | } |
universe@528 | 45 | break; |
universe@528 | 46 | } |
universe@528 | 47 | case CX_DESTRUCTOR_NONE: |
universe@528 | 48 | break; // nothing |
universe@503 | 49 | } |
universe@528 | 50 | |
universe@524 | 51 | list->cl->destructor(list); |
universe@524 | 52 | cxFree(list->allocator, list); |
universe@503 | 53 | } |