src/LinkedList.h

Go to the documentation of this file.

#ifndef _DJS_LINKEDLIST_H_
#define _DJS_LINKEDLIST_H_

/* 
    This program is free software: you can redistribute it and/or modify 
    it under the terms of the GNU General Public License as published by 
    the Free Software Foundation, either version 3 of the License, or 
    (at your option) any later version. 
 
    This program is distributed in the hope that it will be useful, 
    but WITHOUT ANY WARRANTY; without even the implied warranty of 
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the 
    GNU General Public License for more details. 
 
    You should have received a copy of the GNU General Public License 
    along with this program.  If not, see <http://www.gnu.org/licenses/> 
*/

struct Link;

struct LinkedList
{
    struct Link* head; 
    struct Link* tail; 
#ifdef SMARTLENGTH
    int length; 
#endif
};

struct Link
{
    void* data; 
    struct Link* next; 
    struct Link* prev; 
#ifdef SMARTLENGTH
    struct LinkedList* linkedList; 
#endif
};

typedef struct Link Link;

typedef struct LinkedList LinkedList;

int isHead(Link* list);

int isTail(Link* list);

void* delete(Link* list);

Link* addAfter(Link* list, void* data);

Link* addBefore(Link* list, void* data);

void addLinkBefore(Link* list, Link* newLink);

Link* removeLink(Link* list);

LinkedList* createLinkedList(void);

void destroyLinkedList(LinkedList* linkedList);

void copyLinkedList(LinkedList* destination, 
                    LinkedList* source);

int contains(LinkedList* linkedList, void* data, int (*comparator)(void*,void*));

int equal( LinkedList* list1, 
           LinkedList* list2, 
           int (*comparator)(void*,void*));

void restoreLinksWithReferences(LinkedList* list);

Link* addFirst(LinkedList* linkedList, void* data);

Link* addLast(LinkedList* linkedList, void* data);

Link* removeFirst(LinkedList* linkedList);

Link* removeLast(LinkedList* linkedList);

void deleteLast(LinkedList* linkedList);

void* getFirst(LinkedList* linkedList);

void printListAbbv(LinkedList* linkedList, void (*printFunc)(void*));

void printList(LinkedList* linkedList, void (*printFunc)(void*));

int length(LinkedList* linkedList);

int isEmpty(LinkedList* linkedList);

#endif