PUBLIC

DLinkHeadC::DLinkHeadC(void) DLinkHeadC::IsEmpty(void) const DLinkHeadC::Size(void) const DLinkHeadC::Reverse(void) DLinkHeadC::MergeSort(MergeSortInterCmpT,void *) DLinkHeadC::Head(void) DLinkHeadC::Head(void) const DLinkHeadC::InsFirst(DLinkC &) DLinkHeadC::InsLast(DLinkC &) DLinkHeadC::MoveFirst(DLinkHeadC &) DLinkHeadC::MoveLast(DLinkHeadC &) DLinkHeadC::MoveFirst(DLinkC &) DLinkHeadC::MoveLast(DLinkC &) DLinkHeadC::MergeSortInternal(DLinkC **,UIntT,MergeSortInterCmpT,void *)

DListBodyC
IntrDListC

typedef bool (*MergeSortInterCmpT)(DLinkC * l1,DLinkC * l2,void * dat) ;

Comparison function for merge sort.

DLinkC head;

Head of list.

DLinkHeadC()

Default constructor.
creates an empty list.

bool IsEmpty() const

Is list empty ?

UIntT Size() const

Count the number of elements in the list.
This is of order N, where N is the number of elements in the list.

void Reverse()

Reverse the order of the list.
This is of order N, where N is the number of elements in the list.

void MergeSort(MergeSortInterCmpT ms,void * pass = 0)

Merge sort the list using given comparison function.

DLinkC & Head()

Get head of list.

const DLinkC & Head() const

Get head of list.

void InsFirst(DLinkC & dat)

Push element onto the begining of the list.

void InsLast(DLinkC & dat)

Push element onto the begining of the list.

void MoveFirst(DLinkHeadC & lst)

Move the entire contents of 'lst' to the front of this one.
this leaves 'lst' empty.

void MoveLast(DLinkHeadC & lst)

Move the entire contents of 'lst' to the back of this one.
this leaves 'lst' empty.

void MoveFirst(DLinkC & at)

Move the item 'at' to the front of this list

void MoveLast(DLinkC & at)

Move the item 'at' to the back of this list

DLinkC ** MergeSortInternal(DLinkC ** chead,UIntT n,MergeSortInterCmpT ms,void * pass)

Merge sort the list using given comparison function.