CppAD: A C++ Algorithmic Differentiation Package  20130918
template<class VectorKey , class VectorSize >
void CppAD::index_sort ( const VectorKey &  keys,
VectorSize &  ind 
)

Compute the indices that sort a vector of keys.

Template Parameters:
VectorKeySimple vector type that deterimene the sorting order by < operator on its elements.
VectorSizeSimple vector type with elements of size_t that is used to return index values.
Parameters:
keys[in] values that determine the sorting order.
ind[out] must have the same size as keys. The input value of its elements does not matter. The output value of its elements satisfy
( keys[ ind[i] ] < keys[ ind[i+1] ] ) == false 

Definition at line 140 of file index_sort.hpp.

Referenced by anonymous_namespace{link_sparse_jacobian.cpp}::choose_row_col(), anonymous_namespace{link_sparse_hessian.cpp}::choose_row_col(), CppAD::optimize::optimize_run(), CppAD::ipopt::solve_callback< Dvector, ADvector, FG_eval >::solve_callback(), CppAD::ADFun< Base >::SparseHessianCompute(), CppAD::ADFun< Base >::SparseJacobianFor(), and CppAD::ADFun< Base >::SparseJacobianRev().

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines