#include <stdlib.h>
#include <math.h>
#include "LinkedLists.h"
Include dependency graph for LinkedLists.c:

Go to the source code of this file.
Functions | |
| UInt32 | DestroyLinkedList (NodePtr linkedList, UInt8(*DestructorFunction)(NodePtr theNode)) |
| Destroys all elements in a linked list. More... | |
| UInt8 | DestroyIndirectNode (NodePtr theNode) |
| Destroys an indirect node. More... | |
| UInt32 | FindLast (NodePtr linkedList, NodePtr *last) |
| Finds the last node in a linked list. More... | |
| NodePtr | GetNthNode (NodePtr linkedList, UInt32 n) |
| Finds the Nth node of a linked list. More... | |
| NodePtr | SplitAtNth (NodePtr linkedList, UInt32 n) |
| Splits a linked list in two. More... | |
| IndirectNodePtr | FindAndList (NodePtr linkedList, UInt8(*IsWhatIWant)(NodePtr theNode)) |
| Finds nodes in a linked list based on a "matching" function. More... | |
| NodePtr | FindAndMoveOut (NodePtr *linkedListPtr, UInt8(*IsWhatIWant)(NodePtr theNode)) |
| Finds and removes nodes based on a "matching" function. More... | |
| void | ApplyIndirectOnSimple (IndirectNodePtr indirectList) |
| Applies an indirect linked list on a linked list. More... | |
| void | InvertList (NodePtr *linkedListPtr) |
| Inverses a linked list. More... | |
| void | SplitAndMergeSort (NodePtr *linkedList, SInt8(*CompareFunction)(NodePtr a, NodePtr b)) |
| Sorts a linked list. More... | |
Definition in file LinkedLists.c.
1.2.12 written by Dimitri van Heesch,
© 1997-2001