universe@390: /*
universe@390:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
universe@390:  *
universe@390:  * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved.
universe@390:  *
universe@390:  * Redistribution and use in source and binary forms, with or without
universe@390:  * modification, are permitted provided that the following conditions are met:
universe@390:  *
universe@390:  *   1. Redistributions of source code must retain the above copyright
universe@390:  *      notice, this list of conditions and the following disclaimer.
universe@390:  *
universe@390:  *   2. Redistributions in binary form must reproduce the above copyright
universe@390:  *      notice, this list of conditions and the following disclaimer in the
universe@390:  *      documentation and/or other materials provided with the distribution.
universe@390:  *
universe@390:  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
universe@390:  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
universe@390:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
universe@390:  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
universe@390:  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
universe@390:  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
universe@390:  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
universe@390:  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
universe@390:  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
universe@390:  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
universe@390:  * POSSIBILITY OF SUCH DAMAGE.
universe@390:  */
universe@390: 
universe@390: #ifndef UCX_LIST_H
universe@390: #define UCX_LIST_H
universe@390: 
universe@398: #include <stdlib.h>
universe@398: #include "allocator.h"
universe@398: 
universe@398: typedef int(*CxListComparator)(void *left, void *right);
universe@398: 
universe@398: typedef struct {
universe@398:     CxAllocator allocator;
universe@398:     CxListComparator cmpfunc;
universe@401:     size_t itemsize;
universe@401:     size_t size;
universe@401:     size_t capacity;
universe@406:     char listdata[];
universe@398: } cx_list;
universe@398: 
universe@398: typedef struct {
universe@405:     int (*add)(cx_list *list, void *elem);
universe@405:     int (*insert)(cx_list *list, size_t index, void *elem);
universe@405:     void *(*remove)(cx_list *list, size_t index);
universe@405:     size_t (*find)(cx_list *list, void *elem);
universe@405:     void *(*last)(cx_list *list);
universe@398: } cx_list_class;
universe@398: 
universe@398: struct cx_list_s {
universe@398:     cx_list_class *cl;
universe@398:     cx_list data;
universe@398: };
universe@398: 
universe@398: typedef struct cx_list_s *CxList;
universe@398: 
universe@398: int cxListAdd(CxList list, void *elem);
universe@398: 
universe@398: int cxListInsert(CxList list, size_t index, void *elem);
universe@398: 
universe@398: void *cxListRemove(CxList list, size_t index);
universe@398: 
universe@398: size_t cxListFind(CxList list, void *elem);
universe@398: 
universe@404: void *cxListLast(CxList list);
universe@404: 
universe@393: #endif /* UCX_LIST_H */