#include <casacore/casa/aips.h>
#include <casacore/casa/Utilities/Sort.h>
Go to the source code of this file.
|
| casacore |
| this file contains all the compiler specific defines
|
|
|
template<class T > |
uInt | casacore::genSort (T *data, uInt nr, Sort::Order order=Sort::Ascending, int options=0) |
| Global in-place sort functions The following global functions are easier to use than the static GenSort member functions. They do an in-place sort of data, thus the data themselves are moved ending up in the requested order. More...
|
|
template<class T > |
uInt | casacore::genSort (Array< T > &data, Sort::Order order=Sort::Ascending, int options=0) |
|
template<class T > |
uInt | casacore::genSort (Block< T > &data, Sort::Order order=Sort::Ascending, int options=0) |
|
template<class T > |
uInt | casacore::genSort (Block< T > &data, uInt nr, Sort::Order order=Sort::Ascending, int options=0) |
|
template<class T > |
uInt | casacore::genSort (Vector< uInt > &indexVector, const T *data, uInt nr, Sort::Order order=Sort::Ascending, int options=0) |
| Global indirect sort functions The following global functions easier to use than the static GenSortIndirect member functions. They do an indirect sort of data, thus the data themselves are not moved. Rather an index vector is returned giving the sorted data indices. More...
|
|
template<class T > |
uInt | casacore::genSort (Vector< uInt > &indexVector, const Array< T > &data, Sort::Order order=Sort::Ascending, int options=0) |
|
template<class T > |
uInt | casacore::genSort (Vector< uInt > &indexVector, const Block< T > &data, Sort::Order order=Sort::Ascending, int options=0) |
|
template<class T > |
uInt | casacore::genSort (Vector< uInt > &indexVector, const Block< T > &data, uInt nr, Sort::Order order=Sort::Ascending, int options=0) |
|