#include "igl_inline.h"
#include <vector>
#include <Eigen/Core>
#include "sort.cpp"

Go to the source code of this file.

Namespaces
namespace	igl

Functions
template<typename DerivedX , typename DerivedY , typename DerivedIX >
void	igl::sort (const Eigen::DenseBase< DerivedX > &X, const int dim, const bool ascending, Eigen::PlainObjectBase< DerivedY > &Y, Eigen::PlainObjectBase< DerivedIX > &IX)
	Sort the elements of a matrix X along a given dimension like matlabs sort function.

template<typename DerivedX , typename DerivedY >
void	igl::sort (const Eigen::DenseBase< DerivedX > &X, const int dim, const bool ascending, Eigen::PlainObjectBase< DerivedY > &Y)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

template<typename DerivedX , typename DerivedY , typename DerivedIX >
void	igl::sort_new (const Eigen::DenseBase< DerivedX > &X, const int dim, const bool ascending, Eigen::PlainObjectBase< DerivedY > &Y, Eigen::PlainObjectBase< DerivedIX > &IX)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

template<typename DerivedX , typename DerivedY , typename DerivedIX >
void	igl::sort2 (const Eigen::DenseBase< DerivedX > &X, const int dim, const bool ascending, Eigen::PlainObjectBase< DerivedY > &Y, Eigen::PlainObjectBase< DerivedIX > &IX)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

template<typename DerivedX , typename DerivedY , typename DerivedIX >
void	igl::sort3 (const Eigen::DenseBase< DerivedX > &X, const int dim, const bool ascending, Eigen::PlainObjectBase< DerivedY > &Y, Eigen::PlainObjectBase< DerivedIX > &IX)
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

template<class T >
void	igl::sort (const std::vector< T > &unsorted, const bool ascending, std::vector< T > &sorted, std::vector< size_t > &index_map)
	Act like matlab's [Y,I] = SORT(X) for std library vectors.

Namespaces

Functions