TOP --> libjdl
Heap sort template.
CJdlSorter
CJdlSorter
~CJdlSorter
m_List
m_Size
m_tmp
Compare
Copy
HeapSort
HeapSortSiftDown
operator =
Sort
public CJdlSorter ( List & list ,
int sizeofList ) ;
Constructor.
Create a container to sort the specified list. The size of the list is specified so that partial contents can be sorted.
| list | The list to be sorted. |
| sizeofList | The number of elements in the list. |
public CJdlSorter ( const CJdlSorter < List ,
Item > & x ) ;
Copy constructor.
public virtual ~ CJdlSorter ( ) ;
Destructor.
It can be overloaded to handle list specific clean up. If you do not overload it, the list will remain intact after the sort object is destroyed.
protected int m_Size
protected List & m_List
protected Item m_tmp
protected void HeapSort ( ) ;
protected void HeapSortSiftDown ( int ,
int ) ;
public virtual int Compare ( Item & a ,
Item & b ) const ;
| a | item a. |
| b | item b. |
public void Sort ( ) ;
Sort the specified list.
public void Copy ( const CJdlSorter < List ,
Item > & x ) ;
Copy operator.
public CJdlSorter < List , Item > & operator = ( const CJdlSorter & x ) ;
Copy operator.
This documentation was generated automatically by the ccdoc tool (version 0.7a).
Click here to submit a bug report or feature request.
Click here to return to the top of the page.