tpie::ami::qsort_item< Key > Class Template Reference

A simple class that facilitates doing key sorting followed by in-memory permuting to sort items in-memory. More...

#include <tpie/internal_sort.h>

Public Attributes
Key	keyval
TPIE_OS_SIZE_T	source

Friends
int	operator== (const qsort_item &x, const qsort_item &y)
int	operator!= (const qsort_item &x, const qsort_item &y)
int	operator<= (const qsort_item &x, const qsort_item &y)
int	operator>= (const qsort_item &x, const qsort_item &y)
int	operator< (const qsort_item &x, const qsort_item &y)
int	operator> (const qsort_item &x, const qsort_item &y)

Detailed Description

template<class Key>
class tpie::ami::qsort_item< Key >

A simple class that facilitates doing key sorting followed by in-memory permuting to sort items in-memory.

This is particularly useful when key size is much smaller than item size. Note that using this requires that the class Key have the comparison operators defined appropriately.

Definition at line 48 of file internal_sort.h.

---

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

• internal_sort.h