#include <Sort.h>
Public Member Functions | |
SortKey (const void *data, const CountedPtr< BaseCompare > &, uInt increment, int order) | |
Define a sort key in a given data array using the indicated comparison object, stride and sort order. | |
SortKey (const SortKey &) | |
Copy constructor (copy semantics). | |
~SortKey () | |
SortKey & | operator= (const SortKey &) |
Assignment (copy semantics). | |
uInt | tryGenSort (Vector< uInt > &indexVector, uInt nrrec, int opt) const |
Try if GenSort can be used for this single key. | |
int | order () const |
Get the sort order. | |
Protected Attributes | |
int | order_p |
sort order; -1 = ascending, 1 = descending | |
const void * | data_p |
address of first data point | |
uInt | incr_p |
increment for next data point | |
CountedPtr< BaseCompare > | ccmpObj_p |
comparison object; use CountedPtr for memory management | |
BaseCompare * | cmpObj_p |
comparison object; use raw pointer for performance | |
Friends | |
class | Sort |
Define a Sort key.
Internal
SortKey is a helper class for the Sort class. It holds the following information about a sort key:
Definition at line 62 of file Sort.h.
casacore::SortKey::SortKey | ( | const void * | data, | |
const CountedPtr< BaseCompare > & | , | |||
uInt | increment, | |||
int | order | |||
) |
Define a sort key in a given data array using the indicated comparison object, stride and sort order.
casacore::SortKey::SortKey | ( | const SortKey & | ) |
Copy constructor (copy semantics).
casacore::SortKey::~SortKey | ( | ) |
int casacore::SortKey::order | ( | ) | const [inline] |
Try if GenSort can be used for this single key.
If it succeeds, it returns the resulting number of elements. Otherwise it returns 0.
CountedPtr<BaseCompare> casacore::SortKey::ccmpObj_p [protected] |
comparison object; use CountedPtr for memory management
BaseCompare* casacore::SortKey::cmpObj_p [protected] |
const void* casacore::SortKey::data_p [protected] |
uInt casacore::SortKey::incr_p [protected] |
int casacore::SortKey::order_p [protected] |