LinkedList.hpp

Go to the documentation of this file.

#ifndef COMPA_LINKED_LIST_HPP
#define COMPA_LINKED_LIST_HPP
/*******************************************************************************
 *
 * Copyright (c) 2000-2003 Intel Corporation
 * All rights reserved.
 * Copyright (C) 2021+ GPL 3 and higher by Ingo Höft, <Ingo@Hoeft-online.de>
 * Redistribution only with this Copyright remark. Last modified: 2024-03-06
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * * Redistributions of source code must retain the above copyright notice,
 * this list of conditions and the following disclaimer.
 * * 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.
 * * Neither name of Intel Corporation nor the names of its contributors
 * may be used to endorse or promote products derived from this software
 * without specific prior written permission.
 *
 * 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 INTEL 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 "FreeList.hpp"
 
#define EOUTOFMEM (-7 & 1 << 29)
 
typedef void (*free_function)(void* arg);
 
typedef int (*cmp_routine)(void* itemA, void* itemB);
 
struct ListNode {
    struct ListNode* prev;
    struct ListNode* next;
    void* item;
};
 
struct LinkedList {
    ListNode head;
    ListNode tail;
    long size;
    FreeList freeNodeList;
    free_function free_func;
    cmp_routine cmp_func;
};
 
int ListInit(
    LinkedList* list,
    cmp_routine cmp_func,
    free_function free_func);
 
ListNode* ListAddHead(
    LinkedList* list,
    void* item);
 
ListNode* ListAddTail(
    LinkedList* list,
    void* item);
 
ListNode* ListAddAfter(
    LinkedList* list,
    void* item,
    ListNode* bnode);
 
ListNode* ListAddBefore(
    LinkedList* list,
    void* item,
    ListNode* anode);
 
void* ListDelNode(
    LinkedList* list,
    ListNode* dnode,
    int freeItem);
 
int ListDestroy(
    LinkedList* list,
    int freeItem);
 
ListNode* ListHead(
    LinkedList* list);
 
ListNode* ListTail(
    LinkedList* list);
 
ListNode* ListNext(
    LinkedList* list,
    ListNode* node);
 
ListNode* ListPrev(
    LinkedList* list,
    ListNode* node);
 
ListNode* ListFind(
    LinkedList* list,
    ListNode* start,
    void* item);
 
long ListSize(
    LinkedList* list);
 
#endif /* COMPA_LINKED_LIST_HPP */