---

LinkedLists.h

Go to the documentation of this file.

#ifndef __BENAD_LINKED_LISTS__
#define __BENAD_LINKED_LISTS__

#ifndef __MACTYPES__

typedef unsigned  char  UInt8;
typedef signed    char  SInt8;
typedef unsigned  short UInt16;
typedef signed    short SInt16;
typedef unsigned  long  UInt32;
typedef signed    long  SInt32;

#endif /* #ifndef __MACTYPES__ */


typedef struct Node
{
  struct Node* next;
} Node, *NodePtr;


typedef struct IndirectNode
{
  Node nodeHeader;
  NodePtr nodePtr;
} IndirectNode, *IndirectNodePtr;


typedef struct DoubleNode
{
  struct DoubleNode* next;
  struct DoubleNode* prev;
} DoubleNode, *DoubleNodePtr;


typedef struct BinaryNode
{
  struct BinaryNode* right;
  struct BinaryNode* left;
} BinaryNode, *BinaryNodePtr;

UInt32 DestroyLinkedList(NodePtr linkedList, UInt8 (*DestructorFunction)(NodePtr theNode));
UInt32 FindLast(NodePtr linkedList, NodePtr* last);

#define NbrNodes(linkedList) FindLast(linkedList, NULL)
NodePtr GetNthNode(NodePtr linkedList, UInt32 n);
NodePtr SplitAtNth(NodePtr linkedList, UInt32 n);
IndirectNodePtr FindAndList(NodePtr linkedList, UInt8 (*IsWhatIWant)(NodePtr theNode));
NodePtr FindAndMoveOut(NodePtr *linkedListPtr, UInt8 (*IsWhatIWant)(NodePtr theNode));
void ApplyIndirectOnSimple(IndirectNodePtr indirectList);
void InvertList(NodePtr *linkedListPtr);
void SplitAndMergeSort(NodePtr *linkedList, SInt8 (*CompareFuntion)(NodePtr a, NodePtr b));

void InvertDoubleList(DoubleNodePtr *doubleLinkedListPtr);
UInt32 FindFirst(DoubleNodePtr linkedList, DoubleNodePtr* first);
void FillPrev(DoubleNodePtr linkedList);

void InsertInTree(BinaryNodePtr theNode, BinaryNodePtr *root,
      SInt8 (*CompareFunction)(NodePtr a, NodePtr b));
BinaryNodePtr SortedDoubleToBinaryWithSize(DoubleNodePtr linkedList, UInt32 size);

#define SortedDoubleToBinary(l) SortedDoubleToBinaryWithSize(l, NbrNodes((NodePtr)(l)));
DoubleNodePtr BinaryToDouble(BinaryNodePtr root, UInt8 fillPrev);
IndirectNodePtr* LeftNodeRight(BinaryNodePtr node, IndirectNodePtr *theList);
void BalanceTree(BinaryNodePtr *root);

UInt8 DestroyIndirectNode(NodePtr theNode);

#endif /* #ifndef __BENAD_LINKED_LISTS__ */

---