Tue, 05 Oct 2021 11:19:32 +0200
remove convenience macros
Users should write their own wrappers s.t. the type
information does not have to be repeated on every
call site.
universe@390 | 1 | /* |
universe@390 | 2 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. |
universe@390 | 3 | * |
universe@390 | 4 | * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved. |
universe@390 | 5 | * |
universe@390 | 6 | * Redistribution and use in source and binary forms, with or without |
universe@390 | 7 | * modification, are permitted provided that the following conditions are met: |
universe@390 | 8 | * |
universe@390 | 9 | * 1. Redistributions of source code must retain the above copyright |
universe@390 | 10 | * notice, this list of conditions and the following disclaimer. |
universe@390 | 11 | * |
universe@390 | 12 | * 2. Redistributions in binary form must reproduce the above copyright |
universe@390 | 13 | * notice, this list of conditions and the following disclaimer in the |
universe@390 | 14 | * documentation and/or other materials provided with the distribution. |
universe@390 | 15 | * |
universe@390 | 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
universe@390 | 17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
universe@390 | 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
universe@390 | 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
universe@390 | 20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
universe@390 | 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
universe@390 | 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
universe@390 | 23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
universe@390 | 24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
universe@390 | 25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
universe@390 | 26 | * POSSIBILITY OF SUCH DAMAGE. |
universe@390 | 27 | */ |
universe@453 | 28 | /** |
universe@453 | 29 | * \file list.h |
universe@453 | 30 | * \brief Interface for list implementations. |
universe@453 | 31 | * \author Mike Becker |
universe@453 | 32 | * \author Olaf Wintermann |
universe@453 | 33 | * \version 3.0 |
universe@453 | 34 | * \copyright 2-Clause BSD License |
universe@453 | 35 | */ |
universe@390 | 36 | |
universe@390 | 37 | #ifndef UCX_LIST_H |
universe@390 | 38 | #define UCX_LIST_H |
universe@390 | 39 | |
universe@398 | 40 | #include <stdlib.h> |
universe@398 | 41 | #include "allocator.h" |
universe@398 | 42 | |
universe@415 | 43 | #ifdef __cplusplus |
universe@415 | 44 | extern "C" { |
universe@415 | 45 | #endif |
universe@415 | 46 | |
universe@412 | 47 | typedef int(*CxListComparator)(void const *left, void const *right); |
universe@398 | 48 | |
universe@435 | 49 | typedef struct cx_list_s cx_list_s; |
universe@435 | 50 | |
universe@398 | 51 | typedef struct { |
universe@435 | 52 | int (*add)(cx_list_s *list, void *elem); |
universe@435 | 53 | |
universe@435 | 54 | int (*insert)(cx_list_s *list, size_t index, void *elem); |
universe@435 | 55 | |
universe@438 | 56 | int (*remove)(cx_list_s *list, size_t index); |
universe@435 | 57 | |
universe@439 | 58 | void *(*at)(cx_list_s *list, size_t index); |
universe@439 | 59 | |
universe@435 | 60 | size_t (*find)(cx_list_s *list, void *elem); |
universe@435 | 61 | |
universe@435 | 62 | void *(*last)(cx_list_s *list); |
universe@435 | 63 | } cx_list_class; |
universe@435 | 64 | |
universe@435 | 65 | struct cx_list_s { |
universe@435 | 66 | cx_list_class *cl; |
universe@398 | 67 | CxAllocator allocator; |
universe@398 | 68 | CxListComparator cmpfunc; |
universe@401 | 69 | size_t itemsize; |
universe@401 | 70 | size_t size; |
universe@401 | 71 | size_t capacity; |
universe@435 | 72 | }; |
universe@398 | 73 | |
universe@412 | 74 | typedef cx_list_s *CxList; |
universe@398 | 75 | |
universe@398 | 76 | int cxListAdd(CxList list, void *elem); |
universe@398 | 77 | |
universe@398 | 78 | int cxListInsert(CxList list, size_t index, void *elem); |
universe@398 | 79 | |
universe@438 | 80 | int cxListRemove(CxList list, size_t index); |
universe@398 | 81 | |
universe@439 | 82 | void *cxListAt(CxList list, size_t index); |
universe@439 | 83 | |
universe@398 | 84 | size_t cxListFind(CxList list, void *elem); |
universe@398 | 85 | |
universe@404 | 86 | void *cxListLast(CxList list); |
universe@404 | 87 | |
universe@415 | 88 | #ifdef __cplusplus |
universe@415 | 89 | } /* extern "C" */ |
universe@415 | 90 | #endif |
universe@415 | 91 | |
universe@393 | 92 | #endif /* UCX_LIST_H */ |