PLearn 0.1
|
Go to the source code of this file.
Classes | |
class | PLearn::SelectedIndicesCmp< T > |
Namespaces | |
namespace | PLearn |
< for swap | |
Functions | |
template<class T > | |
void | PLearn::sortRows (TMat< T > &mat, const TVec< int > &key_columns, bool increasing_order=true) |
template<class T > | |
void | PLearn::sortElements (const TVec< T > &vec, bool reverse_elems=false) |
Sorts the elements of vec in place. | |
template<class T > | |
void | PLearn::partialSortRows (const TMat< T > &mat, int k, int sortk=1, int col=0) |
Uses partial_sort. | |
template<class T > | |
void | PLearn::sortRows (const TMat< T > &mat, int col=0, bool increasing_order=true) |
This implementation should be very efficient, but it does two memory allocation: a first one of mat.length()*(sizeof(real)+sizeof(int)) and a second one of mat.length()*sizeof(int). | |
template<class T > | |
void | PLearn::sortColumns (const TMat< T > &mat, int rownum) |
template<class T > | |
int | PLearn::binary_search (const TVec< T > &src, T x) |
template<class T > | |
int | PLearn::binary_search (const TMat< T > &src, int c, T x) |
Definition in file TMat_sort.h.