ListRadixSort Class Template Reference
[Embedded Linked List Package]

Radix-sort functor for ListItem lists. More...

#include <list.h>

List of all members.

Static Public Member Functions
static void	Sort (ListItem &list, param_t parameter)
	Invokes the RadixSort algorithm.

---

Detailed Description

template<typename CompFunc>
class libhfp::ListRadixSort< CompFunc >

Radix-sort functor for ListItem lists.

Templated class with a single static function Sort(), used for sorting lists of any type of object, using the RadixSort algorithm. This is useful for sorting objects for which an integer sort value can be assigned to each. Note the restrictions below. This algorithm exhibits O(N) performance for sorting a list of N objects, guaranteed in all cases. It is usually preferable to MergeSort in cases where it can be used.

Parameters:

CompFunc

Comparison function container-class.

The CompFunc container-class must contain the following members:

• typedef X value_t
  • Type of value being sorted on. Must be an unsigned integral type. Typically this value is unsigned int, although it can be larger or smaller depending on the use.

• const unsigned int m_nbucket_bits
  • Number of bits in the bucket address space. Directly determines the number of buckets to be used, which is (1 << m_nbucket_bits). A safe value is 4. Larger values improve performance for large input lists, but increase fixed overhead.

• typedef X param_t
  • Parameter type to Sort().

• value_t ItemValue(ListItem *item, param_t param)
  • Value-determining function for a given list item. This member-function must be static, and for best results, inline.

---

Member Function Documentation

static void Sort	(	ListItem &	list,
		param_t	parameter
	)			[inline, static]

Invokes the RadixSort algorithm.

Parameters:

	list	List of items.
	parameter	Argument to the comparison function.

---

The documentation for this class was generated from the following file:

• include/libhfp/list.h

---